Precluding Useless Events for On-Line Global Predicate Detections

Li-Hsing Yen*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

Abstract

Detecting global predicates is an important task in testing and debugging distributed programs. In this paper, we propose an approach that effectively precludes useless events for global predicate detections, facilitating the process of an independent on-line checking routine. To identify more useless events than a simple causality-check method can do, our method tracks and maintains the precedence information of event intervals as a graph. To reduce the potentially expensive space and time cost as the graph expands, we propose an effective scheme to prune the graph. The performance of our method is analyzed and evaluated by simulations. The result shows that our approach outperforms conventional approaches in terms of the number of useless events found.

Original languageEnglish
Pages (from-to)1077-1095
Number of pages19
JournalJournal of Parallel and Distributed Computing
Volume61
Issue number8
DOIs
StatePublished - 1 Aug 2001

Keywords

  • Distributed systems; distributed debugging; global state; causality; predicate detection; event interval; zigzag path

Fingerprint Dive into the research topics of 'Precluding Useless Events for On-Line Global Predicate Detections'. Together they form a unique fingerprint.

Cite this