Affordable Access

Access to the full text

Correctness and concurrent complexity of the Black-White Bakery Algorithm

Authors
  • Hesselink, Wim H.1
  • 1 University of Groningen, Johann Bernoulli Institute, Groningen, The Netherlands , Groningen (Netherlands)
Type
Published Article
Journal
Formal Aspects of Computing
Publisher
Springer London
Publication Date
Mar 29, 2016
Volume
28
Issue
2
Pages
325–341
Identifiers
DOI: 10.1007/s00165-016-0364-4
Source
Springer Nature
Keywords
License
Green

Abstract

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.

Report this publication

Statistics

Seen <100 times