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...

Full description

Saved in:

Bibliographic Details
Published in:	Information processing letters Vol. 110; no. 23; pp. 1055 - 1060
Main Author:	Aravind, Alex A.
Format:	Journal Article
Language:	English
Published:	Amsterdam Elsevier B.V 15.11.2010 Elsevier Elsevier Sequoia S.A
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!