Queue based mutual exclusion with linearly bounded overtaking

Authors:
Wim H. Hesselink;Alex A. Aravind
Affiliations:
Department of Computing Science, University of Groningen, P.O. Box 407, 9700 AK Groningen, The Netherlands;Computer Science Program, University of Northern British Columbia, Prince George, BC, Canada, V2N4Z9
Venue:
Science of Computer Programming
Year:
2011

Citing 11
Cited 0

Algorithms for mutual exclusion

Algorithms for mutual exclusion
Absence of individual starvation using weak semaphores

Information Processing Letters
Parallel program design: a foundation

Parallel program design: a foundation
A more efficient generalization of Peterson's mutual exclusion algorithm

Information Processing Letters
The existence of refinement mappings

Theoretical Computer Science
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Solution of a problem in concurrent programming control

Communications of the ACM
Shared-memory mutual exclusion: major research trends since 1986

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Synchronization Algorithms and Concurrent Programming

Synchronization Algorithms and Concurrent Programming
A queue based mutual exclusion algorithm

Acta Informatica
A mutual exclusion algorithm with optimally bounded bypasses

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The queue based mutual exclusion protocol establishes mutual exclusion for N1 threads by means of not necessarily atomic variables. In order to enter the critical section, a competing thread needs to traverse as many levels as there are currently competing threads. Competing threads can be overtaken by other competing threads. It is proved here, however, that every competing thread is overtaken less than N times, and that the overtaking threads were competing when the first one of them exits.