SC Conference (1999)
Portland, Oregon, USA
Nov. 13, 1999 to Nov. 18, 1999
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SC.1999.10054
Hubertus Franke , IBM T. J. Watson Research Center
Joefon Jann , IBM T. J. Watson Research Center
Jose Moreira , IBM T. J. Watson Research Center
Pratap Pattnaik , IBM T. J. Watson Research Center
Morris Jette , Lawrence Livermore National Laboratory
In this paper we analyze the behavior of a gang-scheduling system that we are developing for the ASCI Blue-Pacific machines. Starting with a real workload obtained from job logs of one of the ASCI machines, we generate a statistical model of this workload using Hyper Erlang distributions. We then vary the parameters of those distributions to generate various workloads, representative of different operating points of the machine. Through simulation we obtain performance characteristics for three different scheduling strategies: (i) first-come first-serve, (ii) gang-scheduling, and (iii) backfilling. Our results show that both backfilling and gang-scheduling with moderate multiprogramming levels are much more effective than simple first-come first-serve scheduling. In addition, we show that gang-scheduling can display better performance characteristics than backfilling, particularly for large production jobs.
J. Jann, P. Pattnaik, J. Moreira, M. Jette and H. Franke, "An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific," SC Conference(SC), Portland, Oregon, USA, 1999, pp. 45.