Scheduling malleable tasks with interdependent processing rates: Comments and observations

In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation for a number of results for cases with convex and concave processing speed functions. The contribution of this paper is a new unified view of results described in several recent papers. We briefly discuss the implications of our observations on this important family of scheduling problems.

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Edmund K. Burke, Moshe Dror, James B. Orlin
• Keywords: DAM 2008, Paper, Short Paper, Simple Complexity Interpretation