Operation systems: advanced concepts
Operation systems: advanced concepts
The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A Heuristically-Aided Algorithm for Mutual Exclusion in Distributed Systems
IEEE Transactions on Computers
An efficient and fault-tolerant solution for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
Distributed operating systems
Time bounds for mutual exclusion and related problems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A distributed mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
A N algorithm for mutual exclusion in decentralized systems
ACM Transactions on Computer Systems (TOCS)
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A fast token-chasing mutual exclusion algorithm in arbitrary network topologies
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
Operating systems (2nd ed.): design and implementation
Operating systems (2nd ed.): design and implementation
A Fair Distributed Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
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 Dynamic Information-Structure Mutual Exclusion Algorithm for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
Distributed Systems: Principles and Paradigms (2nd Edition)
Distributed Systems: Principles and Paradigms (2nd Edition)
Hi-index | 0.00 |
In a distributed system, process synchronization is an important agenda. One of the major duties for process synchronization is mutual exclusion. This paper presents a new centralized fault tolerant distributed mutual exclusion algorithm based on Agrawala and El-Abbadi's algorithm. In new algorithm, once coordinator crashes, algorithm can recover lost data and return the coordinator in earlier situation. Thus fault tolerance will ascend and centralize algorithm's "single point of failure" will be omitted. So based algorithm will be more reliable. The only trade off is consuming some inappreciable time in case of coordinator's crash.