Most modern parallel programs are written with the moldable property. However, most existing parallel computing systems treat such parallel programs as rigid jobs for scheduling, resulting in two drawbacks. The first is inflexibility and inefficiency in processor allocation, leading to resource fragmentation and thus poor performance. The second is about usage inconvenience, requiring users to figure out the best number of processors for executing a job. As HPC as a service emerges, moldable job scheduling has become an important research issue for achieving both high performance and user convenience. This paper presents our research work on developing new processor allocation approaches for moldable job scheduling based on two-level resource utilization calculation, preemptive job execution, and dual-criteria iterative improvement. A series of simulation experiments have been conducted to evaluate the proposed approaches and compare them to previous methods. The experimental results demonstrate significant performance improvement in terms of average turnaround time.

中文翻译：

---

用于调度可塑作业的基于两级利用率的处理器分配

大多数现代并行程序都是用可塑属性编写的。然而，大多数现有的并行计算系统将此类并行程序视为调度的刚性作业，导致两个缺点。首先是处理器分配的不灵活和低效率，导致资源碎片化，从而导致性能不佳。第二个是关于使用不便，要求用户找出执行作业的最佳处理器数量。随着 HPC 即服务的出现，可塑作业调度已成为实现高性能和用户便利性的重要研究问题。本文介绍了我们的研究工作，为基于两级资源利用率计算、抢占式作业执行和双标准迭代改进的可塑作业调度开发新的处理器分配方法。已经进行了一系列模拟实验来评估所提出的方法并将它们与以前的方法进行比较。实验结果表明，平均周转时间方面的性能显着提高。