Combinational backfilling for parallel job scheduling

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

doi:10.1109/ICETC.2010.5529424

Combinational backfilling for parallel job scheduling

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

^*Corresponding author for this work

Beihang University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Citations (Scopus)

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.

Original language	English
Title of host publication	ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
Pages	V2112-V2116
DOIs	https://doi.org/10.1109/ICETC.2010.5529424
Publication status	Published - 2010
Externally published	Yes
Event	2010 2nd International Conference on Education Technology and Computer, ICETC 2010 - Shanghai, China Duration: 22 Jun 2010 → 24 Jun 2010

Publication series

Name	ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
Volume	2

Conference

Conference	2010 2nd International Conference on Education Technology and Computer, ICETC 2010
Country/Territory	China
City	Shanghai
Period	22/06/10 → 24/06/10

Keywords

Clusters
Combinational backfilling
Job scheduling
Parallel jobs
Resource utilization

Access to Document

10.1109/ICETC.2010.5529424

Cite this

Yi, S., Wang, Z., Ma, S., Che, Z., Liang, F., & Huang, Y. (2010). Combinational backfilling for parallel job scheduling. In ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer (pp. V2112-V2116). Article 5529424 (ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer; Vol. 2). https://doi.org/10.1109/ICETC.2010.5529424

@inproceedings{622b050b263344d7a2753aa8fba77320,

title = "Combinational backfilling for parallel job scheduling",

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 = "Clusters, Combinational backfilling, Job scheduling, Parallel jobs, Resource utilization",

author = "Shengwei Yi and Zhichao Wang and Shilong Ma and Zhanbin Che and Feng Liang and Yonggang Huang",

year = "2010",

doi = "10.1109/ICETC.2010.5529424",

language = "English",

isbn = "9781424463688",

series = "ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer",

pages = "V2112--V2116",

booktitle = "ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer",

note = "2010 2nd International Conference on Education Technology and Computer, ICETC 2010 ; Conference date: 22-06-2010 Through 24-06-2010",

}

Yi, S, Wang, Z, Ma, S, Che, Z, Liang, F & Huang, Y 2010, Combinational backfilling for parallel job scheduling. in ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer., 5529424, ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer, vol. 2, pp. V2112-V2116, 2010 2nd International Conference on Education Technology and Computer, ICETC 2010, Shanghai, China, 22/06/10. https://doi.org/10.1109/ICETC.2010.5529424

Combinational backfilling for parallel job scheduling. / Yi, Shengwei; Wang, Zhichao; Ma, Shilong et al.
ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer. 2010. p. V2112-V2116 5529424 (ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer; Vol. 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Combinational backfilling for parallel job scheduling

AU - Yi, Shengwei

AU - Wang, Zhichao

AU - Ma, Shilong

AU - Che, Zhanbin

AU - Liang, Feng

AU - Huang, Yonggang

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Clusters

KW - Combinational backfilling

KW - Job scheduling

KW - Parallel jobs

KW - Resource utilization

UR - http://www.scopus.com/inward/record.url?scp=77956043895&partnerID=8YFLogxK

U2 - 10.1109/ICETC.2010.5529424

DO - 10.1109/ICETC.2010.5529424

M3 - Conference contribution

AN - SCOPUS:77956043895

SN - 9781424463688

T3 - ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer

SP - V2112-V2116

BT - ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer

T2 - 2010 2nd International Conference on Education Technology and Computer, ICETC 2010

Y2 - 22 June 2010 through 24 June 2010

ER -

Combinational backfilling for parallel job scheduling

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this