A Novel Task Scheduling Algorithm for Heterogeneous Computing

Provided by: International Journal of Computer Applications
Topic: Cloud
Format: PDF
The grid computing system can support the execution of computationally intensive parallel and distributive applications. The main characteristics of grid computing and heterogeneous computing system are similar. A novel scheduling algorithm, called NHEFT is proposed in this paper to enhance the functions of Heterogeneous Earliest-Finish Time (HEFT) algorithm. The NHEFT algorithm works for a bounded number of heterogeneous processors, the main objective of NHEFT is getting high performance and fast scheduling. The algorithm selects the tasks with a rank system at each step of execution of algorithm, which minimize earliest finish time with the minimization of cost.

Find By Topic