Abstract | ||
---|---|---|
When something unexpected happens in a large production system, administrators must first perform a search to isolate which components and component interactions are likely to be involved. The system may consist of thousands of interacting subsystems, the logging instrumentation may be noisy or incomplete, and the problem description may be vague, so this search is often the most difficult part of understanding the system's behavior. To facilitate the search process, we present a query language and a method for computing these queries that makes minimal assumptions about the available data. We evaluate our method on nearly 1.22 billion lines of system logs from four supercomputers, two autonomous vehicles, and a server cluster. |
Year | DOI | Venue |
---|---|---|
2010 | 10.1145/1810085.1810114 | I4CS |
Keywords | DocType | Citations |
query language,available data,interacting subsystems,autonomous vehicle,difficult part,billion line,search process,minimal assumption,large production system,system log,component interaction,production systems,correlation,production system | Conference | 3 |
PageRank | References | Authors |
0.41 | 26 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Adam J. Oliner | 1 | 715 | 51.10 |
Alex Aiken | 2 | 5009 | 461.41 |