Correctness and concurrent complexity of the Black-White Bakery Algorithm

Lamport’s Bakery Algorithm (Commun ACM 17:453–455, 1974 ) implements mutual exclusion for a fixed number of threads with the first-come first-served property. It has the disadvantage, however, that it uses integer communication variables that can become arbitrarily large. Taubenfeld’s Black-White Ba...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Formal aspects of computing Jg. 28; H. 2; S. 325 - 341
1. Verfasser: Hesselink, Wim H.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: London Springer London 01.04.2016
Association for Computing Machinery
Schlagworte:
Algorithms
Bakery products
Complexity
Computation
Computer Science
Disks
Integers
Math Applications in Computer Science
Mathematical models
Original Article
Theory of Computation
Unity
FCFS
Mutual exclusion
Concurrent complexity
UNITY
ISSN:0934-5043, 1433-299X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Lamport’s Bakery Algorithm (Commun ACM 17:453–455, 1974 ) implements mutual exclusion for a fixed number of threads with the first-come first-served property. It has the disadvantage, however, that it uses integer communication variables that can become arbitrarily large. Taubenfeld’s Black-White Bakery Algorithm (Proceedings of the DISC. LNCS, vol 3274, pp 56–70, 2004 ) keeps the integers bounded, and is adaptive in the sense that the time complexity only depends on the number of competing threads, say N . The present paper offers an assertional proof of correctness and shows that the concurrent complexity for throughput is linear in N , and for individual progress is quadratic in N . This is proved with a bounded version of UNITY, i.e., by assertional means.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
ISSN:0934-5043
1433-299X
DOI:10.1007/s00165-016-0364-4