A Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
نویسندگان
چکیده
منابع مشابه
A Token-Based Fair Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a generalization of the mutual exclusion problem. In group mutual exclusion, a process requests a session before entering its critical section (CS). Processes requesting the same session are allowed to be in their CS simultaneously, however, processes requesting different sessions must execute their CS in mutually exclusive way. The paper presents a t...
متن کاملA Fault Tolerant Token-based Algorithm for Group Mutual Exclusion in Distributed Systems
The group mutual exclusion (GME) problem is a variant of the mutual exclusion problem. In the present paper a token-based group mutual exclusion algorithm, capable of handling transient faults, is proposed. The algorithm uses the concept of dynamic request sets. A time out mechanism is used to detect the token loss; also, a distributed scheme is used to regenerate the token. The worst case mess...
متن کامل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 Centralized Token-Based Algorithm for Distributed Mutual Exclusion
In this paper, we present a new algorithm for distributed mutual exclusion that combines the advantages of existing centralized and token-based algorithms: it takes only two messages to acquire the lock when it is not held by another process, and only one message to pass the lock from one process to another. At the same time, our algorithm generates signiicantly less message traac than non-cent...
متن کامل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...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2007
ISSN: 1549-3636
DOI: 10.3844/jcssp.2007.829.835