Hybrid Heuristics for Mapping Task Problem on Large Scale Heterogeneous Platforms

Task allocation problem is one of most studied topic in the field of parallel computing. With the emergence of the large scale platforms, scheduling applications on these large heterogeneous parallel systems is a challenging task due to the large number of mapping possibilities. Indeed, different methods to compute the weights of nodes and edges when scheduling directed acyclic graphs onto heterogeneous platforms may lead to significant variations in the generated schedule, in other terms the problem is ill posed. In this work, a new task mapping using a hybrid clustering method based on a branch and bound is proposed to regularize the problem. The obtained results show that the proposed formulation allows to provide a robust solution in most cases.

[1]  Claude E. Shannon,et al.  The Mathematical Theory of Communication , 1950 .

[2]  Philip S. Yu,et al.  Approximate algorithms scheduling parallelizable tasks , 1992, SPAA '92.

[3]  James C. Browne,et al.  General approach to mapping of parallel computations upon multiprocessor architectures , 1988 .

[4]  David M. Nicol,et al.  Optimal Processor Assignment for a Class of Pipelined Computations , 1994, IEEE Trans. Parallel Distributed Syst..

[5]  Frédéric Suter.  Scheduling Delta-Critical Tasks in mixed-parallel applications on a national grid , 2007, GRID.

[6]  Celso C. Ribeiro,et al.  Performance evaluation of a parallel tabu search task scheduling algorithm , 2000, Parallel Comput..

[7]  Arjan J. C. van Gemund,et al.  A low-cost approach towards mixed task and data parallel scheduling , 2001, International Conference on Parallel Processing, 2001..

[8]  Henri Casanova,et al.  A Comparison of Scheduling Approaches for Mixed-Parallel Applications on Heterogeneous Platforms , 2007, Sixth International Symposium on Parallel and Distributed Computing (ISPDC'07).

[9]  Jacek Blazewicz,et al.  Scheduling Malleable Tasks on Parallel Processors to Minimize the Makespan , 2004, Ann. Oper. Res..

[10]  Klaus Jansen,et al.  An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints , 2005, ISAAC.

[11]  Celso C. Ribeiro,et al.  Parallel tabu search message-passing synchronous strategies for task scheduling under precedence constraints , 1996, J. Heuristics.

[12]  Gudula Rünger,et al.  Layer-Based Scheduling of Parallel Tasks for Heterogeneous Cluster Platforms , 2013, ICA3PP.

[13]  Jorge G. Barbosa,et al.  Static scheduling of dependent parallel tasks on heterogeneous clusters , 2005, 2005 IEEE International Conference on Cluster Computing.

[14]  C. Ribeiro,et al.  A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints , 1995, Int. J. High Speed Comput..

[15]  Ronald L. Graham,et al.  Bounds on Multiprocessing Timing Anomalies , 1969, SIAM Journal of Applied Mathematics.

[16]  Jaspal Subhlok,et al.  Optimal latency-throughput tradeoffs for data parallel pipelines , 1996, SPAA '96.

[17]  G. N. Srinivasa Prasanna,et al.  Generalised multiprocessor scheduling using optimal control , 1991, SPAA '91.

[18]  Frédéric Suter,et al.  One-step algorithm for mixed data and task parallel scheduling without data replication , 2003, Proceedings International Parallel and Distributed Processing Symposium.

[19]  RENAUD LEPÈRE,et al.  Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints , 2001, Int. J. Found. Comput. Sci..

[20]  Ranjit Biswas,et al.  Comparative analysis of heuristics for multiprocessor task schedulingproblem with homogeneous processors , 2014 .

[21]  Sang Joon Kim,et al.  A Mathematical Theory of Communication , 2006 .

[22]  Joel H. Saltz,et al.  An Integrated Approach to Locality-Conscious Processor Allocation and Scheduling of Mixed-Parallel Applications , 2009, IEEE Transactions on Parallel and Distributed Systems.

[23]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[24]  Behrooz Shirazi,et al.  Comparative study of task duplication static scheduling versus clustering and non-clustering techniques , 1995, Concurr. Pract. Exp..

[25]  Cheng Wang,et al.  Computation offloading to save energy on handheld devices: a partition scheme , 2001, CASES '01.

[26]  Gen-Huey Chen,et al.  A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[27]  Han Hoogeveen,et al.  Complexity of Scheduling Multiprocessor Tasks with Prespecified Processor Allocations , 1994, Discret. Appl. Math..

[28]  F. Suter.  Scheduling Δ-Critical Tasks in mixed-parallel applications on a national grid , 2007, 2007 8th IEEE/ACM International Conference on Grid Computing.

[29]  G. Amdhal,et al.  Validity of the single processor approach to achieving large scale computing capabilities , 1967, AFIPS '67 (Spring).

[30]  Keqin Li,et al.  Scheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme , 2005, J. Inf. Sci. Eng..

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