The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
From MaRDI portal
Publication:5464211
DOI10.1007/978-3-540-30186-8_5zbMath1110.68546OpenAlexW197500586MaRDI QIDQ5464211
Publication date: 17 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-30186-8_5
Related Items (12)
A visit to mutual exclusion in seven dates ⋮ Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Highly-fair bakery algorithm using symmetric tokens ⋮ Computing with infinitely many processes ⋮ Tournaments for mutual exclusion: verification and concurrent complexity ⋮ Group mutual exclusion in linear time and space ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Closing the complexity gap between FCFS mutual exclusion and mutual exclusion ⋮ Logical classification of distributed algorithms (Bakery algorithms as an example) ⋮ Correctness and concurrent complexity of the black-white bakery algorithm ⋮ Nonatomic dual bakery algorithm with bounded tokens
This page was built for publication: The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
