Home * Programming * Optimization * Profiling

Profiling,
a form of dynamic program analysis to determine frequency and duration of function calls inside a (chess) program, or to analyze its space (memory) or time complexity and (parallel) performance. Profiling is achieved by instrumenting either the program source code or its binary executable using a tool called a profiler, often integrated into runtime APIs of interpreted languages, or for compiled languages into compiler collections or processor tool sets. Most commonly, profiling information is used to find hot spots and performance bottlenecks, and to serve as aid for program optimization. So called flat profilers compute the average call times, from the calls, but do not break down the call times based on the callee or the context [1], while call graph profilers show the call times, and frequencies of the functions, and also the call-chains involved based on the callee [2].

PGO

Profile-guided optimization (PGO) is a compiler optimization which uses the results of profiling test runs of an instrumented program to optimize the final generated code.

See also


Postings

1999

2000 ...

2005 ...

2010 ...

2015 ...


External Links


References

  1. ^ Profiling (computer programming) from Wikipedia
  2. ^ Beginner's guide to graphical profiling by Matthew Lai, CCC, September 10, 2016

What links here?


Up one Level