Detecting diamond necklaces in labeled dags (a problem from distributed debugging)

DOI10.1007/3-540-62559-3_18MaRDI QIDQ6550546zbMATH OpenFDO

Authors Michel Hurfin, Michel Raynal

Publication date 5 June 2024

Full work available at URL https://doi.org/10.1007/3-540-62559-3_18

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1036309
• Increasing diamonds
• Debugging distributed programs using controlled re-execution
• Modeling, analyzing and slicing periodic distributed computations
• Some optimal algorithms for decomposed partially ordered sets

Cites work

• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3639163 (Why is no real title available?)
• On-the-fly analysis of distributed computations
• Time, clocks, and the ordering of events in a distributed system

This page was built for publication: Detecting diamond necklaces in labeled dags (a problem from distributed debugging)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550546)