The space of job schedulers for parallel supercomputers is rather fragmented, because different researchers tend to make different assumptions about the goals of the scheduler, the information that is available about the workload, and the operations that the scheduler may perform. We argue that by identifying these assumptions explicitly, it is possible to reach a level of convergence. For example, it is possible to unite most of the different assumptions into a common framework by associating a suitable cost function with the execution of each job. The cost function reflects knowledge about the job and the degree to which it fits the goals of the system. Given such cost functions, scheduling is done to maximize the system's profit.
|Original language||American English|
|Title of host publication||Job Scheduling Strategies for Parallel Processing - IPPS 1996 Workshop, Proceedings|
|Editors||Dror G. Feitelson, Larry Rudolph|
|Number of pages||26|
|ISBN (Print)||3540618643, 9783540618645|
|State||Published - 1996|
|Event||2nd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1996 - Honolulu, United States|
Duration: 16 Apr 1996 → 16 Apr 1996
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||2nd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1996|
|Period||16/04/96 → 16/04/96|
Bibliographical notePublisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.