From an intermittent rotating star to a leader

DOI10.1145/1281100.1281152MaRDI QIDQ5401436zbMATH OpenOpenAlexFDO

Authors

Publication date 13 March 2014

Published in Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1281100.1281152

zbMATH Keywords

fault-toleranceasynchronyeventual leader

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15) Distributed systems (68M14)

Recommendations

• Election in asynchronous complete networks with intermittent link failures
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• scientific article; zbMATH DE number 2006647
• Communication-efficient leader election and consensus with limited link synchrony
• Leader election in the presence of n-1 initial failures

Cited in

(2)

• On implementing omega in systems with weak reliability and synchrony assumptions
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems

This page was built for publication: From an intermittent rotating star to a leader

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