A Distributed Algorithm for Mutual Exclusion in an Arbitrary Network
نویسندگان
چکیده
منابع مشابه
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...
متن کاملA Fair Distributed Mutual Exclusion Algorithm
ÐThis paper presents a fair decentralized mutual exclusion algorithm for distributed systems in which processes communicate by asynchronous message passing. The algorithm requires between N ÿ 1 and 2 N ÿ 1 messages per critical section access, where N is the number of processes in the system. The exact message complexity can be expressed as a deterministic function of concurrency in the comput...
متن کاملA Distributed K-Mutual Exclusion Algorithm
This report presents a token-based K-mutual exclusion algorithm. The algorithm uses K tokens and a dynamic forest structure for each token. This structure is used to forward token requests. The algorithm is designed to minimize the number of messages and also the delay in entering the critical section, at low as well as high loads. The report presents simulation results for the proposed algorit...
متن کاملAn Eecient Token-based Algorithm for Distributed Mutual Exclusion
In this paper, we present an eecient token-based algorithm for distributed mutual exclusion. The algorithm uses a distributed queue, which is not necessarily FIFO, to enqueue the request messages of the nodes for entry into the critical section (CS). These request messages are timestamped using roughly synchronized clocks. On the average, the algorithm requires 2 to 3 number of messages per cri...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1988
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/31.4.289