New upperbounds for decentralized extrema-finding in a ring of processors
HL Bodlaender, J van Leeuwen?- Annual Symposium on Theoretical?…, 1986 - Springer
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.
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.
以上显示的是最相近的搜索结果。 查看全部搜索结果