Abstract | ||
---|---|---|
Gang scheduling is a resource management scheme for paralleland distributed systems that combines time-sharing withspace-sharing to ensure short response times for interactivetasks and high overall system throughput. In this paper, wepresent and analyze a queueing theoretic model for a generalgang scheduling scheme that forms the basis of a multiprogrammingenvironment currently being developed for IBM'sSP2 parallel system and for clusters of workstations. Ourmodel and analysis can be... |
Year | DOI | Venue |
---|---|---|
1996 | 10.1145/237502.237511 | SPAA |
Keywords | Field | DocType |
multiprogrammed parallel computing environment,gang scheduling,resource manager,time sharing,distributed system,parallel systems,parallel computer | Fair-share scheduling,Computer science,Parallel computing,Gang scheduling,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-89791-809-6 | 11 | 1.82 |
References | Authors | |
10 | 3 |
Name | Order | Citations | PageRank |
---|---|---|---|
Mark S. Squillante | 1 | 1366 | 157.28 |
Fang Wang | 2 | 80 | 8.90 |
Marios Papaefthymiou | 3 | 749 | 74.79 |