Highly-fair bakery algorithm using symmetric tokens

DOI10.1016/j.ipl.2010.09.004zbMath1379.68244OpenAlexW2074482157MaRDI QIDQ1675821

Alex A. Aravind

Publication date: 3 November 2017

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.09.004

zbMATH Keywords

fairnessconcurrencydistributed algorithmmutual exclusionbakery algorithmbounded timestamps

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (1)

Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

Uses Software

• SPIN
• jSpin

Cites Work

• A starvation-free solution to the mutual exclusion problem
• Bounded time-stamps
• A new solution of Dijkstra's concurrent programming problem
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Highly-fair bakery algorithm using symmetric tokens