Correctness and concurrent complexity of the Black-White Bakery Algorithm. (April 2016)

• Record Type: Journal Article
• Authors: Hesselink, Wim
• Is Part Of: Formal aspects of computing. Volume 28:Number 2(2016)
• Page Start: 325
• Page End: 341
• Publication Date: 2016-04
• Subjects: Mutual exclusion -- FCFS -- Concurrent complexity -- UNITY; Computer science -- Periodicals; 004.05
• DOI: 10.1007/s00165-016-0364-4
• Languages: English
• ISSNs: 0934-5043

Abstract

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, sayN . The present paper offers an assertional proof of correctness and shows that the concurrent complexity for throughput is linear inN, and for individual progress is quadratic inN . This is proved with a bounded version of UNITY, i.e., by assertional means.