Scheduling Parallel Tasks to Minimize Average Response Time

Abstract

optimal solution [l, 2, 3, 41. Consider a system of independent tasks which are to be scheduled without preemption on a parallel computer. For each task both the number of processors required and the corresponding execution time are known. The problem of finding a schedule with minimum makespan has been extensively studied in the literature. In this paper… (More)

Topics

10 Figures and Tables

Cite this paper

@inproceedings{Turek1994SchedulingPT, title={Scheduling Parallel Tasks to Minimize Average Response Time}, author={John Turek and Uwe Schwiegelshohn and Joel L. Wolf and Philip S. Yu}, booktitle={SODA}, year={1994} }