Paper Info
Title
Synchronization Algorithms On Oriented Chains
Abstract
We present a space- and time-optimal self-stabilizing algorithm, SSDS, for a given synchronization problem on asynchronous oriented chains. SSDS is uniform and works under the unfair distributed daemon. From SSDS we derive solutions for the local mutual exclusion and distributed sorting. Algorithm SSDS can also be used to obtain optimal space solutions for other problems such as broadcasting, leader election, and mutual exclusion.
Year
Venue
Field
2008
SCIENTIFIC ANNALS OF COMPUTER SCIENCE
Computer science,Parallel computing,Synchronization algorithm
DocType
Volume
ISSN
Journal
18
1843-8121
Citations 
PageRank 
References 
0
0.34
0
Authors
3
Name
Order
Citations
PageRank
Doina Bein110321.64
Ajoy Kumar Datta231740.76
Lawrence L. Larmore3859109.15