doi: 10.7763/IJIET.2011.V1.60
A Level-wise Priority Based Task Scheduling for Heterogeneous Systems
R. Eswari
,
S. Nickolas
Abstract
Achieving high performance without proper scheduling of application tasks is impossible in a heterogeneous environment. To solve such an issue, in this paper, a new static scheduling algorithm is proposed called expected completion time based scheduling (ECTS) algorithm, which is used to effectively schedule application tasks on to the heterogeneous processors. The ECTS algorithm finds the task sequence for execution by assigning priority and then maps the selected task sequence on to the processors. In order to give the comparison of proposed algorithm over the existing algorithms, a real Fast Fourier application graphs are considered as experimental test case. The results show the effectiveness of the proposed algorithm to those presented previously. The algorithm is mainly focused on producing minimum makespan.
Keywords
- Directed acyclic graph
- heterogeneous distributed systems
- heuristic algorithm
- static task scheduling
How to Cite
R. Eswari and S. Nickolas, "A Level-wise Priority Based Task Scheduling for Heterogeneous Systems," International Journal of Information and Education Technology, vol. 1, no. 5, pp. 371-376, 2011. https://doi.org/10.7763/IJIET.2011.V1.60
Copyright & License
Copyright © 2011 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).