Avoiding Register Overflow in the Bakery Algorithm

  title={Avoiding Register Overflow in the Bakery Algorithm},
  author={A. Abdi and M. Sharifi},
  journal={49th International Conference on Parallel Processing - ICPP : Workshops},
  • A. Abdi, M. Sharifi
  • Published 2020
  • Computer Science
  • 49th International Conference on Parallel Processing - ICPP : Workshops
Computer systems are designed to make resources available to users and users may be interested in some resources more than others, therefore, a coordination scheme is required to satisfy the users’ requirements. This scheme may implement certain policies such as “never allocate more than X units of resource Z”. One policy that is of particular interest is the inability of users to access a single resource at the same time, which is called the problem of mutual exclusion. Resource management… Expand


Nonatomic dual bakery algorithm with bounded tokens
A simple mutual exclusion algorithm is presented that only uses nonatomic shared variables of bounded size, and that satisfies bounded overtaking and liveness under weak fairness, which is formalized and proved in a set-theoretic version of temporal logic. Expand
Distributed Lock Management with RDMA: Decentralization without Starvation
DSLR (Decentralized and Starvation-free Lock management with RDMA), a decentralized lock manager that targets distributed systems running on RDMA-enabled networks, is presented and it is shown that it is possible for a lock manager to be fully decentralized and yet exchange the partial knowledge necessary for preventing starvation and thereby reducing tail latencies. Expand
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
A mutual exclusion algorithm is presented that is the first algorithm (using only atomic registers) which satisfies both FIFO and local-spinning, and the first bounded space algorithm which satisfy both FifO and adaptivity. Expand
Peterson's Mutual Exclusion Algorithm Revisited
This last technical chapter is not really about Peterson’s algorithm, although it may reinforce the beauty of that design, but is a serious and fundamental criticism that one may have of the method of multiprogramming proposed in this book. Expand
Mutual exclusion revisited
  • B. Szymanski
  • Computer Science
  • Proceedings of the 5th Jerusalem Conference on Information Technology, 1990. 'Next Decade in Information Technology'
  • 1990
A family of four mutual exclusion algorithms is presented. Its members vary from a simple three-bit linear wait mutual exclusion to the four-bit first-come first-served algorithm immune to variousExpand
Bounding Lamport's Bakery Algorithm
A small modification to Lamport's Bakery algorithm is made, which overcomes a drawback of a famous algorithm while preserving its elegance. Expand
Highly-fair bakery algorithm using symmetric tokens
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 rangeExpand
Additional comments on a problem in concurrent programming control
Professor Dijkstra's ingenious construction and Hyman's "simplification" for the case of two computers hardly works at all, and it is hoped that this letter can save people some of the problems they would encounter if they were to use either of those methods. Expand
How to write a 21st century proof
A method of writing proofs is described that makes it harder to prove things that are not true. The method, based on hierarchical structuring, is simple and practical. The author’s twenty years ofExpand
A new solution of Dijkstra's concurrent programming problem
A simple solution to the mutual exclusion problem is presented which allows the system to continue to operate despite the failure of any individual component.