We present statistical techniques forpredicting the queue times experienced by jobs submitted to a space-sharing parallel machine with jrst-come-jrst-served (FCFS) scheduling. We apply these techniques to trace data from the Intel Paragon at the San Diego Supercomputer Center and the IBM SP2 at the Cornell Theory Centel: We show that it is possible to predict queue times with accuracy that is acceptable f o r several intended applications. The coeficient of correlation between our predicted queue times and the actual queue times from simulated schedules is between 0.65 and 0.12.
Predictions of distribution delays are presented in REF where the authors use statistical techniques to predict jobs queue times submitted to a space-sharing parallel machine with the First-Come-First-Served scheduling policy.
Predicting queue times on space-sharing parallel computers
Proceedings 11th International Parallel Processing Symposium
Proceedings 11th International Parallel Processing Symposium
Computer Science