Packing schemes for gang scheduling

Dror G. Feitelson*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

158 Scopus citations

Abstract

Jobs that do not require all processors in the system can be packed together for gang scheduling. We examine accounting traces from several parallel computers to show that indeed many jobs have small sizes and can be packed together. We then formulate a number of such packing algorithms, and evaluate their effectiveness using simulations based on our workload study. The results are that two algorithms are the best: either perform the mapping based on a buddy system of processors, or use migration to re-map the jobs more tightly whenever a job arrives or terminates. Other approaches, such as mapping to the least loaded PEs, proved to be counterproductive. The buddy system approach depends on the capability to gang-schedule jobs in multiple slots, if there is space. The migration algorithm is more robust, but is expected to suffer greatly due to the overhead of the migration itself. In either case fragmentation is not an issue, and utilization may top 90% with sufficiently high loads.

Original languageAmerican English
Title of host publicationJob Scheduling Strategies for Parallel Processing - IPPS 1996 Workshop, Proceedings
EditorsDror G. Feitelson, Larry Rudolph
PublisherSpringer Verlag
Pages89-110
Number of pages22
ISBN (Print)3540618643, 9783540618645
DOIs
StatePublished - 1996
Event2nd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1996 - Honolulu, United States
Duration: 16 Apr 199616 Apr 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1162
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1996
Country/TerritoryUnited States
CityHonolulu
Period16/04/9616/04/96

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1996.

Fingerprint

Dive into the research topics of 'Packing schemes for gang scheduling'. Together they form a unique fingerprint.

Cite this