An improved algorithm for decentralized extrema-finding in circular configurations of processes-Reference-Cited by-同舟云学术

An improved algorithm for decentralized extrema-finding in circular configurations of processes

Published:1979-05 Issue:5 Volume:22 Page:281-283
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Chang Ernest¹,Roberts Rosemary²

Affiliation:

1. Univ. of Toronto, Toronto, Ont., Canada

2. Univ. of Waterloo, Ontario, Canada

Abstract

This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists and the number of processes is not known a priori. This decentralized algorithm uses a technique of selective message extinction in order to achieve an average number of message passes of order ( n log n ) rather than O ( n 2 ).

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/359104.359108

Reference1 articles.

Cited by 205 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Brief Announcement: Content-Oblivious Leader Election on Rings;Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing;2024-06-17

2. An Infinite Needle in a Finite Haystack: Finding Infinite Counter-Models in Deductive Verification;Proceedings of the ACM on Programming Languages;2024-01-05

3. Regular Abstractions for Array Systems;Proceedings of the ACM on Programming Languages;2024-01-05

4. Message Chains for Distributed System Verification;Proceedings of the ACM on Programming Languages;2023-10-16

5. Towards Building Verifiable CPS using Lingua Franca;ACM Transactions on Embedded Computing Systems;2023-09-09