Lamport's algorithm reconsidered

Authors:
H. Neil Singleton;Ronnie G. Ward
Affiliations:
-;-
Venue:
ACM '82 Proceedings of the ACM '82 conference
Year:
1982

Citing 2
Cited 0

Synchronization with eventcounts and sequencers

Communications of the ACM
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM

Quantified Score

Hi-index	0.00

Visualization

Abstract

A modification to Lamport's algorithm that eliminates busy waiting is presented. A processor that is waiting to enter its critical section is freed to do other useful work. The algorithm is modified further to recognize and honor priorities.