Paper Info
Title
New upperbounds for decentralized extrema-finding in a ring of processors
Abstract
We show that decentralized extrema-finding ("election") is more efficient in bidirectional rings than in unidirectional rings of processors, by exhibiting a (non-probabilistic) algorithm for distributed extrema-finding in bidirectional rings that requires fewer messages on the average than any such algorithm for unidirectional rings.
Year
DOI
Venue
1986
10.1007/3-540-16078-7_70
STACS
Keywords
Field
DocType
new upperbounds,decentralized extrema-finding,probabilistic algorithm
Randomized algorithm,Computer science,Random sequence,Maxima and minima,Theoretical computer science,Deterministic algorithm
Conference
Volume
ISSN
ISBN
210
0302-9743
3-540-16078-7
Citations 
PageRank 
References 
8
1.10
9
Authors
2
Name
Order
Citations
PageRank
Hans L. Bodlaender15699375.15
J. Van Leeuwen230855.29