Proactive Leader Election in Asynchronous Shared Memory Systems

DOI10.1007/11901914_29MaRDI QIDQ3522922zbMATH OpenOpenAlexFDO

Authors

Publication date 4 September 2008

Published in Automated Technology for Verification and Analysis (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Network protocols (68M12) Distributed systems (68M14)

Recommendations

• Leader election in asynchronous distributed systems
• Optimal Time–Space Tradeoff for Shared Memory Leader Election
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• scientific article; zbMATH DE number 88976
• scientific article; zbMATH DE number 6313182
• scientific article; zbMATH DE number 7774255
• scientific article; zbMATH DE number 7774278
• scientific article; zbMATH DE number 2081106
• Stabilizing leader election in partial synchronous systems with crash failures
• A distributed leader election algorithm in crash-recovery and omissive systems

Cited in

(2)

• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• Light-weight leases for storage-centric coordination

Describes a project that uses

Uses Software

• Isabelle/HOL
• DiskPaxos

This page was built for publication: Proactive Leader Election in Asynchronous Shared Memory Systems

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