By Topic

Parallel job scheduling on multicluster computing system

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. H. Abawajy ; Sch. of Comput. Sci., Carleton Univ., Ottawa, Ont., Canada ; S. P. Dandamudi

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 significantly better response times than the other two policies.

Published in:

Cluster Computing, 2003. Proceedings. 2003 IEEE International Conference on

Date of Conference:

1-4 Dec. 2003