|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
2011 International Conference on Parallel Processing
Exposing Complex Bug-Triggering Conditions in Distributed Systems via Graph Mining
Taipei City, Taiwan
September 13-September 16
ISBN: 978-0-7695-4510-3
| ASCII Text | x | ||
| Eunsoo Seo, Mohammad Maifi Hasan Khan, Prasant Mohapatra, Jiawei Han, Tarek Abdelzaher, "Exposing Complex Bug-Triggering Conditions in Distributed Systems via Graph Mining," 2012 41st International Conference on Parallel Processing, pp. 186-195, 2011 International Conference on Parallel Processing, 2011. | |||
| BibTex | x | ||
| @article{ 10.1109/ICPP.2011.62, author = {Eunsoo Seo and Mohammad Maifi Hasan Khan and Prasant Mohapatra and Jiawei Han and Tarek Abdelzaher}, title = {Exposing Complex Bug-Triggering Conditions in Distributed Systems via Graph Mining}, journal ={2012 41st International Conference on Parallel Processing}, volume = {0}, year = {2011}, issn = {0190-3918}, pages = {186-195}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPP.2011.62}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 41st International Conference on Parallel Processing TI - Exposing Complex Bug-Triggering Conditions in Distributed Systems via Graph Mining SN - 0190-3918 SP186 EP195 A1 - Eunsoo Seo, A1 - Mohammad Maifi Hasan Khan, A1 - Prasant Mohapatra, A1 - Jiawei Han, A1 - Tarek Abdelzaher, PY - 2011 KW - Fault diagnosis KW - Software debugging KW - Data mining VL - 0 JA - 2012 41st International Conference on Parallel Processing ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPP.2011.62
Software bugs in distributed systems are notoriously hard to find due to the large number of components involved and the non-determinism introduced by race conditions between messages. This paper introduces Pop Mine, a tool for diagnosing corner-case bugs by finding the minimal causal directed acyclic graph (DAG) of events, spanning multiple processes, which captures a bug-triggering condition. Being based on causal order, a global notion of time is not required in uncovering bug-triggering distributed event patterns. Bug triggering event DAGs can be identified by comparing execution graphs from successful runs to those where bug manifestations were observed, and exposing the minimal discriminative event DAGs that may be responsible for the problem. This is a significant extension to prior debugging tools, in that prior work considered much simpler bug-triggering conditions such as single events, event sets, or ordered chains of events. To the authors' knowledge, this is the first paper that considers bug-triggering conditions in the form of distributed event graphs. To prove the effectiveness of our approach, we applied our tool to VCP, Chord and GreenGPS and diagnosed bugs. We also present performance analysis results to demonstrate the scalability of our approach.
Index Terms:
Fault diagnosis, Software debugging, Data mining
Citation:
Eunsoo Seo, Mohammad Maifi Hasan Khan, Prasant Mohapatra, Jiawei Han, Tarek Abdelzaher, "Exposing Complex Bug-Triggering Conditions in Distributed Systems via Graph Mining," icpp, pp.186-195, 2011 International Conference on Parallel Processing, 2011
Usage of this product signifies your acceptance of the Terms of Use.
