Computing with Infinitely Many Processes
We explore four classic problems in concurrent computing (election, mutual exclusion, consensus, and naming) when the number of processes which may participate is infinite. Partial information about the number of actually participating processes and the concurrency level is shown to affect the possibility and complexity of solving these problems. We survey and generalize work carried out in models with finite bounds on the number of processes, and prove several new results. These include improved bounds for election when participation is required and a new adaptive algorithm for star vat ion-free mutual exclusion in a model with unbounded concurrency. We also explore models where objects stronger than atomic registers, such as test&set bits, semaphores or read-modify- write registers, are used.
KeywordsOperating System Communication Network Problem Complexity Algorithm Analysis Classic Problem
Unable to display preview. Download preview PDF.
- [GK98]E. Gafni and E. Koutsoupias. On uniform protocols. http://www.cs.ucla.edu/~eli/eli.html, 1998.
- [Pet94]G. L. Peterson. New bounds on mutual exclusion problems. Technical Report TR68, University of Rochester, February 1980 (Corrected, Nov. 1994).Google Scholar
- [SP89]E. Styer and G. L. Peterson. Tight bounds for shared memory symmetric mutual exclusion problems. In Proc. 8th PODC, pages 177–191, 1989.Google Scholar
- [YA94]J-H. Yang and J.H. Anderson. Time bounds for mutual exclusion and related problems. In Proc. 26th ACM Symp. on Theory of Computing, May 1994.Google Scholar