Modeling of Workload in MPPs

In this paper we have characterized the inter-arrival time and service time distributions for jobs at a large MPP supercomputing center. Our findings show that the distributions are dispersive and complex enough that they require Hyper Erlang distributions to capture the first three moments of the observed workload. We also present the parameters from the characterization so that they can be easily used for both theoretical studies and the simulations of various scheduling algorithms.

By: Joefon Jann, Pratap Pattnaik, Hubertus Franke, Fang Wang (Yale Univ.), Joseph Skovira (Cornell Univ.) and Joseph Riordan (Cornell Univ.)

Published in: Lecture Notes in Computer Science, volume , (no ), pages 95-116 in 1997

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .