Task Scheduling Optimization in Heterogeneous Distributed Systems

task scheduling is essential for obtaining high performance in heterogeneous distributed computing systems. Several algorithms are proposed for heterogeneous distributed computing systems. In this paper, a new static scheduling algorithm is proposed called Highest Communicated Path of Task (HCPT) algorithm to efficiently schedule tasks on the heterogeneous distributed computing systems. Our algorithm is based on the list-scheduling technique. The algorithm not only is focused on reducing the makespan, but also provides better performance than the other algorithms in terms of speedup and efficiency. It consists of three phases, level sorting phase, task- prioritizing phase and processor selection phase. From the theoretical analysis of the HCPT algorithm with other algorithms for a Directed A-cyclic Graph (DAG), the better performance is observed.

[1]  Hesham El-Rewini,et al.  Advanced Computer Architecture and Parallel Processing , 2005 .

[2]  Jan Janecek,et al.  A high performance, low complexity algorithm for compile-time task scheduling in heterogeneous systems , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  Tao Yang,et al.  DSC: Scheduling Parallel Tasks on an Unbounded Number of Processors , 1994, IEEE Trans. Parallel Distributed Syst..

[4]  Ishfaq Ahmad,et al.  A New Approach to Scheduling Parallel Programs Using Task Duplication , 1994, 1994 Internatonal Conference on Parallel Processing Vol. 2.

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

[6]  R. Eswari,et al.  Path-Based Heuristic Task Scheduling Algorithm for Heterogeneous Distributed Computing Systems , 2010, 2010 International Conference on Advances in Recent Technologies in Communication and Computing.

[7]  Myeong-Cheol Ko,et al.  CPOC: Effective Static Task Scheduling for Grid Computing , 2005, HPCC.

[8]  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.

[9]  Hesham El-Rewini,et al.  Advanced Computer Architecture and Parallel Processing (Wiley Series on Parallel and Distributed Computing) , 2005 .

[10]  Nawwaf N. Kharma,et al.  A high performance algorithm for static task scheduling in heterogeneous distributed computing systems , 2008, J. Parallel Distributed Comput..

[11]  Hui Cheng,et al.  A High Efficient Task Scheduling Algorithm Based on Heterogeneous Multi-Core Processor , 2010, 2010 2nd International Workshop on Database Technology and Applications.

[12]  Virgílio A. F. Almeida,et al.  Using random task graphs to investigate the potential benefits of heterogeneity in parallel systems , 1992, Proceedings Supercomputing '92.

[13]  Radu Prodan,et al.  Bi-Criteria Scheduling of Scientific Grid Workflows , 2010, IEEE Transactions on Automation Science and Engineering.

[14]  Mervat Mosa,et al.  A New Algorithm for Static Task Scheduling For Heterogeneous Distributed Computing Systems , 2011 .