Content deleted Content added
No edit summary |
|||
Line 47:
===Call-graph profiler===
[[Call graph]] profilers<ref name="gprof" /> show the call times, and frequencies of the functions, and also the call-chains involved based on the callee. In some tools full context is not preserved<!--, but others can save full call tree-->.
===Input-sensitive profiler===
Input-sensitive profilers<ref name="aprof">[http://aprof.googlecode.com/files/pldi055-coppa.pdf E. Coppa, C. Demetrescu, and I. Finocchi, ''Input-Sensitive Profiling''] // Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2012), ACM SIGPLAN Notices, Vol. 47, No. 6, pp. 89-98; [[doi:10.1145/2345156.2254076]]</ref><ref>D. Zaparanuks and M. Hauswirth, ''Algorithmic Profiling'' // Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2012), ACM SIGPLAN Notices, Vol. 47, No. 6, pp. 67-76; [[doi:10.1145/2345156.2254074]]</ref><ref>T. Kustner, J. Weidendorfer, and T. Weinzierl, ''Argument Controlled Profiling'' // Proceedings of Euro-Par 2009 – Parallel Processing Workshops, Lecture Notes in Computer Science, Vol. 6043, pp. 177-184; [[doi:10.1007/978-3-642-14122-5_22]]</ref> add a further dimension to flat or call-graph profilers by relating performance measures to features of the input workloads, such as input size or input values. They generate charts that characterize how an application's performance scales as a function of its input.
==Data granularity in profiler types==
| |||