A Survey on ANN Based Task Scheduling Strategies in Heterogeneous Distributed Computing Systems

Abstract

Heterogeneous Distributed Computing Systems (HeDCS) efficiently utilize the heterogeneity of diverse computational resources which are interlinked through high speed networks for executing a group of computing intensive applications. Directed acyclic graphs (DAGs) are usually used to represent these parallel applications with varied computational requirements and constraints. The optimal scheduling of the given set of precedence constrained tasks to available resources is a core concern in HeDCS and is known to be NP Complete problem. Non deterministic nature of application programs and heterogeneous environment are the main challenges in designing, implementing and analyzing phases of task scheduling techniques. A myriad of heuristic and meta-heuristic approaches have been proposed in the literature to solve this complex problem. The basic purpose of this study is to cover ANN based task scheduling strategies in the distributed computing environment perspective. Further existing scheduling heuristics could be classified in a new state of art classification including the description of frequently used parameters in the mentioned scheduling strategies. The flexible and powerful nature of ANN for identifying the data patterns, underlying time and other constraints and learning capabilities have shown to be a promising candidate among other heuristics.

Nepal Journal of Science and Technology Vol. 16, No.1 (2015) pp. 69-78