The Community for Technology Leaders
Green Image
<p>In a distributed context, mutual exclusion algorithms can be divided into two familiesaccording to their underlying algorithmic principles: those that are permission-based andthose that are token-based. Within the latter family, a lot of algorithms use a rooted treestructure to move the requests and the unique token. This paper presents a very generalinformation structure (and the associated generic algorithm) for token- and tree-basedmutual exclusion algorithms. This general structure not only covers, as particular cases,several known algorithms, but also allows for the design of new ones that are well suitedfor various topology requirements.</p>
Index Termsdistributed algorithms; tree data structures; topology; token-based distributed mutualexclusion algorithms; tree-based distributed mutual exclusion algorithms;permission-based mutual exclusion algorithms; rooted tree structure; informationstructure; generic algorithm; topology requirements; distributed algorithms
M. Raynal, A. Mostefaouni, J.M. Hélary, "A General Scheme for Token- and Tree-Based Distributed Mutual Exclusion Algorithms", IEEE Transactions on Parallel & Distributed Systems, vol. 5, no. , pp. 1185-1196, November 1994, doi:10.1109/71.329670
91 ms
(Ver 3.3 (11022016))