Adaptive correction of sampling bias in dynamic call graphs

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

Abstract

This article introduces a practical low-overhead adaptive technique of correcting sampling bias in profiling dynamic call graphs. Timer-based sampling keeps the overhead low but sampling bias lowers the accuracy when either observable call events or sampling actions are not equally spaced in time. To mitigate sampling bias, our adaptive correction techniqueweights each sample bymonitoring time-varying spacing of call events and sampling actions. We implemented and evaluated our adaptive correction technique in Jikes RVM, a high-performance virtual machine. In our empirical evaluation, our technique significantly improved the sampling accuracy without measurable overhead and resulted in effective feedback directed inlining.

Author supplied keywords

Cite

CITATION STYLE

APA

Lee, B. (2015). Adaptive correction of sampling bias in dynamic call graphs. ACM Transactions on Architecture and Code Optimization, 12(4). https://doi.org/10.1145/2840806

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