The information structure of distributed mutual exclusion algorithms
ACM Transactions on Computer Systems (TOCS)
A distributed algorithm for mutual exclusion in an arbitrary network
The Computer Journal
A tree-based algorithm for distributed mutual exclusion
ACM Transactions on Computer Systems (TOCS)
Memory coherence in shared virtual memory systems
ACM Transactions on Computer Systems (TOCS)
Two algorithms for mutual exclusion in real-time distributed computer systems
Journal of Parallel and Distributed Computing
Modern operating systems
A taxonomy of distributed mutual exclusion
Journal of Parallel and Distributed Computing
A token based k-resilient mutual exclusion algorithm for distributed systems
Information Processing Letters
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 log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
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
Advanced Concepts in Operating Systems
Advanced Concepts in Operating Systems
Priority Inheritance and Ceilings for Distributed Mutual Exclusion
RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
A Software Architecture for Shared Resource Management in Mobile Ad Hoc Networks
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
| Hi-index | 0.00 |
A new distributed mutual exclusion algorithm is proposed in this paper. This algorithm is a centralized token-based algorithm. An improvement of the synchronization delay for centralized mutual exclusion in distributed systems is achieved by modifying the standard algorithm for centralized mutual exclusion by a forwarding mechanism that allows tokens to be passed directly between requesters instead of always going through a centralized coordinator. Performance metrics such as synchronization delay, messages per request, and response time under light and heavy loads, are presented. Analysis shows that this algorithm outperforms existing algorithms and its performance is close to the lower bounds of these metrics.