BibTeX
@MISC{Turner95processorscheduling,
author = {Stephen W. Turner},
title = {Processor Scheduling In A Distributed-Memory Computing Environment},
year = {1995}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In recent years, the development of large-scale distributed-memory computers has given the user community unprecedented levels of computing power. In order to effectively use the available computing power, processor scheduling algorithms have been developed that allow many users to share distributed computing resources while obtaining the best possible job turnaround time. However, not all existing scheduling techniques take full advantage of available computing power. For example, in hypercubes, a cluster must normally be allocated as an entire subcube, which can result in high internal fragmentation, as well as poor job performance. Although the distributed workstation environment has recently become popular as a choice for a distributed-memory parallel computer, the problem of scheduling specifically for parallel job execution has not been well studied in this environment. In this thesis, we pr...
Keyphrases
processor scheduling distributed-memory computing environment possible job turnaround time entire subcube recent year user community unprecedented level many user poor job performance distributed workstation environment large-scale distributed-memory computer parallel job execution distributed-memory parallel computer high internal fragmentation full advantage
