Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
