An improved algorithm for decentralized extrema-finding in circular configurations of processes
From MaRDI portal
Publication:4176960
DOI10.1145/359104.359108zbMath0394.68023OpenAlexW1994026499MaRDI QIDQ4176960
Ernest J. H. Chang, Rosemary Roberts
Publication date: 1979
Published in: Communications of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/359104.359108
Related Items (30)
Distributed algorithm for extrema-finding in circular configuration of processors ⋮ Sound verification procedures for temporal properties of infinite-state systems ⋮ Some lower bound results for decentralized extrema-finding in rings of processors ⋮ An improved election algorithm in chordal ring networks ⋮ A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors ⋮ Cost distribution of the Chang-Roberts leader election algorithm and related problems ⋮ Drags: a compositional algebraic framework for graph rewriting ⋮ Assertion-Based Proof Checking of Chang-Roberts Leader Election in PVS ⋮ Why3-do: the way of harmonious distributed system proofs ⋮ Leader election in well-connected graphs ⋮ Asynchronous distributed termination-parallel and symmetric solutions with echo algorithms ⋮ The communication complexity for decentralized evaluation of functions ⋮ Bit-optimal election in synchronous rings ⋮ Symmetry breaking in distributed networks ⋮ Design and analysis of dynamic leader election protocols in broadcast networks ⋮ Communication and time complexity of a distributed election protocol ⋮ A knowledge-based analysis of global function computation ⋮ An Abstraction Technique for Parameterized Model Checking of Leader Election Protocols: Application to FTSP ⋮ Bounded Quantifier Instantiation for Checking Inductive Invariants ⋮ A simple, efficient algorithm for maximum finding on rings ⋮ Anonymous wireless rings ⋮ RANDOMIZED SELF-STABILIZING LEADER ELECTION IN PREFERENCE-BASED ANONYMOUS TREES ⋮ Distributed election in a circle without a global sense of orientation ⋮ On the message complexity of distributed problems ⋮ Snap-stabilizing tasks in anonymous networks ⋮ On the Expressive Power of Polyadic Synchronisation in π-calculus ⋮ Pardinus: a temporal relational model finder ⋮ On the complexity of computation in the presence of link failures: The case of a ring ⋮ New lower bound techniques for distributed leader finding and other problems on rings of processors ⋮ Electing a leader in a ring with link failures
This page was built for publication: An improved algorithm for decentralized extrema-finding in circular configurations of processes
