Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
A note on Lamport's mutual exclusion algorithm
ACM SIGOPS Operating Systems Review
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
Distributed Algorithms
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
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
Distributed Computing
Principles of Concurrent and Distributed Programming (2nd Edition) (Prentice-Hall International Series in Computer Science)
Trends in Embedded Systems--A Microsoft Perspective
MSE '07 Proceedings of the 2007 IEEE International Conference on Microelectronic Systems Education
Principles of the Spin Model Checker
Principles of the Spin Model Checker
Embedded Multicore Processors and Systems
IEEE Micro
If a picture is worth a thousand words, what would an animation be worth?
Proceedings of the 16th Western Canadian Conference on Computing Education
Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Journal of Parallel and Distributed Computing
| Hi-index | 0.89 |
This note proposes a new version of the bakery algorithm that: (i) assures fair tie-breaking when two or more processes choose same token number; and (ii) bounds the token numbers within the range [-n,n]. The algorithm is simple and uses one additional shared bit.