In this paper we present a profiling methodology and toolkit for helping developers discover hidden asymptotic inefficiencies in the code. From one or more runs of a program, our profiler automatically measures how the performance of individual routines scales as a function of the input size, yielding clues to their growth rate. The output of the profiler is, for each executed routine of the program, a set of tuples that aggregate performance costs by input size. The collected profiles can be used to produce performance plots and derive trend functions by statistical curve fitting or bounding techniques. A key feature of our method is the ability to automatically measure the size of the input given to a generic code fragment: to this aim, we propose an effective metric for estimating the input size of a routine and show how to compute it efficiently. We discuss several case studies, showing that our approach can reveal asymptotic bottlenecks that other profilers may fail to detect and characterize the workload and behavior of individual routines in the context of real applications. To prove the feasibility of our techniques, we implemented a Valgrind tool called aprof and performed an extensive experimental evaluation on the SPEC CPU2006 benchmarks. Our experiments show that aprof delivers comparable performance to other prominent Valgrind tools, and can generate informative plots even from single runs on typical workloads for most algorithmically-critical routines.
Input-sensitive profiling / Coppa, Emilio; Demetrescu, Camil; Finocchi, Irene. - In: ACM SIGPLAN NOTICES. - ISSN 1523-2867. - 47:6(2012), pp. 89-98. [10.1145/2254064.2254076]
|Data di pubblicazione:||2012|
|Citazione:||Input-sensitive profiling / Coppa, Emilio; Demetrescu, Camil; Finocchi, Irene. - In: ACM SIGPLAN NOTICES. - ISSN 1523-2867. - 47:6(2012), pp. 89-98. [10.1145/2254064.2254076]|
|Appare nelle tipologie:||01.1 - Articolo su rivista (Article)|
File in questo prodotto:
|pldi055-coppa.pdf||Versione dell'editore||DRM non definito||Administrator|