An online computation of critical path profiling
Jeffrey K. Hollingsworth · 1996
In this paper we introduce a runtime, non-trace based algorithm to compute the critical path projile of the execution of a message passing parallel program.Our algorithm permits starting or stopping the critical path computation during program execution and reporting intermediate values.We also present an online algorithm to compute a variant of critical path, called critical path zeroing.that measures the reduction in application execution time that improving a selected procedure will have.Finally, we present a briefcase study to quantlfi the runtime overhead of our algorithm and to show that online critical path projiling can be used tojindprogram bottlenecks.