DMCA
Paired Gang Scheduling (2003)
Cached
Download Links
| Venue: | IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS |
| Citations: | 52 - 14 self |
BibTeX
@ARTICLE{Wiseman03pairedgang,
author = {Yair Wiseman and Dror G. Feitelson},
title = {Paired Gang Scheduling},
journal = {IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS},
year = {2003},
volume = {14},
number = {6},
pages = {581--592}
}
Share
 |
 |
 |
 |
||
OpenURL
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 I/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.
