Gang scheduling with memory considerations
- 7 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A major problem with time slicing on parallel machines is memory pressure, as the resulting paging activity damages the synchronism among a job's processes. An alternative is to impose admission controls, and only admit jobs that fit into the available memory. Despite suffering from delayed execution, this leads to better overall performance by preventing the harmful effects of paging and thrashing.Keywords
This publication has 8 references indexed in Scilit:
- Using multicast to pre-load jobs on the ParPar clusterParallel Computing, 2001
- Fast messages: efficient, portable communication for workstation clusters and MPPsIEEE Concurrency, 1997
- A historical application profiler for use by parallel schedulersPublished by Springer Nature ,1997
- Evaluation of Design Choices for Gang Scheduling Using Distributed Hierarchical ControlJournal of Parallel and Distributed Computing, 1996
- Paging tradeoffs in distributed-shared-memory multiprocessorsThe Journal of Supercomputing, 1996
- Scheduling on the Tera MTAPublished by Springer Nature ,1995
- Distributed hierarchical control for parallel processingComputer, 1990
- On the fractal dimension of computer programs and its application to the prediction of the cache miss ratioIEEE Transactions on Computers, 1989