Applied combinatorics
Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.
ACM Transactions on Programming Languages and Systems (TOPLAS)
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Efficient decentralized consensus protocols
IEEE Transactions on Software Engineering
Derivation of a distributed algorithm for finding paths in directed networks
Science of Computer Programming
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
Synchronization in Distributed Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
An optimal algorithm for mutual exclusion in computer networks
Communications of the ACM
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
| Hi-index | 0.00 |
A distributed algorithm for achieving mutual exclusion in a point-to-point network with lossy communication links is presented. A communication link is said to be lossy if it loses messages at will. The algorithm tolerates any number of lossy communication links, as long as the link failures do not partition the communication network. The message network is completely asynchronous and, hence, link failures are not detectable. In a network with n nodes and e links, the algorithm requires no more than 2e(2√n + 1) message transmissions per mutual exclusion request.