Highly-fair bakery algorithm using symmetric tokens
Uložené v:
| Názov: | Highly-fair bakery algorithm using symmetric tokens |
|---|---|
| Autori: | Alex Aravind |
| Zdroj: | Information Processing Letters. 110:1055-1060 |
| Informácie o vydavateľovi: | Elsevier BV, 2010. |
| Rok vydania: | 2010 |
| Predmety: | 0202 electrical engineering, electronic engineering, information engineering, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences |
| Popis: | 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. |
| Druh dokumentu: | Article |
| Jazyk: | English |
| ISSN: | 0020-0190 |
| DOI: | 10.1016/j.ipl.2010.09.004 |
| Prístupová URL adresa: | https://dblp.uni-trier.de/db/journals/ipl/ipl110.html#Aravind10 https://dl.acm.org/doi/10.1016/j.ipl.2010.09.004 https://www.sciencedirect.com/science/article/abs/pii/S0020019010002796 |
| Rights: | Elsevier TDM |
| Prístupové číslo: | edsair.doi.dedup.....b7da27d08f6b66ea14b2a61f817a63bb |
| Databáza: | OpenAIRE |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | 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. |
|---|---|
| ISSN: | 00200190 |
| DOI: | 10.1016/j.ipl.2010.09.004 |