Affiliation:
1. Georgia Institute of Technology, Atlanta, Georgia
Abstract
The problem of mutual exclusion among N asynchronous, parallel processes using only shared binary variables for communication is considered. Upper and lower bounds of N+1 and N shared binary variables, respectively, are shown for the problem of mutual exclusion with linear waiting. Lockout-free mutual exclusion is shown to require at least N shared binary variables when the primitive operations are suitably restricted. This latter bound is tight for N=2.
Publisher
Association for Computing Machinery (ACM)
Reference5 articles.
1. Solution of a problem in concurrent programming control
2. Additional comments on a problem in concurrent programming control
3. Further comments on Dijkstra's concurrent programming control problem
4. Miller R. and C. Yap "Formal Specification and Analysis of Loosely Connected Processes" IBM Research Report RC 6717 (Sep 1977). Miller R. and C. Yap "Formal Specification and Analysis of Loosely Connected Processes" IBM Research Report RC 6717 (Sep 1977).
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Multiprocessor Real-Time Locking Protocols;Handbook of Real-Time Computing;2022
2. Multiprocessor Real-Time Locking Protocols;Handbook of Real-Time Computing;2019
3. Distributed Computing Pearls;Synthesis Lectures on Distributed Computing Theory;2018-05-08
4. Atomicity*;Understanding Control Flow;2016
5. Priority Mutual Exclusion: Specification and Algorithm;Lecture Notes in Computer Science;2016