loading...
Parallel Job Scheduling on Multicluster Computing Systems
Hong Kong December 01-December 04
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CLUSTR.2003.1253294Fifth IEEE International Conference o ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
J. H. Abawajy, Carleton University
S. P. Dandamudi, Carleton University
Cluster computing has come to prominence as a cost-effective parallel processing tool for solving many complex computational problems. The key to making cluster computing work well is the middleware technologies that can manage the policies, protocols, networks, and job scheduling across the interconnected set of computing resources. The research question addressed in this paper is the on-line job scheduling problem for multi-cluster systems. To this end, we propose an on-line dynamic scheduling policy that manages multiple job streams across both single and multiple cluster computing systems with the objectives of improving the mean response time and system utilization. The performance of the proposed scheduling policy is compared against a space-sharing policy and a time-sharing policy. The results of the experiments show that the proposed policy produces signi.cantly better response times than the other two policies.
Citation:
J. H. Abawajy, S. P. Dandamudi, "Parallel Job Scheduling on Multicluster Computing Systems," cluster, pp.11, Fifth IEEE International Conference on Cluster Computing (CLUSTER'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.