The problem of mutual exclusion is a highly focused area in the distributed architecture. To
avoid inconsistency in data, mutual exclusion ensures that no two processes running on …

The problem of mutual exclusion in distributed systems has attracted considerable attention
over the last two decades. The mutual exclusion problem requires that, at a time, only one of …

Field Programmable Gate Arrays (FPGAs) are conventionally considered as' glue-logic'.
However, modern FPGAs are extremely competitive compared to state-of-the-art CPUs for …

This paper 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 …

Over the last decade distributed computing systems have attracted a great deal of attention.
This is due, in part, to the technological advances in the design of sophisticated software …

The distributed k-mutual-exclusion problem (k-mutex problem) is the problem of
guaranteeing that at most k processes at a time can enter a critical section at a time in a …

The concept of k-coterie is introduced and a distributed k-mutual exclusion algorithm is
proposed using it. A k-coterie is a natural extension of a coterie. The message complexity of …

Group mutual exclusion occurs naturally in situations where a resource can be shared by
processes of the same group, but not by processes of different groups. For example …

In computer science, mutual exclusion (MUTEX) refers to a way of making sure that if one
process is using shared modifiable data or resources then the other processes will be …

Quorum-based mutual exclusion algorithms are resilient to node and communication line
failures. Recently, some mutual exclusion algorithms successfully use logical structures to …