JSSPP 2000: Job Scheduling Strategies for Parallel Processing pp 68-73 | Cite as
A Critique of ESP
Conference paper
Abstract
This note is an elaboratin of a panel presentation, and is meant as a constructive critique of ESP. It should be remembered that the bottom line is that ESP is a big step in an important direction – otherwise we wouldn’t bother with this discussion...
Preview
Unable to display preview. Download preview PDF.
References
- 1.D. H. Bailey, E. Barszcz, L. Dagum, and H. D. Simon, “NAS parallel benchmark results≓. IEEE Trans. Parallel & Distributed Syst. 1(1), pp. 43–51, Feb 1993.Google Scholar
- 2.G. Cybenko, L. Kipp, L. Pointer, and D. Kuck, “Supercomputer performance evaluation and the Perfect Benchmarks≓. In Intl. Conf. Supercomputing, pp. 254– 266, Jun 1990.Google Scholar
- 3.J. J. Dongarra, “Performance of various computers using standard linear equations software≓. Comput. Arch. News 18(1), pp. 17–31, Mar 1990.Google Scholar
- 4.A. B. Downey and D. G. Feitelson, “The elusive goal of workload characterization≓. Perf. Eval. Rev. 26(4), pp. 14–29, Mar 1999.Google Scholar
- 5.D. G. Feitelson and A. Mu’alem Weil, “Utilization and predictabilityin scheduling the IBM SP2 with back.lling≓. In 12th Intl. Parallel Processing Symp., pp. 542–546, Apr1998. A Critique of ESP 73Google Scholar
- 6.J. P. Jones and B. Nitzberg, “Scheduling for parallel supercomputing: a historical perspective of achievable utilization≓. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1–16, Springer-Verlag, 1999. Lect. Notes Comput. Sci. vol. 1659.Google Scholar
- 7.J. P. Singh, W-D. Weber, and A. Gupta, “SPLASH: Stanford parallel applications for shared-memory≓. Comput. Arch. News 20(1), pp. 5–44, Mar 1992.CrossRefGoogle Scholar
- 8.A. Wong, L. Oliker, W. Kramer, T. Kaltz, and D. Bailey, “System utilization benchmark on the CrayT3E and IBM SP2≓. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), p. 58–70, Springer Verlag, 2000. Lect. Notes Comput. Sci. vol. 1911.Google Scholar
Copyright information
© Springer-Verlag Berlin Heidelberg 2000