Multiple-Queue Backfilling Scheduling with Priorities and Reservations for Parallel Systems

  • Barry G. Lawson
  • Evgenia Smirni
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2537)


We describe a new, non-FCFS policy to schedule parallel jobs on systems that may be part of a computationalgrid . Our algorithm continuously monitors the system (i.e., the intensity of incoming jobs and variability of their resource demands), and adapts its scheduling parameters according to workload fluctuations. The proposed policy is based on backfilling, which reduces resource fragmentation by executing jobs in an order different than their arrivalwit hout delaying certain previously submitted jobs. We maintain multiple job queues that effectively separate jobs according to their projected execution time. Our policy supports different job priorities and job reservations, making it appropriate for scheduling jobs on parallel systems that are part of a computational grid. Detailed performance comparisons via simulation using traces from the Parallel Workload Archive indicate that the proposed policy consistently outperforms traditional backfilling.


batch schedulers computational grids parallel systems backfilling schedulers performance analysis. 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Crockett, Tom: Private Communication, June 2002., 76
  2. [2]
    Feitelson, D.G.: A Survey of Scheduling in Multiprogrammed Parallel Systems. Technical Report RC 19790, IBM Research Division, October 1994. 73Google Scholar
  3. [4]
    Keleher, P., Zotkin, D., and Perkovic, D.: Attacking the Bottlenecks in Backfilling Schedulers. Cluster Computing: The Journal of Networks, Software Tools and Applications. 3(4) (2000) 245–254. 73, 74Google Scholar
  4. [5]
    Lawson, B.G., Smirni, E., and Puiu D.: Self-Adapting Backfilling Scheduling for Parallel Systems. Proceedings of the 2002 International Conference on Parallel Processing (ICPP 2002). August 2002, 583–592. 73, 74, 75Google Scholar
  5. [7]
    Mu’alem, A.W. and Feitelson, D. G.: Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBMSP2 with Backfilling. IEEE Transactions on Parallel and Distributed Systems. 12(6) (2001) 529–543. 73, 74CrossRefGoogle Scholar
  6. [9]
    Perkovic, D. and Keleher, P.: Randomization, Speculation, and Adaptation in Batch Schedulers. Proceedings of Supercomputing 2000 (SC 2000). November 2000. 73, 74Google Scholar
  7. [11]
    Talby, D. and Feitelson, D.G.: Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler Using Slack-Based Backfilling. Proceedings of the 13th International Parallel Processing Symposium. April 1999, 513–517. 73Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Barry G. Lawson
    • 1
  • Evgenia Smirni
    • 2
  1. 1.Department of Mathematics and Computer ScienceUniversity of RichmondRichmondUSA
  2. 2.Department of Computer ScienceThe College of William and MaryWilliamsburgUSA

Personalised recommendations