- 期刊
Online Scheduling of Moldable Jobs with Deadline
並列摘要
Parallel job scheduling has long been an important research issue for high-performance computing (HPC). Most modern parallel application programs can be written with a good property called moldable which allows parallel programs to have the flexibility of exploiting different parallelisms for execution. Some previous research has developed adaptive processor allocation methods for moldable jobs to improve the overall performance of HPC systems. Recently, the concept of HPC as a Service (HPCaaS) was proposed to bring the traditional HPC field into the era of cloud computing. For HPCaaS systems, scheduling jobs with deadline efficiently becomes a crucial issue. This paper explores the issues of scheduling moldable jobs with deadline, which has not received enough research attention yet. We propose and evaluate three possible dynamic scheduling approaches for online moldable jobs with deadline.
被引用紀錄
延伸閱讀
- Hsu, H. C. (2012). Parallel Machine Scheduling with Machine Availability,Eligibility and Job Incompatible Constraints [master's thesis, National Central University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0031-1903201314443181
- 李佳陽（2019）。Flexible Job and Material Delivery Scheduling Problem And Heuristic Solving Methods〔碩士論文，國立臺灣大學〕。華藝線上圖書館。https://doi.org/10.6342/NTU201902703
- Yeh, S. L. (2009). Parallel Machine Scheduling with Job Splitting [master's thesis, National Tsing Hua University]. Airiti Library. https://doi.org/10.6843/NTHU.2009.00227
- Liu, Q., Wan, L., & Wei, L. (2015). Online Scheduling on a Single Machine with Grouped Processing Times. Discrete Dynamics in Nature and Society, 2015(), 817-823-288. https://doi.org/10.1155/2015/805294
- 廖祐紳（2010）。Robust Single Machine Scheduling to Minimize Number of Tardy Jobs〔碩士論文，國立臺北科技大學〕。華藝線上圖書館。https://doi.org/10.6841/NTUT.2010.00450