A tree-based algorithm for distributed mutual exclusion

Abstract

We present an algorithm for distributed mutual exclusion in a computer network of N nodes that communicate by messages rather than shared memory. The algorithm uses a spanning tree of the computer network, and the number of messages exchanged per critical section depends on the topology of this tree. However, typically the number of messages exchanged is O (log N ) under light demand, and reduces to approximately four messages under saturated demand. Each node holds information only about its immediate neighbors in the spanning tree rather than information about all nodes, and failed nodes can recover necessary information from their neighbors. The algorithm does not require sequence numbers as it operates correctly despite message overtaking.

A Fault-Tolerant Algorithm For Distributed Resource Allocation

“…La distribución de componentes disminuye la disponibilidad del conjunto, salvo que el algoritmo contemple mecanismos de tolerancia a fallos [6]. El problema del uso de un recurso compartido puede ser visto como equivalente a un clásico problema de exclusión mutua distribuida [7,8,9] donde la sección crítica comienza cuando un miembro del grupo adquiere el recurso y finaliza cuando éste lo libera. Existe una diferencia entre ambos y es que los algoritmos de exclusión mutua requieren la especificación de la identidad del recurso a ser asignado, mientras que en la asignación distribuida cualquier instancia de un recurso puede asignarse sin especificar su identidad.…”

Easily Rendering Token-Ring Algorithms of Distributed and Parallel Applications Fault Tolerant

“…For instance, in a tree-based algorithm (e.g. Raymond's mutual exclusion algorithm [13]) the token does not always travel between k distinct successive nodes of the logical tree;…”

Diameter Constrained Fuzzy Minimum Spanning Tree Problem

“…7 Gouvieta and Magnanti 8 have modeled the problem as a network design to set up communication between every pair of vertices, meeting or surpassing a given quality requirement. This problem has also been applied to data compression by Bookstien and Klien, 9 and distributed mutual exclusion in parallel computing by Raymond, 10 and Deo and Abdalla. 11 Different formulation of the DCMST has been found in the literature.…”