The Colored Ticket Algorithm

Upper and lower bounds are proved for shared space requirements for solution of a problem involving resource allocation among asynchronous processes. The problem is to allocate some number, k≥1, of resources, in an environment in which processes can fail by stopping without warning. Allocation is to...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Fischer, Michael J., Lynch, Nancy A., Burns, James, Borodin, Allan
Έκδοση: 2023
Διαθέσιμο Online:https://hdl.handle.net/1721.1/149079