Parallel performance evaluation through critical path analysis

In this paper we discuss the concept of space-time diagrams as a representation of the execution of an application, and then give a method, based on critical path analysis, for calculating nontrivial upper bounds on the potential parallelism, known as the average parallelism, a complement to the speedup and efficiency.

[1]  Edward D. Lazowska,et al.  Speedup Versus Efficiency in Parallel Systems , 1989, IEEE Trans. Computers.

[2]  David R. Jefferson,et al.  Virtual time , 1985, ICPP.

[3]  Boris D. Lubachevsky,et al.  Efficient parallel simulations of dynamic Ising spin systems , 1988 .

[4]  R. M. Fujimoto,et al.  Parallel discrete event simulation , 1989, WSC '89.

[5]  Peter M. A. Sloot,et al.  Modelling and Simulation , 1988, Systems Analysis and Simulation 1988, I: Theory and Foundations. Proceedings of the International Symposium held in Berlin (GDR), September 12–16, 1988.

[6]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[7]  Peter M. A. Sloot,et al.  Application of time warp to parallel simulations with asynchronous cellular automata , 1993 .