Job scheduling on high performance computer systems: Complexity and algorithms

The problem of job scheduling on Partitionable Massively Parallel Processor (PMPP) Systems is studied in this dissertation. The objective of the scheduling problem is to minimize the makespan or the total completion time. Key system features include the following: (1) the number of processors K is large relative to the number of jobs n (K $\ge$ 2n), (2) the processing time of a job depends on the number of processors assigned to it, and (3) unlimited repartitioning of the processors is allowed.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Engineering, Industrial

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Zhang, Yi

Contributors dc:contributor

• Palekar, Udatta S.
• Johnson, M.A.

• Engineering, Industrial
• Operations Research
• Computer Science

Statement dc:rights

• Copyright 1995 Zhang, Yi

Language dc:language

eng

Identifier

AAI9624547
(UMI)AAI9624547

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/23750