Scheduling mixed-parallel applications with advance reservations

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 torn-around time and that of meeting a deadline are studied. For each several scheduling algorithms are proposed, some of which borrow ideas froth 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 and thus high efficiency.