Analyzing performance traces using temporal formulas. (3rd February 2014)

• Record Type: Journal Article
• Authors: Ryckbosch, Frederick; Diwan, Amer; Ranjan, Rajiv; Buyya, Rajkumar; Leitner, Philipp; Haller, Armin; Tai, Stefan
• Is Part Of: Software, practice & experience. Volume 44:Number 7(2014)
• Page Start: 777
• Page End: 792
• Publication Date: 2014-02-03
• Subjects: Computer software -- Periodicals; Computer programming -- Periodicals; Computer programs -- Periodicals; 005.3
• DOI: 10.1002/spe.2256
• Languages: English
• ISSNs: 0038-0644

Abstract

<abstract abstract-type="main" id="spe2256-abs-0001"> <title>SUMMARY</title> <p id="spe2256-para-0001">While profiling is invaluable for debugging performance problems that affect the common case, it is of little help in tracking performance problems that affect the slowest 1% of the operations (i.e., long‐tail latencies). For Web service providers, these long‐tail latencies affect both the cost of the service and the user experience. Because interactions between operations are often responsible for long‐tail latency, we must analyze fine‐grained traces to investigate their cause.</p> <p id="spe2256-para-0002">Unfortunately, analyzing traces is difficult because one needs to reason over long chains of events and because this reasoning often requires significant domain knowledge about what the event sequences mean. This paper shows how we can use formulas in linear‐temporal logic to analyze traces. Given these formulas, our system searches through traces to find matches for these formulas and extracts relevant information from the matches. We demonstrate that our system is scalable and enables us to investigate long‐tail performance problems at Google. Copyright © 2014 John Wiley &amp; Sons, Ltd.</p> </abstract>