Liu, FengWeissman, Jon2020-09-022020-09-022015-04-16https://hdl.handle.net/11299/215971In today’s batch queue HPC cluster systems, the user submits a job requesting a fixed number of processors. The system will not start the job until all of the requested resources become available simultaneously. When cluster workload is high, large sized jobs will experience long waiting time due to this policy. In this paper, we propose a new approach that dynamically decomposes a large job into smaller ones to reduce waiting time, and lets the application expand across multiple subjobs while continuously achieving progress. This approach has three bene?ts: (i) application turnaround time is reduced, (ii) system fragmentation is diminished, and (iii) fairness is promoted. Our approach does not depend on job queue time prediction but exploits available back?ll opportunities. Simulation results have shown that our approach can reduce application mean turnaround time by up to 48%.en-USReport