| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 420646 | Discrete Applied Mathematics | 2008 | 7 Pages |
Abstract
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.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Edmund K. Burke, Moshe Dror, James B. Orlin,