A note on Lamport's mutual exclusion algorithm

Authors:
Tai-Kuo Woo
Affiliations:
Department of Computer and Information Sciences, Jacksonville University, Jacksonville, FL
Venue:
ACM SIGOPS Operating Systems Review
Year:
1990

Citing 1
Cited 1

A new solution of Dijkstra's concurrent programming problem

Communications of the ACM

Highly-fair bakery algorithm using symmetric tokens

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Lamport's mutual exclusion exclusion algorithm, also known as the bakery algorithm, is very simple and easy to implement. However, the ticket numbers assigned to the processes wishing to enter the critical section can become indeterminately large. This paper resolves this problem by allowing the ticket numbers to move around a ring of length 2N, where N is the number of processes. The comparison of two ticket numbers is based the distance between them and their magnitudes.