The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Bounds on shared memory for mutual exclusion
Information and Computation
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Data Requirements for Implementation of N-Process Mutual Exclusion Using a Single Shared Variable
Journal of the ACM (JACM)
Distributed computing: fundamentals, simulations and advanced topics
Distributed computing: fundamentals, simulations and advanced topics
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Lamport on mutual exclusion: 27 years of planting seeds
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract)
Proceedings of the Fifth Colloquium on Automata, Languages and Programming
Bounding Lamport's Bakery Algorithm
SOFSEM '01 Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics Piestany: Theory and Practice of Informatics
Economical solutions for the critical section problem in a distributed system (Extended Abstract)
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Highly-fair bakery algorithm using symmetric tokens
Information Processing Letters
Logical classification of distributed algorithms (Bakery algorithms as an example)
Theoretical Computer Science
| Hi-index | 0.00 |
We propose two simple algorithms based on bounded tickets for the mutual exclusion problem. These are modifications of the Bakery algorithm. An unattractive property of the Bakery algorithm is that the shared memory size is unbounded. The first algorithm based on bounded tickets uses one extra process that does not correspond to any user. It is lockout-free and mutual exclusion on the asynchronous single-writer/multi-reader shared memory model. We then modify it to reduce the shared memory size with the cost of another extra process. The maximum waiting time using each of them is bounded by (n - 1)c + O(nl), where n is the number of users, l is an upper bound on the time between two successive atomic steps, and c is an upper bound on the time that any user spends using the resource. The shared memory size needed by the first algorithm and the second algorithm are (n+1)(1+驴log(2n+1)驴) bits and n(2 + 驴log n驴) + 2 bits, respectively.