Light-weight leases for storage-centric coordination

DOI10.1007/S10766-006-0008-ZzbMath1103.68390OpenAlexW2127172962MaRDI QIDQ853758

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Bounds on shared memory for mutual exclusion
• Contention-free complexity of shared memory algorithms
• Analysis of timing-based mutual exclusion with random times
• Fault-tolerant wait-free shared objects
• Time-Adaptive Algorithms for Synchronization
• Sharing memory robustly in message-passing systems
• Unreliable failure detectors for reliable distributed systems
• Active disk paxos with infinitely many processes
• Distributed Computing

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