DocumentCode :
1900252
Title :
A new heuristic for minimizing schedule length in heterogeneous computing systems
Author :
Sirisha, D. ; Kumari, G. Vijaya
Author_Institution :
Dept. of Comput. Sci. & Eng., JNTUH, Hyderabad, India
fYear :
2015
fDate :
5-7 March 2015
Firstpage :
1
Lastpage :
7
Abstract :
Heterogeneous environments includes resources with diverse capabilities necessitates efficient task-to-processor assignment for accomplishing high performance. In the proposed work a new heuristic approach for scheduling the tasks independent of their levels in the precedence constrained task graph is detailed. Schedules with shorter span are achieved by reducing the start time of the independent tasks. The proposed algorithm is compared with the available literature and an improvement in the schedule length is obtained.
Keywords :
graph theory; minimisation; processor scheduling; heterogeneous computing systems; heuristic approach; precedence constrained task graph; schedule length minimization; task scheduling; task-to-processor assignment; heterogeneous computing systems; heuristics; precedence constraint task graph; schedule length; task scheduling;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrical, Computer and Communication Technologies (ICECCT), 2015 IEEE International Conference on
Conference_Location :
Coimbatore
Print_ISBN :
978-1-4799-6084-2
Type :
conf
DOI :
10.1109/ICECCT.2015.7226067
Filename :
7226067
Link To Document :
بازگشت