Light-weight leases for storage-centric coordination

DOI10.1007/S10766-006-0008-ZMaRDI QIDQ853758zbMATH OpenOpenAlexFDO

Authors Gregory Chockler, Dahlia Malkhi

Publication date 17 November 2006

Published in International Journal of Parallel Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10766-006-0008-z

zbMATH Keywords

consensusmutual exclusionfile systemsLeases

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• An \(O(1)\) RMRs leader election algorithm
• Coordination without prior agreement
• Proactive Leader Election in Asynchronous Shared Memory Systems
• scientific article; zbMATH DE number 2006647

Cites work

• scientific article; zbMATH DE number 1696684 (Why is no real title available?)
• scientific article; zbMATH DE number 996442 (Why is no real title available?)
• Active disk Paxos with infinitely many processes
• Analysis of timing-based mutual exclusion with random times
• Bounds on shared memory for mutual exclusion
• Contention-free complexity of shared memory algorithms
• Fault-tolerant wait-free shared objects
• Multi-writer consistency conditions for shared memory objects
• Sharing memory robustly in message-passing systems
• Time-Adaptive Algorithms for Synchronization
• Unreliable failure detectors for reliable distributed systems

This page was built for publication: Light-weight leases for storage-centric coordination

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