Abstract
The addition of time-slicing to space-shared gang scheduling improves the average response time of the jobs in a typical job stream. Recent research has shown that time-slicing is most effective when the jobs admitted for execution fit entirely into physical memory. The question is, how to select and map jobs to make the best use of the available physical memory. Specifically, the achievable degree of multi-programming is limited by the memory requirements, or physical memory pressure, of the admitted jobs. We investigate two techniques for improving the performance of gang scheduling in the presence of memory pressure: 1) a novel backfill approach which improves memory utilization, and 2) an adaptive multi-programming level which balances processor/memory utilization with job response time performance. Our simulations show that these techniques reduce the average wait time and slow-down performance metrics over naive first-come-first-serve methods on a distributed memory parallel system.
Original language | English (US) |
---|---|
Title of host publication | Euro-Par 2000 Parallel Processing - 6th International Euro-Par Conference, Proceedings |
Editors | Arndt Bode, Thomas Ludwig, Wolfgang Karl, Roland Wismüller |
Publisher | Springer Verlag |
Pages | 252-261 |
Number of pages | 10 |
ISBN (Electronic) | 9783540679561 |
DOIs | |
State | Published - 2000 |
Event | 6th International European Conference on Parallel Computing, Euro-Par 2000 - Munich, Germany Duration: Aug 29 2000 → Sep 1 2000 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 1900 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 6th International European Conference on Parallel Computing, Euro-Par 2000 |
---|---|
Country/Territory | Germany |
City | Munich |
Period | 8/29/00 → 9/1/00 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.