A Novel Task Scheduling Algorithm for Heterogeneous Computing | Zendy

Vinay Kumar | Zendy; C. P. Katti | Zendy; Prateek Saxena | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Novel Task Scheduling Algorithm for Heterogeneous Computing

Author(s) -

Vinay Kumar,

C. P. Katti,

Prateek Saxena

Publication year - 2014

Publication title -

international journal of computer applications

Language(s) - English

Resource type - Journals

ISSN - 0975-8887

DOI - 10.5120/14944-3452

Subject(s) - computer science , grid computing , distributed computing , symmetric multiprocessor system , grid , scheduling (production processes) , parallel computing , minification , fair share scheduling , algorithm , mathematical optimization , operating system , schedule , geometry , programming language , mathematics

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. General Terms Distributed Computing, Heterogeneous Computing, Grid Computing.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research