Abstract
We study the problem of scheduling a set of n independent multiprocessor tasks with prespecified processor allocations on a fixed number of processors. We propose a linear time algorithm that finds a schedule of minimum makespan in the preemptive model, and a linear time approximation algorithm that finds a schedule of length within a factor of (1 + ɛ) of optimal in the non-preemptive model.
Cite
CITATION STYLE
Amoura, A. K., Bampis, E., Kenyon, C., & Manoussakis, Y. (1997). Scheduling independent multiprocessor tasks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1284, pp. 1–12). Springer Verlag. https://doi.org/10.1007/3-540-63397-9_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
