By Topic

Job scheduling policy for high throughput computing environments

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
$31 $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

1 Author(s)
Abawajy, J.H. ; Sch. of Comput. Sci., Ottawa, Ont., Canada

In high throughput computing environments, an opportunistic scheduling policy is used for placement of batch jobs on idle workstations for execution. In this paper, we propose a new opportunistic scheduling policy with the aim of exploiting the idle resources provided by systems such as Condor in an opportunistic manner. We compared the performance of the proposed scheduling policy with three policies namely the scheduling policy used in Condor, job rotate and round robin policies through simulation. The results show that the proposed scheduling policy offers substantial performance improvements over the exiting approaches. Furthermore, this improved performance is achieved without loss of throughput and it results in a more interactive nature of the system thus increasing its appeal.

Published in:

Parallel and Distributed Systems, 2002. Proceedings. Ninth International Conference on

Date of Conference:

17-20 Dec. 2002