Loading...
Please wait, while we are loading the content...
A Novel Task Scheduling Algorithm for Heterogeneous Computing
| Content Provider | Semantic Scholar |
|---|---|
| Author | Kumar, V. Vasanth Katti, C. P. Saxena, P. C. |
| Copyright Year | 2014 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://www.ijcaonline.org/archives/volume85/number18/14944-3452?format=pdf |
| Alternate Webpage(s) | http://www.ijcaonline.org/archives/volume85/number18/14944-3452?format=pdf |
| Alternate Webpage(s) | http://research.ijcaonline.org/volume85/number18/pxc3893452.pdf |
| Language | English |
| Access Restriction | Open |
| Subject Keyword | Algorithm Central processing unit Computation (action) Genetic Heterogeneity Grid computing Heterogeneous Earliest Finish Time Heterogeneous computing Scheduling (computing) Scheduling - HL7 Publishing Domain System call |
| Content Type | Text |
| Resource Type | Article |
