Token-based approach in distributed mutual exclusion algorithms: a review and direction to future research
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 …
avoid inconsistency in data, mutual exclusion ensures that no two processes running on …
[LIVRE][B] Algorithms and theory of computation handbook, volume 2: special topics and techniques
MJ Atallah, M Blanton - 2009 - books.google.com
This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …
topics, techniques, and applications. Along with updating and revising many of the existing …
[LIVRE][B] Self-stabilizing vertex coloring of arbitrary graphs
M Gradinariu, S Tixeuil - 2000 - Citeseer
A self-stabilizing algorithm, regardless of the initial system state, converges in nite time to a
set of states that satisfy a legitimacy predicate without the need for explicit exception handler …
set of states that satisfy a legitimacy predicate without the need for explicit exception handler …
[PDF][PDF] Memory space requirements for self-stabilizing leader election protocols
J Beauquier, M Gradinariu, C Johnen - Proceedings of the eighteenth …, 1999 - dl.acm.org
We study the memory requirements of self-stabilizing leader election (SSLE) protocols. We
are mainly interested in two types of systems: anonymous systems and id-based systems …
are mainly interested in two types of systems: anonymous systems and id-based systems …
The triumph and tribulation of system stabilization
MG Gouda - International Workshop on Distributed Algorithms, 1995 - Springer
We give a concise outline of the theory of system stabilization. Our primary objective is to
demonstrate the richness, depth, and ultimately the utility of this beautiful theory. Our …
demonstrate the richness, depth, and ultimately the utility of this beautiful theory. Our …
Distance-k knowledge in self-stabilizing algorithms
Many graph problems seem to require knowledge that extends beyond the immediate
neighbors of a node. The usual self-stabilizing model only allows for nodes to make …
neighbors of a node. The usual self-stabilizing model only allows for nodes to make …
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
J Beauquier, M Gradinariu, C Johnen - Distributed Computing, 2007 - Springer
We present a randomized self-stabilizing leader election protocol and a randomized self-
stabilizing token circulation protocol under an arbitrary scheduler on anonymous and …
stabilizing token circulation protocol under an arbitrary scheduler on anonymous and …
Uniform and self-stabilizing token rings allowing unfair daemon
A distributed system consists of a set of processes and a set of communication links, each
connecting a pair of processes. A distributed system is said to be self-stabilizing if it …
connecting a pair of processes. A distributed system is said to be self-stabilizing if it …
Uniform and self-stabilizing fair mutual exclusion on unidirectional rings under unfair distributed daemon
This paper presents a uniform randomized self-stabilizing mutual exclusion algorithm for an
anonymous unidirectional ring of any size n, running under an unfair distributed scheduler …
anonymous unidirectional ring of any size n, running under an unfair distributed scheduler …
Self-stabilizing mutual exclusion using unfair distributed scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges infinite time to a
set of states that satisfy a legitimacy predicate without the need for explicit exception handler …
set of states that satisfy a legitimacy predicate without the need for explicit exception handler …