The Community for Technology Leaders
Green Image
<p><b>Abstract</b>—In this paper, we introduce a runtime, nontrace-based algorithm to compute the critical path profile of the execution of message passing and shared-memory parallel programs. 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 brief case study to quantify the runtime overhead of our algorithm and to show that online critical path profiling can be used to find program bottlenecks.</p>
Parallel and distributed processing, measurement, tools, program tuning, on-line evaluation.

J. K. Hollingsworth, "Critical Path Profiling of Message Passing and Shared-Memory Programs," in IEEE Transactions on Parallel & Distributed Systems, vol. 9, no. , pp. 1029-1040, 1998.
88 ms
(Ver 3.3 (11022016))