DocumentCode
2484450
Title
Scheduling resizable parallel applications
Author
Sudarsan, Rajesh ; Ribbens, Calvin J.
Author_Institution
Dept. of Comput. Sci., Virginia Tech, Blacksburg, VA, USA
fYear
2009
fDate
23-29 May 2009
Firstpage
1
Lastpage
10
Abstract
Most conventional parallel job schedulers only support static scheduling thereby restricting schedulers from being able to modify the number of processors allocated to parallel applications at runtime. The drawbacks of static scheduling can be overcome by using scheduling policies that can exploit dynamic resizability in distributed-memory parallel applications and a scheduler that supports these policies. The scheduler must be capable of adding and removing processors from a parallel application at runtime. This ability of a scheduler to resize parallel applications increases the possibilities for parallel schedulers to manage a large cluster. Our ReSHAPE framework includes an application scheduler that supports dynamic resizing of parallel applications. In this paper, we illustrate the impact of dynamic resizability on parallel scheduling. We propose and evaluate new scheduling policies made possible by our ReSHAPE framework. Experimental results show that these scheduling policies significantly improve individual application turn around time as well as overall cluster utilization.
Keywords
distributed memory systems; parallel processing; processor scheduling; ReSHAPE framework; distributed-memory parallel application; dynamic resizability; static scheduling; Application software; Computer science; Contracts; Dynamic scheduling; Job design; Processor scheduling; Quality of service; Resource management; Runtime; Supercomputers;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on
Conference_Location
Rome
ISSN
1530-2075
Print_ISBN
978-1-4244-3751-1
Electronic_ISBN
1530-2075
Type
conf
DOI
10.1109/IPDPS.2009.5161077
Filename
5161077
Link To Document