Distributed Mutual Exclusion Algorithms for Intersection Traffic Problems
نویسندگان
چکیده
منابع مشابه
Empirical Evaluation of Distributed Mutual Exclusion Algorithms
In this paper, we evaluated various distributed mutual exclusion algorithms on the IBM SP2 machine and the Intel iPSC/860 system. The empirical results are compared in terms of such criteria as the number of message exchanges and the response time. Our results indicate that the Star algorithm [2] achieves the shortest response time in most cases among all the algorithms on a small to medium siz...
متن کاملDistributed mutual exclusion algorithms for grid applications: A hierarchical approach
The majority of current distributed mutual exclusion algorithms are not suited for parallel or distributed applications on a Grid as they do not consider the heterogeneity of latency on Grids. We propose two distributed mutual exclusion algorithms, based on Naimi-Trehel’s token-based algorithm, which take into account latency gaps, especially those between local and remote clusters of machines....
متن کاملCluster Based Distributed Mutual Exclusion Algorithms for Mobile Networks
We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms in mobile networks. The mobile network is partitioned into a number of clusters periodically using a graph partitioning algorithm called Fixed Centered Partitioning first. Each cluster is represented by a coordinator node on the ring which implements various distributed mutual exclusion al...
متن کاملTwo New Quorum Based Algorithms for Distributed Mutual Exclusion
Two novel suboptimal algorithms for mutual exclusion in distributed systems are presented. One is based on the modi cation of Maekawa's grid based quorum scheme. The size of quorums is approximately p 2 p N where N is the number of sites in a network, as compared to 2 p N of the original method. The method is simple and geometrically evident. The second one is based on the idea of di erence set...
متن کاملDesign of Mutual Exclusion Algorithms for Real-Time Distributed Systems
In the problem of mutual exclusion concurrent access to a shared resource or the Critical Section CS must be synchronized such that at any time only one process can access the CS In a real time distributed system and a system which uses priorities for scheduling events for requesting the CS should be ordered on the basis of priorities of the processes as rst proposed in Goscinski s algorithm ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.3012573