Light-weight leases for storage-centric coordination
From MaRDI portal
Publication:853758
DOI10.1007/S10766-006-0008-ZzbMATH Open1103.68390OpenAlexW2127172962MaRDI QIDQ853758FDOQ853758
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
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
- Title not available (Why is that?)
- Unreliable failure detectors for reliable distributed systems
- Bounds on shared memory for mutual exclusion
- Contention-free complexity of shared memory algorithms
- Sharing memory robustly in message-passing systems
- Active disk Paxos with infinitely many processes
- Title not available (Why is that?)
- Multi-writer consistency conditions for shared memory objects
- Fault-tolerant wait-free shared objects
- Analysis of timing-based mutual exclusion with random times
- Time-Adaptive Algorithms for Synchronization
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)
