Nonatomic dual bakery algorithm with bounded tokens

DOI10.1007/S00236-011-0132-0zbMath1244.68083OpenAlexW2138502430MaRDI QIDQ766163

Alex A. Aravind, Wim H. Hesselink

Publication date: 23 March 2012

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/2523090/2011ActaInfAravind.pdf

zbMATH Keywords

mutual exclusionbounded sizefirst-come-first-servenonatomic shared variables

Mathematics Subject Classification ID

Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed algorithms (68W15)

Related Items (2)

Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos ⋮ Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms

Uses Software

• SPIN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of refinement mappings
• A queue based mutual exclusion algorithm
• On interprocess communication. I: Basic formalism
• Myths about the mutual exclusion problem
• Bounded time-stamps
• A fine-grained solution to the mutual exclusion problem
• Nonatomic mutual exclusion with local spinning
• A challenge for atomicity verification
• A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
• A new solution of Dijkstra's concurrent programming problem
• A new solution to the critical section problem
• The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
• The mutual exclusion problem

This page was built for publication: Nonatomic dual bakery algorithm with bounded tokens