Abstract
The task scheduling problem in heterogeneous distributed computing systems is a multiobjective optimization problem (MOP). In heterogeneous distributed computing systems (HDCS), there is a possibility of processor and network failures and this affects the applications running on the HDCS. To reduce the impact of failures on an application running on HDCS, scheduling algorithms must be devised which minimize not only the schedule length (makespan) but also the failure probability of the application (reliability). These objectives are conflicting and it is not possible to minimize both objectives at the same time. Thus, it is needed to develop scheduling algorithms which account both for schedule length and the failure probability. Multiobjective Evolutionary Computation algorithms (MOEAs) are well-suited for Multiobjective task scheduling on heterogeneous environment. The two Multi-Objective Evolutionary Algorithms such as Multiobjective Genetic Algorithm (MOGA) and Multiobjective Evolutionary Programming (MOEP) with non-dominated sorting are developed and compared for the various random task graphs and also for a real-time numerical application graph. The metrics for evaluating the convergence and diversity of the obtained non-dominated solutions by the two algorithms are reported. The simulation results confirm that the proposed algorithms can be used for solving the task scheduling at reduced computational times compared to the weighted-sum based biobjective algorithm in the literature.
This is a preview of subscription content, log in via an institution to check access.
References
Ahmad I, Kwok Y 1994 A new approach to scheduling parallel programs using task duplication. Proc. Int. Conf. Parallel Processing 2: 47–51
Braun T, et al 2001 A comparison of study of static mapping heuristics for a class of meta-tasks on heterogeneous computing systems. J. Parallel and Distributed Computing 61(6): 810–837
Chang Y, Ranka S 1992 Applications and performance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory multiprocessors. Proc. Supercomputing 512–521
Chitra P, Venkatesh P 2010 Multiobjective evolutionary computation algorithms for solving task scheduling problem on heterogeneous systems. Int. J. Knowledge-based and Intelligent Eng. Systems 14(1): 21–30
Deb F K 2001 Multi-objective optimization using evolutionary algorithms, New York: Wiley
Dogan A, Ozguner F 2002 Matching and scheduling algorithms for minimizing execution time and failure probability of applications in heterogenous computing. IEEE Trans. Parallel Distributed Systems 13(3): 308–323
Dogan A, Ozguner F 2005 Biobjective scheduling algorithms for execution time-reliability trade-off in heterogenous computing systems. The Computer Journal 48(3): 300–314
Dongarra J J, Jeannot E, Saule E, Shi Z 2007 Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. Proc. of the Nineteenth Annual ACM Symposium on Parallel Algorithms and Architectures 280–288
Fogel D B, Fogel L J 1996 Using evolutionary programming to schedule tasks on a suite of heterogeneous Computers. Computers and Operation Res. 23(6): 527–534
Freund R F, Siegel H J 1993 Heterogeneous processing. IEEE Computer 26(6): 13–17
Gary M R, Johnson D S 1979 Computers and intractability: A guide to the theory of NP-completeness. San Francisco: W.H. Freeman and Co
Girault A, Saule E, Trystram D 2009 Reliability versus performance for critical applications. J. Parallel and Distributed Computing 69(3): 326–336
Hou E S H, Ansari N, Ren H 1994 A genetic algorithm for multiprocessor scheduling. IEEE Trans. on Parallel Distributed Systems 5(2): 113–120
Kwok Y K, Ahmad I 1996 Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Trans. Parallel and Distributed Systems 7(5): 506–521
Kwok Y K, Ahmad I 1999 Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR) 31(4): 406–471
Qin X, Jiang H 2006 A novel fault-tolerant scheduling algorithm for precedence constraint tasks in real time heterogeneous systems. J. Parallel Computing 32: 331–356
Rewini-El H, Lewis T G 1990 Scheduling parallel program tasks onto arbitrary target machines. J. Parallel and Distributed Computing 9: 138–153
Shroff P, Watson D W, Flann N S, Freund R 1996 Genetic simulated annealing for scheduling data dependent tasks in heterogeneous environments. Proc. Heterogeneous Computing Workshop 98–104
Singh H, Youssef A 1996 Mapping and Scheduling Heterogeneous Task Graphs Using Genetic Algorithms. Proc. Heterogeneous Computing Workshop, pp. 86–97
Topcuoglu H, Hariri S, Wu M-Y 2002 Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. on Parallel and Distributed Systems 13(3): 260–274
Wang L et al 1997 A genetic-algorithm-based approach for task matching and scheduling in heterogeneous computing environments. J. Parallel and Distributed Computing 47(1): 8–22
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
CHITRA, P., VENKATESH, P. & RAJARAM, R. Comparison of evolutionary computation algorithms for solving bi-objective task scheduling problem on heterogeneous distributed computing systems. Sadhana 36, 167–180 (2011). https://doi.org/10.1007/s12046-011-0014-8
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12046-011-0014-8