| Title | Mining temporal invariants from partially ordered logs |
| Publication Type | Journal Article |
| Year of Publication | 2011 |
| Authors | Beschastnikh I, Brun Y, Ernst MD, Krishnamurthy A, Anderson TE |
| Journal | SIGOPS Operating Systems Review |
| Volume | 45 |
| Pagination | 39–46 |
| Date or Month Published | December |
| Abstract | A common assumption made in log analysis research is that the underlying log is totally ordered. For concurrent systems, this assumption constrains the generated log to either exclude concurrency altogether, or to capture a particular interleaving of concurrent events. This paper argues that capturing concurrency as a partial order is useful and often indispensable for answering important questions about concurrent systems. To this end, we motivate a family of event ordering invariants over partially ordered event traces, give three algorithms for mining these invariants from logs, and evaluate their scalability on simulated distributed system logs. |
| Downloads | https://homes.cs.washington.edu/~mernst/pubs/mining-po-logs-osr2011.pdf PDF
|
| Citation Key | BeschastnikhBEKA2011:OSR |
