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...
| Main Authors: | , , , |
|---|---|
| Published: |
2023
|
| Online Access: | https://hdl.handle.net/1721.1/149079 |
| _version_ | 1826188972470042624 |
|---|---|
| author | Fischer, Michael J. Lynch, Nancy A. Burns, James Borodin, Allan |
| author_facet | Fischer, Michael J. Lynch, Nancy A. Burns, James Borodin, Allan |
| author_sort | Fischer, Michael J. |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T08:07:51Z |
| id | mit-1721.1/149079 |
| institution | Massachusetts Institute of Technology |
| last_indexed | 2024-09-23T08:07:51Z |
| publishDate | 2023 |
| record_format | dspace |
| spelling | mit-1721.1/1490792023-03-30T04:24:05Z The Colored Ticket Algorithm Fischer, Michael J. Lynch, Nancy A. Burns, James Borodin, Allan 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. 2023-03-29T14:25:16Z 2023-03-29T14:25:16Z 1983-08 https://hdl.handle.net/1721.1/149079 14694481 MIT-LCS-TM-269 application/pdf |
| spellingShingle | Fischer, Michael J. Lynch, Nancy A. Burns, James Borodin, Allan The Colored Ticket Algorithm |
| title | The Colored Ticket Algorithm |
| title_full | The Colored Ticket Algorithm |
| title_fullStr | The Colored Ticket Algorithm |
| title_full_unstemmed | The Colored Ticket Algorithm |
| title_short | The Colored Ticket Algorithm |
| title_sort | colored ticket algorithm |
| url | https://hdl.handle.net/1721.1/149079 |
| work_keys_str_mv | AT fischermichaelj thecoloredticketalgorithm AT lynchnancya thecoloredticketalgorithm AT burnsjames thecoloredticketalgorithm AT borodinallan thecoloredticketalgorithm AT fischermichaelj coloredticketalgorithm AT lynchnancya coloredticketalgorithm AT burnsjames coloredticketalgorithm AT borodinallan coloredticketalgorithm |