J. K. Hollingsworth, "An Online Computation of Critical Path Profiling," SPDT'96: SIGMETRICS Symposium on Parallel and Distributed Tools. May 22-23, 1996, Philadelphia, PA, pp. 11-20. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Performance Monitoring in a Myrinet-Connected Shrimp Cluster - Liao, Martonosi, Clark (1998) (11 citations) (Correct)
....[5] our approach focuses on low level data collection rather than user interface and protocol issues. Because of our desire to be portable across programming models, we do little automated analysis of the performance information as in other recent work more focused on particular software models [14, 22]. Our performance monitoring approach is somewhat similar to techniques proposed in the FlashPoint system [20] That performance monitoring system embedded extra monitoring code into the cache coherence protocol handlers running on the FLASH multiprocessor s MAGIC chip. Our approach differs from ....
J. K. Hollingsworth. An online computation of critical path profiling. In Proc. of SIGMETRICS Symposium on Parallel and Distributed Tools, pages 11--20, May 1996.
Load Balancing Factor (LBF): A Workload Migration Metric - Eom, Hollingsworth Self-citation (Hollingsworth) (Correct)
No context found.
J. K. Hollingsworth, "An Online Computation of Critical Path Profiling," SPDT'96: SIGMETRICS Symposium on Parallel and Distributed Tools. May 22-23, 1996, Philadelphia, PA, pp. 11-20.
LBF: A Performance Metric for Program Reorganization - Eom, Hollingsworth (1998) Self-citation (Hollingsworth) (Correct)
....topological sort algorithm developed by Kimelman and Zernak[11] Our algorithm simulates the real execution on a target grouping of processes. To compute the predicted execution time of the target configuration during program execution, we use a variation of our online critical path algorithm[9]. Given a target grouping, we must determine the order of events in the grouping to build the GAG incrementally. Like a topological sort, we must choose the next event to process by selecting events such that all events are processed in the order dictated by the happen before relationship. Events ....
J. K. Hollingsworth, "An Online Computation of Critical Path Profiling, " SPDT'96: SIGMETRICS Symposium on Parallel and Distributed Tools. May 22-23, 1996, Philadelphia, PA, pp. 11-20.
Prediction and Adaptation in Active Harmony - Hollingsworth, Keleher (1998) (12 citations) Self-citation (Hollingsworth) (Correct)
....to the application programmer. Procedure Procedure LBF Measured Time Difference ServBusy1 25.3 25.4 0.1 (0.4 ) ServBusy2 23.0 23.1 0.1 (0.6 ) Figure 4: Procedure LBF accuracy. For comparison to an alternative tuning option, we also show the value for the Critical Path Zeroing metric [3]. CP Zeroing is a metric that predicts the improvement possible due to optimally tuning the selected procedure (i.e. reducing its execution time to zero) by computing the length of the critical path resulting from setting the time of the selected procedure to zero. We compare LBF with Critical ....
J. K. Hollingsworth, "An Online Computation of Critical Path Profiling," in SPDT'96: SIGMETRICS Symposium on Parallel and Distributed Tools, Philadelphia, PA, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC