Earliest Starting and Finishing time Duplication-based algorithm

Optimal task scheduling of a direct acyclic graph (DAG) onto distributed environments is a NP-hard problem. In this paper, we propose a new scheduling algorithm called Earliest Starting and Finishing time Duplication based (ESFD). ESFD has three phases: priority processing, task scheduling and task duplication. ESFD considers all parameters related to the task and its immediate predecessors to assigning a task. After each schedule ESFD will be updated its first phase, so ESFD is a dynamic algorithm. Experimental results on random graphs and real application graphs show that the NSL and speedups generated by the ESFD are better than those generated by the well-known HCPT, HEFT and LHCNF algorithms.

[1]  Xiao Qin,et al.  An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems , 2008, IEEE Transactions on Computers.

[2]  Dharma P. Agrawal,et al.  Improving scheduling of tasks in a heterogeneous environment , 2004, IEEE Transactions on Parallel and Distributed Systems.

[3]  Tae-Young Choe,et al.  A task duplication based scheduling algorithm with optimality condition in heterogeneous systems , 2002, Proceedings. International Conference on Parallel Processing Workshop.

[4]  Jan Janecek,et al.  A near lower-bound complexity algorithm for compile-time task-scheduling in heterogeneous computing systems , 2004, Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks.

[5]  Behrooz Parhami Introduction to Parallel Processing , 2002, Series in Computer Science.

[6]  Henri Casanova,et al.  Resource allocation strategies for constructive in-network stream processing , 2009, 2009 IEEE International Symposium on Parallel & Distributed Processing.

[7]  Emmanuel Jeannot,et al.  Robust task scheduling in non-deterministic heterogeneous computing systems , 2006, 2006 IEEE International Conference on Cluster Computing.

[8]  Tohru Kikuno,et al.  A new heuristic algorithm based on GAs for multiprocessor scheduling with task duplication , 1997, Proceedings of 3rd International Conference on Algorithms and Architectures for Parallel Processing.

[9]  Po-Jen Chuang,et al.  An efficient optimization technique for task matching and scheduling in heterogeneous computing systems , 2002, Ninth International Conference on Parallel and Distributed Systems, 2002. Proceedings..

[10]  Yang-ping Chen,et al.  A Novel Task Scheduling Algorithm for Real-Time Multiprocessor Systems , 2007, 2007 IEEE International Conference on Control and Automation.

[11]  Salim Hariri,et al.  Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing , 2002, IEEE Trans. Parallel Distributed Syst..

[12]  Arjan J. C. van Gemund,et al.  Fast and effective task scheduling in heterogeneous systems , 2000, Proceedings 9th Heterogeneous Computing Workshop (HCW 2000) (Cat. No.PR00556).

[13]  Henri Casanova,et al.  Scheduling Parallel Task Graphs on (Almost) Homogeneous Multicluster Platforms , 2009, IEEE Transactions on Parallel and Distributed Systems.

[14]  E. Ilavarasan,et al.  Levelized scheduling of directed a-cyclic precedence constrained task graphs onto heterogeneous computing system , 2005, First International Conference on Distributed Frameworks for Multimedia Applications.

[15]  Jan Janecek,et al.  A simple scheduling heuristic for heterogeneous computing environments , 2003, Second International Symposium on Parallel and Distributed Computing, 2003. Proceedings..

[16]  Luiz Satoru Ochi,et al.  Hybrid evolutionary static scheduling for heterogeneous systems , 2005, 2005 IEEE Congress on Evolutionary Computation.

[17]  Frode Eika Sandnes,et al.  Toward a realistic task scheduling model , 2006, IEEE Transactions on Parallel and Distributed Systems.

[18]  Behrooz Parhami,et al.  Introduction to Parallel Processing: Algorithms and Architectures , 1999 .

[19]  Jan Janecek,et al.  A static task scheduling heuristic for homogeneous computing environments , 2004, 12th Euromicro Conference on Parallel, Distributed and Network-Based Processing, 2004. Proceedings..