Characterization of backfilling strategies for parallel job scheduling

Although there is wide agreement that backfilling produces significant benefits in scheduling of parallel jobs, there is no clear consensus on which backfilling strategy is preferable e.g. should conservative backfilling be used or the more aggressive EASY backfilling scheme; should a first-come first-served (FCFS) queue-priority policy be used, or some other such as shortest job first (SF) or expansion factor (XF); In this paper we use trace-based simulation to address these questions and glean new insights into the characteristics of backfilling strategies for job scheduling. We show that by viewing performance in terms of slowdowns and turnaround times of jobs within various categories based on their width (processor request size), length (job duration) and accuracy of the user´s estimate of run time, some consistent trends may be observed.