By Topic

A high performance, low complexity algorithm for compile-time job scheduling in homogeneous 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
$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)
T. Hagras ; Dept. of Comput. Sci. & Eng., Czech Tech. Univ., Prague, Czech Republic ; J. Janecek

Efficient job scheduling is one of the most important and difficult issues in homogeneous computing environments. List-scheduling is generally accepted as an attractive static approach, since it pairs low complexity with good results. This paper presents a static list-scheduling algorithm with a limited number of processors. The algorithm is called critical nodes parent trees (CNPT). The aim of the algorithm is to give results comparable to or better than the current algorithms, and to achieve very low complexity. The experimental work has shown that the suggested algorithm gave comparable results in a low complexity.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003