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.
Original language | English (US) |
---|---|
Pages (from-to) | 620-626 |
Number of pages | 7 |
Journal | Discrete Applied Mathematics |
Volume | 156 |
Issue number | 5 |
DOIs | |
State | Published - Mar 1 2008 |
Keywords
- Malleable tasks
- Parallel machines
ASJC Scopus subject areas
- Discrete Mathematics and Combinatorics
- Applied Mathematics