Distributed FIFO Allocation of Identical Resources Using Small Shared Space
Name
MIT-LCS-TM-290.pdf
Size
6.3 MB
Format
Adobe PDF
Checksum (MD5)
b5478c698922a27153df4771d63785db
Author(s)
Fischer, Michael J.
Lynch, Nancy A.
Burns, James
Borodin, Allan
Date Issued
October 1985
Series/Report no.
MIT-LCS-TM-290
Abstract
We present a simple and efficient algorithm for the FIFO allocation of k identical resources among asynchronous processes which communicate via shared memory. The algorithm simulates a shared queue but uses exponentially fewer shared memory values, resulting in practical savings of time and space as well as program complexity. The algorithm is robust against processes failure through unannounced stopping, making it attractive also for use in an environment of processes of widely differing speeds. In addition to its practical advantages, we show the algorithm is optimal (to within a constant factor) with respect to shared space complexity.
Persistent DSpace Link
