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
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
Logical Time in Distributed Computing Systems
Computer - Distributed computing systems: separate resources acting as one
A simulation study on distributed mutual exclusion
Journal of Parallel and Distributed Computing
A log (N) distributed mutual exclusion algorithm based on path reversal
Journal of Parallel and Distributed Computing
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A performance comparison of fast distributed mutual exclusion algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Prioritized Token-Based Mutual Exclusion for Distributed Systems
WPDRTS '97 Proceedings of the 1997 Joint Workshop on Parallel and Distributed Real-Time Systems (WPDRTS / OORTS '97)
A brief overview of scalable distributed concurrency services for hierarchical locking
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
The Prioritized and Distributed Synchronization in Distributed Groups
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Fault-Tolerance for Token-based Synchronization Protocols
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Token-Based Read/Write-Locks for Distributed Mutual Exclusion
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Scalable Distributed Concurrency Services for Hierarchical Locking
ICDCS '03 Proceedings of the 23rd International Conference on Distributed Computing Systems
A protocol for scalable distributed concurrency services
OOPSLA '02 Companion of the 17th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Scalable hierarchical locking for distributed systems
Journal of Parallel and Distributed Computing - Special issue on middleware
Distributed mutual exclusion algorithms for grid applications: A hierarchical approach
Journal of Parallel and Distributed Computing
Verification of a Hierarchical Generic Mutual Exclusion Algorithm
FORTE '08 Proceedings of the 28th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
The Impact of Clustering on Token-Based Mutual Exclusion Algorithms
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Pleiad: a cross-environment middleware providing efficient multithreading on clusters
Proceedings of the 6th ACM conference on Computing frontiers
Building effective mutual exclusion services for grids
The Journal of Supercomputing
A Token-Based Mutual Exclusion Approach to Improve Collaboration in Distributed Environments
ICCCI '09 Proceedings of the 1st International Conference on Computational Collective Intelligence. Semantic Web, Social Networks and Multiagent Systems
Fault tolerant and robust mutual exclusion protocol for synchronous distributed systems
ISCIS'05 Proceedings of the 20th international conference on Computer and Information Sciences
Modified raymond's algorithm for priority (MRA-P) based mutual exclusion in distributed systems
ICDCIT'06 Proceedings of the Third international conference on Distributed Computing and Internet Technology
Service Level Agreement for Distributed Mutual Exclusion in Cloud Computing
CCGRID '12 Proceedings of the 2012 12th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012)
Hi-index | 0.00 |
A number of solutions have been proposed for the problem of mutual exclusion in distributed systems. Some of these approaches have since been extended to a prioritized environment suitable for real-time applications but impose a higher message passing overhead than our approach. We present a new protocol for prioritized mutual exclusion in a distributed environment. Our approach uses a token-based model working on a logical tree structure, which is dynamically modified. In addition, we utilize a set of local queues whose union would resemble a single global queue. Furthermore, our algorithm is designed for out-of order message delivery, handles messages asynchronously and supports multiple requests from one node for multi-threaded nodes. The prioritized algorithm has an average overhead of O(log(n)) messages per request for mutual exclusion with a worst-case overhead of O(n), where n represents the number of nodes in the system. Thus, our prioritized algorithm matches the message complexity of the best non-prioritized algorithms while previous prioritized algorithms have a higher message complexity, to our knowledge. Our concept of local queues can be incorporated into arbitrary token-based protocols with or without priority support to reduce the amount of messages. Performance results indicate that the additional functionality of our algorithm comes at the cost of 30% longer response times within our test environment for distributed execution when compared with an unprioritized algorithm. This result suggests that the algorithm should be used when strict priority ordering is required.