Scheduling mixed-parallel applications with advance reservations
Scheduling mixed-parallel applications with advance reservations
复制标题
DOI：
10.1007/s10586-009-0073-3
复制
发表时间：
2008-06
期刊：
影响因子：
--
通讯作者：
K. Aida;H. Casanova
中科院分区：
文献类型：
--
作者：
K. Aida;H. Casanova
本文研究了混合并行应用程序的调度问题，该应用程序具有任务并行性和数据并行性。研究了最小化应用程序周转时间和满足截止日期的问题。对于每一个调度算法提出，其中一些借鉴了以前发表的思想在非保留设置。在广泛的应用和保留场景下对算法进行了仿真比较。主要发现是，使用先前发布的CPA算法计算的调度可以适应提前预留设置，特别是导致低资源消耗，从而提高效率。
This paper investigates the scheduling of mixed-parallel applications, which exhibit both task and data parallelism, in advance reservations settings. Both the problem of minimizing application turn-around time and that of meeting a deadline are studied. For each several scheduling algorithms are proposed, some of which borrow ideas from previously published work in non-reservation settings. Algorithms are compared in simulation over a wide range of application and reservation scenarios. The main finding is that schedules computed using the previously published CPA algorithm can be adapted to advance reservation settings, notably resulting in low resource consumption andthus high efficiency.