Combinational backfilling for parallel job scheduling

Author

Yi, Shengwei ; Wang, Zhichao ; Ma, Shilong ; Zhanbin Che ; Liang, Feng ; Huang, Yonggang

Author_Institution

NLSDE Lab., Beihang Univ., Beijing, China

Volume

2

fYear

2010

fDate

22-24 June 2010

Abstract

FCFS is the most simple, basic and commonly used method of job scheduling in clusters. Backfilling scheduling that small jobs are moved ahead in the schedule can fill the resources gap that is generated by FCFS. However, existing backfilling scheduling algorithms are available for a queued job backfilled to schedule. The resources gap can´t be fully utilized. A method of combinational backfilling for parallel job scheduling in clusters is proposed. It can select multiple jobs combined from the waiting job queue to backfill to maximize the use of idle resources. A comparison with FCFS, EASY backfilling algorithm is given. The results of experiments show that the algorithm proposed can attain the higher utilization of resources in the system than FCFS, EASY backfilling.

Keywords

combinatorial mathematics; parallel processing; scheduling; EASY backfilling algorithm; FCFS scheduling; backfilling scheduling; combinational backfilling; first-come-first-serve scheduling; parallel job scheduling; Application software; Clustering algorithms; Computer science education; Concurrent computing; Educational technology; Laboratories; Optimal scheduling; Processor scheduling; Resource management; Scheduling algorithm; clusters; combinational backfilling; job scheduling; parallel jobs; resource utilization;

fLanguage

English

Publisher

ieee

Conference_Titel

Education Technology and Computer (ICETC), 2010 2nd International Conference on

Conference_Location

Shanghai

Print_ISBN

978-1-4244-6367-1

Type

conf

DOI

10.1109/ICETC.2010.5529424

Filename

5529424