The Impact of Clustering on Token-Based Mutual Exclusion Algorithms
نویسندگان
چکیده
We present in this article a theoretical study and performance results about the impact of the Grid architecture on token-based mutual exclusion algorithms. To this end, both the original token-based Naimi-Tréhel’s algorithm and a hierarchical approach, suitable to cope with the intrinsic heterogeneity of communication latencies of Grid environments, are studied and evaluated.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملComparative Study of Mutual Exclusion Algorithms in Distributed Systems
Mutual Exclusion is an important phenomenon in distributed systems. In this paper, we analyze and compare various mutual exclusion algorithms in distributed systems. In permission based mutual exclusion process waits for permission from other processes to enter into a critical section. In token based mutual exclusion, a special message called token is passed over the system and process holding ...
متن کاملExploiting Opportunistic Overhearing to Improve Performance of Mutual Exclusion in Wireless Ad Hoc Networks
We design two mutual exclusion algorithms for wireless networks. Our mutual exclusion algorithms are distributed token based algorithms which exploit the opportunistic message overhearing in wireless networks. One of the algorithms is based on overhearing of token transmission. In the other algorithm, overhearing of both token and request messages is exploited. The design goal is to decrease th...
متن کاملA Fast Token-Chasing Mutual Exclusion Algorithm in Arbitrary Network Topologies
Since this problem was first studied by Lann [8] and Lamport [7], it has been extensively investigated for about 20 years. Many algorithms have been proposed to reduce the number of messages, to minimize the access time to the critical region (CR), or to enhance reliability (e.g., [5, 12, 16, 22, 26, 27]). In general, mutual exclusion algorithms are divided into two classes: the permission-base...
متن کاملA token based distributed mutual exclusion algorithm based on quorum agreements
Coteries may be used to construct permission based distributed mutual exclusion algorithms. One such algorithm is Maekawa's p N algorithm in which the co-terie is constructed based on nite projective planes. This paper presents a token based mutual exclusion algorithm which uses data structures similar to coter-ies, called quorum agreements. The performance of the algorithm depends upon the quo...
متن کامل