Efficient elections in chordal ring networks

DOI10.1007/BF01553900zbMath0685.68039OpenAlexW2052251742WikidataQ106200561 ScholiaQ106200561MaRDI QIDQ1262125

Shmuel Zaks, Jan van Leeuwen, Hagit Attiya, Nicola Santoro

Publication date: 1989

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01553900

zbMATH Keywords

communication complexitydistributed algorithmchordal ringelectionleaderdistributed network

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25) Theory of software (68N99)

Related Items

A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings, On the impact of sense of direction on message complexity, DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS, Minimal sense of direction in regular networks, An improved election algorithm in chordal ring networks, Symmetry properties of chordal rings of degree 3, Leader election in well-connected graphs, Design and analysis of dynamic leader election protocols in broadcast networks, Efficient leader election using sense of direction, Towards optimal distributed election on chordal rings, Random walks, bisections and gossiping in circulant graphs, The Magnus-Derek game, Optimal irreversible dynamos in chordal rings, TOPOLOGICAL CONSTRAINTS FOR SENSE OF DIRECTION, Sense of direction in distributed computing

Cites Work

• Lower Bounds for Distributed Maximum-Finding Algorithms
• Electing a leader in a synchronous ring
• 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
• A Combinatorial Problem Related to Multimodule Memory Organizations
• Unnamed Item