Highly-fair bakery algorithm using symmetric tokens

This note proposes a new version of the bakery algorithm that: (i) assures fair tie-breaking when two or more processes choose same token number; and (ii) bounds the token numbers within the range [ − n , n ] . The algorithm is simple and uses one additional shared bit. ► New mutual exclusion algori...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information processing letters Ročník 110; číslo 23; s. 1055 - 1060
Hlavní autor: Aravind, Alex A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Amsterdam Elsevier B.V 15.11.2010
Elsevier
Elsevier Sequoia S.A
Témata:
Algorithmics. Computability. Computer arithmetics
Algorithms
Applied sciences
Bakeries
Bakery algorithm
Bounded timestamps
Computer science; control theory; systems
Concurrency
Distributed algorithm
Exact sciences and technology
Fairness
Information processing
Miscellaneous
Mutual exclusion
Optimization algorithms
Studies
Theoretical computing
Bounded timestamps
Bakery algorithm
Mutual exclusion
Concurrency
Fairness
Distributed algorithm
Computer theory
Information processing
Algorithm analysis
ISSN:0020-0190, 1872-6119
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This note proposes a new version of the bakery algorithm that: (i) assures fair tie-breaking when two or more processes choose same token number; and (ii) bounds the token numbers within the range [ − n , n ] . The algorithm is simple and uses one additional shared bit. ► New mutual exclusion algorithm. ► Fair mutual exclusion algorithm. ► Improved bakery algorithm. ► Bakery algorithms with bounded tokens.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0020-0190
1872-6119
DOI:10.1016/j.ipl.2010.09.004