The Colored Ticket Algorithm
Author(s)
Fischer, Michael J.; Lynch, Nancy A.; Burns, James; Borodin, Allan
DownloadMIT-LCS-TM-269.pdf (4.913Mb)
Metadata
Show full item recordAbstract
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 be as FIFO as possible, subject to variations imposed by the possibility of failures.
Date issued
1983-08Series/Report no.
MIT-LCS-TM-269