A self-stabilizing distributed algorithm for resolving conflicts

Authors:
Brahim Hamid;Mohamed Mosbah;Akka Zemmari
Affiliations:
LaBRI, University of Bordeaux-1, Talence, France;LaBRI, University of Bordeaux-1, Talence, France;LaBRI, University of Bordeaux-1, Talence, France
Venue:
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
Year:
2007

Citing 11
Cited 0

The drinking philosophers problem

ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
Probabilistic self-stabilization

Information Processing Letters
Graph relabelling systems and distributed algorithms

Handbook of graph grammars and computing by graph transformation
A new solution of Dijkstra's concurrent programming problem

Communications of the ACM
Self-stabilizing systems in spite of distributed control

Communications of the ACM
Randomized local elections

Information Processing Letters
A priority dynamics for generalized drinking philosophers

Information Processing Letters
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Randomized Dining Philosophers without Fairness Assumption

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
An Automatic Approach to Self-Stabilization

SNPD-SAWN '05 Proceedings of the Sixth International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing and First ACIS International Workshop on Self-Assembling Wireless Networks
A modular drinking philosophers algorithm

Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this work, we investigate the problem of resolving conflicts in a distributed environment using only local knowledge. The contribution of this paper is twofold. First, we present a self-stabilizing algorithm to deal with this problem. Self-stabilizing algorithms protect against transient failures. The second result gives a particular implementation and analysis based on probabilistic procedures. Thus, the stabilization time is computed in terms of computation steps, then approximated according to the needed synchronizations.