ES: a tool for predicting the performance of parallel systems
James B. Sinclair, W. P. Dawkins · 2002
ES is a tool for estimating the execution times of parallel algorithms on MIMD parallel systems. ES allows the user to model arbitrary task execution times, explicit task precedence and synchronization constraints, resource contention among tasks, and a variety of scheduling policies for shared resources. Given a model of a parallel algorithm and a parallel system, ES constructs a sequencing tree that represents some or all of the possible sequences of events that may occur during the execution of the algorithm on the system, and uses it to estimate the mean and standard deviation of the execution time of the parallel algorithm. The authors compare estimates generated by ES to measurements made of a parallel mergesort executing on an Intel iPSC/860 hypercube.>