We are experiencing some difficulties with our submission forms, which we are working to resolve. If you have any issues, please contact us at dspace-lib@mit.edu.

The Colored Ticket Algorithm

Thumbnail Image
Download
Name

MIT-LCS-TM-269.pdf

Size

4.91 MB

Format

Adobe PDF

Checksum (MD5)

01f618c0c52a6b9569499e11531d5219

Author(s)
Fischer, Michael J.
•
Lynch, Nancy A.
•
Burns, James
•
Borodin, Allan
Date Issued
August 1983
Series/Report no.
MIT-LCS-TM-269
Abstract
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.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.