Paired gang scheduling

Yair Wiseman; Dror G. Feitelson

doi:10.1109/TPDS.2003.1206505

Paired gang scheduling

Yair Wiseman^*
, Dror G. Feitelson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

126 Scopus citations

Abstract

Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As l/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.

Original language	English
Pages (from-to)	581-592
Number of pages	12
Journal	IEEE Transactions on Parallel and Distributed Systems
Volume	14
Issue number	6
DOIs	https://doi.org/10.1109/TPDS.2003.1206505
State	Published - Jun 2003

Bibliographical note

Funding Information:
A preliminary version of this paper appeared in the 2001 Jerusalem Parallel Distributed Programming Symposium. Yair Wiseman was supported by a Lady Davis Fellowship. The ParPar cluster was supported by the Israel Science Foundation.

Keywords

Flexible resource management
Gang scheduling
Job mix

Access to Document

10.1109/TPDS.2003.1206505

Cite this

@article{6d57a2ee8cd3498fbddc98ba92f33bc4,

title = "Paired gang scheduling",

abstract = "Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As l/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.",

keywords = "Flexible resource management, Gang scheduling, Job mix",

author = "Yair Wiseman and Feitelson, \{Dror G.\}",

note = "Funding Information: A preliminary version of this paper appeared in the 2001 Jerusalem Parallel Distributed Programming Symposium. Yair Wiseman was supported by a Lady Davis Fellowship. The ParPar cluster was supported by the Israel Science Foundation.",

year = "2003",

month = jun,

doi = "10.1109/TPDS.2003.1206505",

language = "אנגלית",

volume = "14",

pages = "581--592",

journal = "IEEE Transactions on Parallel and Distributed Systems",

issn = "1045-9219",

publisher = "IEEE Computer Society",

number = "6",

}

TY - JOUR

T1 - Paired gang scheduling

AU - Wiseman, Yair

AU - Feitelson, Dror G.

N1 - Funding Information: A preliminary version of this paper appeared in the 2001 Jerusalem Parallel Distributed Programming Symposium. Yair Wiseman was supported by a Lady Davis Fellowship. The ParPar cluster was supported by the Israel Science Foundation.

PY - 2003/6

Y1 - 2003/6

N2 - Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As l/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.

AB - Conventional gang scheduling has the disadvantage that when processes perform I/O or blocking communication, their processors remain idle because alternative processes cannot be run independently of their own gangs. To alleviate this problem, we suggest a slight relaxation of this rule: match gangs that make heavy use of the CPU with gangs that make light use of the CPU (presumably due to I/O or communication activity), and schedule such pairs together, allowing the local scheduler on each node to select either of the two processes at any instant. As l/O-intensive gangs make light use of the CPU, this only causes a minor degradation in the service to compute-bound jobs. This degradation is more than offset by the overall improvement in system performance due to the better utilization of the resources.

KW - Flexible resource management

KW - Gang scheduling

KW - Job mix

UR - https://www.scopus.com/pages/publications/0042850376

U2 - 10.1109/TPDS.2003.1206505

DO - 10.1109/TPDS.2003.1206505

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0042850376

SN - 1045-9219

VL - 14

SP - 581

EP - 592

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

IS - 6

ER -

Paired gang scheduling

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this