The information structure of distributed mutual exclusion algorithms

Abstract

The concept of an information structure is introduced as a unifying principle behind several of the numerous algorithms that have been proposed for the distributed mutual exclusion problem. This approach allows the development of a generalized mutual exclusion algorithm that accepts a particular information structure at initialization and realizes both known and new algorithms as special cases. Two simple performance metrics of a realized algorithm can be obtained directly from the information structure. A new failure recovery mechanism called local recovery, which requires no coordination between nodes and no additional messages beyond that needed for failure detection, is introduced.

A QoS Aware Self Adaptive General Scheme to Solve GME Problem

“…As far as the resource allocation problem is concerned, Sanders [9] a generalized algorithm based upon information structure for the permission-based mutual exclusion algorithms. The generalized algorithm may lead to different known and new algorithms.…”

A Novel Token based DME Algorithm in MANET

“…To achieve this, the knowledge of each node about the requesting nodes is passed through the token. Suzuki and Kazami [2] proposed an algorithm in which the queue of requesting nodes is piggybacked within the token and the queue is updated by a local queue of each visited node in an ascending node number. Raymond [3] proposed an algorithm, based on a logical tree on the network rooted by the token holder node.…”

A reliable optimization on distributed mutual exclusion algorithm

“…Sanders proposed a theory of data structures to design mutual exclusion algorithms. According to this theory, a data structure describes which process keeps information about which other process, and from which process a process must request information before entering the CS [3]. To compare the algorithms in detail, we can see other characteristics of mentioned algorithms in table 1.…”

“…However, the set S includes three sub set of clients' data (clients in three states: in-region, requesting and unrelated). As data structure, each coordinator has a queue to store requests of processes and a flag, which saves the in-region process name 3 .…”