Scheduling malleable tasks for mean ow time criterion M.Caramia

In this paper we study scheduling malleable tasks with limited par-allelism, for mean ow time criterion. Malleable tasks may use more than one processor at the same time, and the number of processors used may change over time. The maximum number of processors that can be used by some task is limited. We examine the computational complexity of this problem, and present polynomially solvable cases