Proactive Leader Election in Asynchronous Shared Memory Systems

DOI10.1007/11901914_29zbMATH Open1161.68320OpenAlexW1539785761MaRDI QIDQ3522922

Author name not available (Why is that?)

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

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

Uses Software

• DiskPaxos
• Title not available (Why is that?)

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• A distributed leader election algorithm in crash-recovery and omissive systems 👍 👎
• Stabilizing leader election in partial synchronous systems with crash failures 👍 👎
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems 👍 👎
• Optimal Time–Space Tradeoff for Shared Memory Leader Election 👍 👎
• Leader election in asynchronous distributed systems 👍 👎

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)