A simple, efficient algorithm for maximum finding on rings

DOI10.1016/0020-0190(96)00069-5MaRDI QIDQ671266zbMATH OpenOpenAlexWikidataFDO

Authors Lisa Higham, Teresa Przytycka

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(96)00069-5

zbMATH Keywords

Asynchronous ringsDistributed algorithmsMaximum findingMessage complexity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed algorithms (68W15)

Recommendations

• Some lower bound results for decentralized extrema-finding in rings of processors
• scientific article; zbMATH DE number 3978376
• Lower Bounds for Distributed Maximum-Finding Algorithms
• scientific article; zbMATH DE number 3850459
• Distributed algorithm for extrema-finding in circular configuration of processors

Cites work

• A simple, efficient algorithm for maximum finding on rings
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Decentralized extrema-finding in circular configurations of processors
• Lower Bounds for Distributed Maximum-Finding Algorithms
• Some lower bound results for decentralized extrema-finding in rings of processors

Cited in

(12)

• A fast maximum finding algorithm on broadcast communication
• Finding the extrema of a distributed multiset
• Some lower bound results for decentralized extrema-finding in rings of processors
• scientific article; zbMATH DE number 3850459 (Why is no real title available?)
• scientific article; zbMATH DE number 3978376 (Why is no real title available?)
• Asymptotically Optimal Election on Weighted Rings
• Asymptotically optimal election on weighted rings
• A unified approach for gathering and exclusive searching on rings under weak assumptions
• Maximum Finding in the Symmetric Radio Networks with Collision Detection
• A fast maximum finding algorithm on broadcast communication
• A simple, efficient algorithm for maximum finding on rings
• Cost distribution of the Chang-Roberts leader election algorithm and related problems

This page was built for publication: A simple, efficient algorithm for maximum finding on rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q671266)