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

DOI10.1016/j.jpdc.2013.03.009zbMath1327.68040OpenAlexW2068333993MaRDI QIDQ897371

Alex A. Aravind

Publication date: 18 December 2015

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jpdc.2013.03.009

zbMATH Keywords

concurrent programmingmutual exclusionmulticore processorsFCFS fairnessnonatomic algorithmsprocess/thread synchronizationspace optimal

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Correctness and concurrent complexity of the black-white bakery algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Nonatomic dual bakery algorithm with bounded tokens
• Highly-fair bakery algorithm using symmetric tokens
• Concurrent Programming: Algorithms, Principles, and Foundations
• A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
• A new solution of Dijkstra's concurrent programming problem
• Shared-memory mutual exclusion: major research trends since 1986
• 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: Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms