A Hybrid Distributed Mutual Exclusion Algorithm

Abstract

The problem of mutual exclusion has to be solved to prevent race condition and, as a result, prevent the possibility of a program producing an incorrect result. Providing deadlock-free distributed mutual exclusion algorithms is often difficult and it involves passing many messages. The two major types of these algorithms are token-based and permission-based algorithms. In this research, we propose a hybrid distributed mutual exclusion algorithm. By Hybrid, we mean that the algorithm uses both token-based and permission-based techniques. The best case and worst case number of messages passed for every critical region entry and exit is calculated, which are better than many other algorithms.

A hybrid token-based distributed mutual exclusion algorithm using wraparound two-dimensional array logical topology

“…A unique non-zero identification number is assigned to each process. Every process can send messages directly to all other processes using their identification numbers, which are considered as their addresses (complete communication graph similar to [2,6,10,11,14,16]). …”

A distributed token-based scheme to allocate critical resources

“…A unique non zero identification number is assigned to each process. Every process can send messages directly to all other processes using their identification numbers which are considered as their addresses (complete communication graph similar to [1,4,[9][10][11][12]15]). The logical structure of the interconnecting network is a wraparound two-dimensional array and the algorithm does not entail any specific physical interconnection topology.…”

Ancestral Dynamic Voting Algorithm for Mutual Exclusion in Partitioned Distributed Systems

“…However, the results of these algorithms have not been taken into account for environments with high probability of failure. The term "hybrid voting" differs from "hybrid mutual exclusion" (as used in [37,38]) which has the idea of both token-based and permission-based algorithms.…”

“…Studies in [37,38] introduce two forms of hybrid mutual exclusion algorithms as a combination of token-based and permission-based algorithms. The study in [37] uses Maekawa's quorums [24] for every site in the distributed system.…”

“…The study in [37] uses Maekawa's quorums [24] for every site in the distributed system. In the first phase, a site broadcasts messages to its quorum asking for its permission.…”