By Topic

Co-scheduling of parallel jobs in clusters

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

2 Author(s)
Madheswari, A.N. ; Anna Univ., Coimbatore, India ; Banu, R.S.D.W.

Co-scheduling of parallel jobs in the chips is well-known to produce benefits in both system and individual job efficiency. The existing works have shown that job co-scheduling can effectively improve the contention, yet the question on the determination of optimal co-schedules still remains unanswered. The need for co-scheduling has been typically associated with communication bandwidth and the memory. In our work we have proposed a novel scheduling algorithm for optimal co-scheduling of parallel jobs. This algorithm facilitates the scheduling of parallel jobs using bandwidth and memory concepts. The co-scheduling of the processes in the chips using the proposed algorithm shows satisfactory improvement in performance of running the parallel jobs.

Published in:

Computer Science and Information Technology, 2009. ICCSIT 2009. 2nd IEEE International Conference on

Date of Conference:

8-11 Aug. 2009