Affiliation:
1. Gwangju Institute of Science and Technology, Gwangju, Korea
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 technique weights each sample by monitoring 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.
Funder
Ministry of Science, ICT and Future Planning
Publisher
Association for Computing Machinery (ACM)
Subject
Hardware and Architecture,Information Systems,Software
Reference21 articles.
1. The Jikes Research Virtual Machine project: Building an open-source research community
2. Adaptive optimization in the Jalapeño JVM
3. Collecting and Exploiting High-Accuracy Call Graph Profiles in Virtual Machines
4. Matthew Arnold and Peter F. Sweeney. 2000. Approximating the Calling Context Tree via Sampling. Technical Report RC 21789. IBM T.J. Watson Research Center. Matthew Arnold and Peter F. Sweeney. 2000. Approximating the Calling Context Tree via Sampling. Technical Report RC 21789. IBM T.J. Watson Research Center.
5. The DaCapo benchmarks
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Profile inference revisited;Proceedings of the ACM on Programming Languages;2022-01-12