Heuristic Algorithms for Dynamic Scheduling of Moldable Tasks

Abstract

Dynamic scheduling of parallel tasks is one of efficient techniques to achieve high performance in multi-core systems where resources are managed at runtime. Most existing algorithms for dynamic task scheduling assume that a task runs on one of multiple cores. This paper presents heuristic algorithms for dynamic scheduling of parallel tasks, to which the number of cores assigned is flexible and decided at runtime. In the experiments, we compared the proposed algorithms with the existing ones.