Self-stabilizing Philosophers with Generic Conflicts

Praveen Danturi Sébastien Tixeuil 1
1 NPA - Networks and Performance Analysis
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : We generalize the classic dining philosophers problem to separate the conflict and communication neighbors of each process. Communication neighbors may directly exchange information while conflict neighbors compete for the access to the exclusive critical section of code. This generalization is motivated by a number of practical problems in distributed systems including problems in wireless sensor networks. We present a self-stabilizing deterministic algorithm—GDP that solves this generalized problem. Our algorithm is terminating. We formally prove GDP correct and evaluate its performance. We extend the algorithm to handle a similarly generalized drinking philosophers and the committee coordination problem. We describe how GDP can be implemented in wireless sensor networks and demonstrate that this implementation does not jeopardize its correctness or termination properties.
Type de document :
Article dans une revue
ACM Transactions on Autonomous and Adaptive Systems, Association for Computing Machinery (ACM), 2009, 4 (1), pp.7. 〈10.1145/1462187.1462194〉
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01151770
Contributeur : Lip6 Publications <>
Soumis le : mercredi 13 mai 2015 - 15:40:21
Dernière modification le : mercredi 21 mars 2018 - 18:57:58

Identifiants

Collections

Citation

Praveen Danturi, Sébastien Tixeuil. Self-stabilizing Philosophers with Generic Conflicts. ACM Transactions on Autonomous and Adaptive Systems, Association for Computing Machinery (ACM), 2009, 4 (1), pp.7. 〈10.1145/1462187.1462194〉. 〈hal-01151770〉

Partager

Métriques

Consultations de la notice

80