A high performance, low complexity algorithm for compile-time job scheduling in homogeneous computing environments

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.