Some lower bound results for decentralized extrema-finding in rings of processors

DOI10.1016/0022-0000(91)90041-3zbMath0719.68029OpenAlexW1988442674WikidataQ59568047 ScholiaQ59568047MaRDI QIDQ2640343

Hans L. Bodlaender

Publication date: 1991

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://dspace.library.uu.nl/handle/1874/16285

zbMATH Keywords

lower boundelection problemrings of processors

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Related Items (1)

A simple, efficient algorithm for maximum finding on rings

Cites Work

• Unnamed Item
• Unnamed Item
• New lower bound techniques for distributed leader finding and other problems on rings of processors
• A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors
• Average number of messages for distributed leader-fitting in rings of processors
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Electing a leader in a synchronous ring
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• An improved algorithm for decentralized extrema-finding in circular configurations of processes

This page was built for publication: Some lower bound results for decentralized extrema-finding in rings of processors