A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Consensus in the presence of partial synchrony
Journal of the ACM (JACM)
Leases: an efficient fault-tolerant mechanism for distributed file cache consistency
SOSP '89 Proceedings of the twelfth ACM symposium on Operating systems principles
Bounds on shared memory for mutual exclusion
Information and Computation
An old-fashioned recipe for real time
ACM Transactions on Programming Languages and Systems (TOPLAS)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Contention-free complexity of shared memory algorithms
Information and Computation
Time-Adaptive Algorithms for Synchronization
SIAM Journal on Computing
Fault-tolerant wait-free shared objects
Journal of the ACM (JACM)
Analysis of timing-based mutual exclusion with random times
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Distributed Algorithms
Active disk paxos with infinitely many processes
Proceedings of the twenty-first annual symposium on Principles of distributed computing
GPFS: A Shared-Disk File System for Large Computing Clusters
FAST '02 Proceedings of the Conference on File and Storage Technologies
Using Failure Detectors to Solve Consensus in Asynchronous Sharde-Memory Systems (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
How to Build a Highly Available System Using Consensus
WDAG '96 Proceedings of the 10th International Workshop on Distributed Algorithms
zFS " A Scalable Distributed File System Using Object Disks
MSS '03 Proceedings of the 20 th IEEE/11 th NASA Goddard Conference on Mass Storage Systems and Technologies (MSS'03)
Highly Concurrent Shared Storage
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Backoff Protocols for Distributed Mutual Exclusion and Ordering
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
WORDS '02 Proceedings of the The Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems (WORDS 2002)
Data management in a distributed file system for storage area networks
Data management in a distributed file system for storage area networks
The software architecture of a SAN storage control system
IBM Systems Journal
IBM Storage Tank-- A heterogeneous scalable SAN file system
IBM Systems Journal
Distributed Computing
Distributed Computing
Proactive leader election in asynchronous shared memory systems
ATVA'06 Proceedings of the 4th international conference on Automated Technology for Verification and Analysis
Hi-index | 0.00 |
Reaching agreement among processes sharing read/write memory is possible only in the presence of an eventual unique leader. A leader that fails must be recoverable, but on the other hand, a live and well-performing leader should never be decrowned. This paper presents the first leader algorithm in shared memory environments that guarantees an eventual leader following global stabilization time. The construction is built using light-weight lease and renew primitives. The implementation is simple, yet efficient. It is uniform, in the sense that the number of potentially contending processes for leadership is not a priori known.