Detecting diamond necklaces in labeled dags A problem from distributed debugging

Theme 1 - Reseaux et systemes - Projet AdpSIGLEAvailable at INIST (FR), Document Supply Service, under shelf-number : 22588, issue : a.1996 n.992 / INIST-CNRS - Institut de l'Information Scientifique et TechniqueFRFranc

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

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

LIPIcs, Volume 248, ISAAC 2022, Complete Volume

LIPIcs, Volume 248, ISAAC 2022, Complete Volum