Design and Analysis of Multi – Heuristic Based Solution for Task Graph Scheduling Problem
Ravreet Kaur1, Gurvinder Singh2
1Ravreet Kaur, Department of Computer Science & Engineering, UIET, Panjab University, Chandigarh, India.
2Gurvinder Singh, Department of Computer Science, Guru Nanak Dev University, Amritsar, India.
Manuscript received on July 20, 2019. | Revised Manuscript received on August 10, 2019. | Manuscript published on August 30, 2019. | PP: 2673-2681 | Volume-8 Issue-6, August 2019. | Retrieval Number: F8680088619/2019©BEIESP | DOI: 10.35940/ijeat.F8680.088619
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Heuristic based strategies have always been of interest for researchers to achieve sub-optimal solutions for various NP-Complete problems. Human evolution based methods have been an inspiration for research since ages. One of the many evolutionary strategies based on the principle of genetic algorithm have been able to provide much sought after sub-optimal solutions for various NP-Complete problems. One of the most sought after NP-Complete problem is Task graph scheduling i.e. optimally execute the schedule of tasks on available parallel and distributed environment so as to achieve efficient utilization of available resources. Task scheduling is a multi-objective combinatorial optimization problem, with key parameters being reduced completion time and effective load balance on the available resources. Various algorithms have been proposed by various authors to achieve the above mentioned goal with the help of various heuristics like list scheduling, task duplication and critical path based. The algorithms proposed by various authors like Highest Level First Execution Time (HLFET), Modified Critical Path (MCP), Duplication Scheduling Heuristic (DSH), Linear Clustering (LC) and Dynamic Critical Path (DCP), belonging to each heuristic mentioned before will be taken under study. Previously these algorithms have been individually reported to be efficient in some certain restricted environment parameters with certain limitations; offering very preliminary improvement on the state of art of one single type of environment. Designers face difficulty in choosing the optimal algorithm for the generalized environment. This paper will identify the gaps in existing literature that forms the base of every research focusing in the direction of improvement of task graph scheduling algorithms. Further, this paper will propose a hybrid meta-heuristic i.e. Genetic Algorithm based task graph scheduling solution and perform a comparative study of aforementioned algorithms.
Keywords: Directed Acyclic Graphs, Task Graph Scheduling, List Scheduling, Task Duplication, Critical Path, Genetic Algorithm.