Communication and time complexity of a distributed election protocol

DOI10.1007/BF01158793zbMath0736.68007OpenAlexW2045337627MaRDI QIDQ1176439

Alain Jean-Marie, François Baccelli

Publication date: 25 June 1992

Published in: Queueing Systems (Search for Journal in Brave)

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

zbMATH Keywords

distributed algorithmscommunication complexitycomplex analysis methodsvirtual ring

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Decentralized extrema-finding in circular configurations of processors
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• An improved algorithm for decentralized extrema-finding in circular configurations of processes