Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/TPDS.2003.1206505 | Parallel and Distributed Systems, IEEE Transactions |
Keywords | Field | DocType |
paired gang scheduling,heavy use,o-intensive gang,gang scheduling,conventional gang scheduling,flexible resource management,light use,job mix,local scheduler,own gang,minor degradation,communication activity,better utilization,overall improvement,resource management,degradation,resource allocation,out of order,system performance,resource manager | Fixed-priority pre-emptive scheduling,Fair-share scheduling,Computer science,Gang scheduling,Two-level scheduling,Real-time computing,Resource allocation,Rate-monotonic scheduling,Dynamic priority scheduling,Stride scheduling,Distributed computing | Journal |
Volume | Issue | ISSN |
14 | 6 | 1045-9219 |
Citations | PageRank | References |
85 | 3.92 | 20 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yair Wiseman | 1 | 158 | 14.60 |
| Dror G. Feitelson | 2 | 3997 | 381.74 |