Combinational backfilling for parallel job scheduling

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

*此作品的通讯作者

科研成果: 书/报告/会议事项章节会议稿件同行评审

8 引用 (Scopus)
Plum Print visual indicator of research metrics
  • Citations
    • Citation Indexes: 8
  • Captures
    • Readers: 5
see details

摘要

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.

源语言英语
主期刊名ICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
V2112-V2116
DOI
出版状态已出版 - 2010
已对外发布
活动2010 2nd International Conference on Education Technology and Computer, ICETC 2010 - Shanghai, 中国
期限: 22 6月 201024 6月 2010

出版系列

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

会议

会议2010 2nd International Conference on Education Technology and Computer, ICETC 2010
国家/地区中国
Shanghai
时期22/06/1024/06/10

指纹

探究 'Combinational backfilling for parallel job scheduling' 的科研主题。它们共同构成独一无二的指纹。

引用此

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