A comprehensive model of the supercomputer workload

As with any computer system, the performance of supercomputers depends upon the workloads that serve as their input. Unfortunately, however, there are many important aspects of the supercomputer workloads that have not been modeled, or that have been modeled only incipiently. This paper attacks this problem by considering requested time (and its relation with execution time) and the possibility of job cancellation, two aspects of the supercomputer workload that have not been modeled yet. Moreover, we also improve upon existing models for the arrival instant and partition size.

[1]  Giuseppe Serazzi,et al.  Workload characterization: a survey , 1993, Proc. IEEE.

[2]  Dror G. Feitelson,et al.  Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860 , 1995, JSSPP.

[3]  Allen B. Downey,et al.  A Model For Speedup of Parallel Programs , 1997 .

[4]  Fang Wang,et al.  Modeling of Workload in MPPs , 1997, JSSPP.

[5]  Allen B. Downey,et al.  A parallel workload model and its implications for processor allocation , 1996, Proceedings. The Sixth IEEE International Symposium on High Performance Distributed Computing (Cat. No.97TB100183).

[6]  Allen B. Downey,et al.  The elusive goal of workload characterization , 1999, PERV.