A Non-Work Conserving Algorithm for Dynamic Scheduling of Moldable Gang Tasks on Multicore Systems.

In this paper, we consider a dynamic scheduling algorithm for moldable gang tasks on multicore systems. While previous algorithms have been proposed, they predominantly adhere to work-conserving scheduling algorithms. In this paper, we introduce a non-work conserving dynamic scheduling algorithm aiming to reduce the makespan. Our proposed algorithm employs beam-search to perform non-work conserving scheduling. Through experiments, we demonstrate that under certain conditions, our method improves the makespan by 10% compared to existing methods. Furthermore, we discuss the variance in results based on the characteristics of the input tasks.