Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging)

Michel Hurfin 1 Michel Raynal 1
1 ADP - Distributed Algorithms and Protocols
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, INRIA Rennes
Abstract : The problem tackled in this paper originates from the debugging of distributed applications. Execution of such an application can be modeled as a partially ordered set of process states. The debugging of control flows (sequences of process states) of these executions is based on the satisfaction of predicates by process states. A process state that satisfies a predicate inherits its label. It follows that, in this context, a distributed execution is a labeled directed acyclic graph (dag for short). Debug or determine if control flows of a distributed execution satisfies some property amounts to test if the labeled dag includes some pattern defined on predicate labels. This paper first introduces a general pattern (called diamond necklace) which includes classical patterns encountered in distributed debugging. Then an efficient polynomial time algorithm detecting such patterns in a labeled dag is presented. To be easily adapted to an on-the-fly detection of the pattern in distributed executions, the algorithm visits the nodes of the graph according to a topological sort strategy.
Type de document :
[Research Report] RR-2838, INRIA. 1996
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:54:31
Dernière modification le : jeudi 11 janvier 2018 - 06:20:08
Document(s) archivé(s) le : lundi 5 avril 2010 - 00:00:13



  • HAL Id : inria-00073852, version 1



Michel Hurfin, Michel Raynal. Detecting Diamond Necklaces in Labeled Dags (A Problem from Distributed Debugging). [Research Report] RR-2838, INRIA. 1996. 〈inria-00073852〉



Consultations de la notice


Téléchargements de fichiers