A Non-critical Path Earliest-Finish Algorithm for Inter-dependent Tasks in Heterogeneous Computing Environments

In recent years, many researchers have proposed several algorithms to schedule critical tasks in a homogeneous multiprocessor system for obtaining a shorter scheduling length. However, for heterogeneous computing systems, such methods may lead to lengthen the execution of other non-critical tasks. In this paper, a Non-critical Path Earliest-Finish (NPEF) scheduling algorithm for heterogeneous computing systems has been proposed to eliminate the problem mentioned above. From the experimental results, the proposed method is proven to be an effective scheduling scheme in heterogeneous computing environments.