Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 0992.90030
Schwiegelshohn, Uwe; Yahyapour, Ramin
Fairness in parallel job scheduling. (English)
[J] J. Sched. 3, No.5, 297-320 (2000). ISSN 1094-6136; ISSN 1099-1425/e

Summary: This paper introduces a new preemptive algorithm that is well suited for fair on-line scheduling of parallel jobs. Fairness is achieved by selecting job weights to be equal to the resource consumption of the job and by limiting the time span a job can be delayed by other jobs submitted after it. Further, the processing time of a job is not known when the job is released. It is proven that the algorithm achieves a constant competitive ratio for both the makespan and the weighted completion time for the given weight selection. Finally, the algorithm is also experimentally evaluated with the help of workload traces.

MSC 2000:: *90B35 Scheduling theory

Keywords: competitive factors; makespan criterion; weighted completion time criterion; fair on-line scheduling

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]