Impact of Job Mix on Optimizations for Space Sharing Schedulers

@article{Subhlok1996ImpactOJ,
  title={Impact of Job Mix on Optimizations for Space Sharing Schedulers},
  author={Jaspal Subhlok and Thomas R. Gross and Takashi Suzuoka},
  journal={Proceedings of the 1996 ACM/IEEE Conference on Supercomputing},
  year={1996},
  pages={54-54}
}
This paper addresses job scheduling for parallel supercomputers. Modern parallel systems with n nodes can be used by jobs requesting up to n nodes. If less than n nodes are requested, multiple jobs can be run at the same time, allowing several users to use the system. One of the challenges for the operating system is to give reasonable service to a diverse group of requests. A single 1-node job that is running for a long time may effectively block the whole machine if the next job requests all… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 23 extracted citations

Quiet Neighborhoods: Key to Protect Job Performance Predictability

2015 IEEE International Parallel and Distributed Processing Symposium • 2015
View 4 Excerpts
Highly Influenced

Time-Sharing Parallel Applications with Performance Isolation and Control

Fourth International Conference on Autonomic Computing (ICAC'07) • 2007
View 1 Excerpt

Computation-at-risk: assessing job portfolio management risk on clusters

18th International Parallel and Distributed Processing Symposium, 2004. Proceedings. • 2004

Similar Papers

Loading similar papers…