Abstract | ||
---|---|---|
Distributed systems are often difficult to debug and understand. A typical way of gaining insight into system behavior is by inspecting execution logs. However, manual inspection of logs is an arduous process. To support this task we developed Synoptic. Synoptic outputs a concise graph representation of logged events that captures temporal invariants mined from the log. We applied Synoptic to synthetic and real distributed system logs and found that it augmented a distributed system designer's understanding of system behavior with reasonable overhead for an offline analysis tool. In contrast to prior approaches, Synoptic uses a combination of refinement and coarsening to explore the space of representations. Additionally, it infers temporal event invariants to capture distributed system semantics. These invariants drive the exploration process and are satisfied by the final representation. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1145/1928991.1928995 | SLAML |
Keywords | Field | DocType |
arduous process,temporal invariants,concise graph representation,final representation,system behavior,temporal event invariants,system log,exploration process,system semantics,system designer | Data mining,Computer science,Theoretical computer science,Offline analysis,Invariant (mathematics),Semantics,Graph (abstract data type),Debugging | Conference |
Citations | PageRank | References |
9 | 0.61 | 30 |
Authors | ||
5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Sigurd Schneider | 1 | 110 | 4.38 |
Ivan Beschastnikh | 2 | 665 | 43.49 |
Slava Chernyak | 3 | 9 | 0.95 |
Michael D. Ernst | 4 | 6629 | 347.51 |
Yuriy Brun | 5 | 2216 | 91.89 |