Deep start: A hybrid strategy for automated performance problem searches

5Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present Deep Start, a new algorithm for automated performance diagnosis that uses stack sampling to augment our search-based automated performance diagnosis strategy. Our hybrid approach locates performance problems more quickly and finds problems hidden from a more straightforward search strategy. Deep Start uses stack samples collected as a by-product of normal search instrumentation to find deep starters, functions that are likely to be application bottlenecks. Deep starters are examined early during a search to improve the likelihood of finding performance problems quickly.We implemented the Deep Start algorithm in the Performance Consultant, Paradyn’s automated bottleneck detection component. Deep Start found half of our test applications’ known bottlenecks 32% to 59% faster than the Performance Consultant’s current call graphbased search strategy, and finished finding bottlenecks 10% to 61% faster. In addition to improving search time, Deep Start often found more bottlenecks than the call graph search strategy.

Cite

CITATION STYLE

APA

Roth, P. C., & Miller, B. P. (2002). Deep start: A hybrid strategy for automated performance problem searches. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2400, pp. 86–96). Springer Verlag. https://doi.org/10.1007/3-540-45706-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free