A Hybrid ILP-CP Model for Mapping Directed Acyclic Task Graphs to Multicore Architectures

Directed Acyclic Task Graphs serve as typical kernel representation for embedded applications. Modern embedded multicore architectures raise new challenges for efficient mapping and scheduling of task DAGs providing a large number of heterogeneous resources. In this paper, a hybrid Integer Linear Programming - Constraint Programming method that uses the Benders decomposition is used to find proven optimal solutions. The proposed method is augmented with cuts generation schemes for accelerating the solution process. Experimental results show that the proposed method systematically outperforms an ILP-based solution method.

[1]  Emmanuel Jeannot,et al.  Comparative Evaluation Of The Robustness Of DAG Scheduling Heuristics , 2008, CoreGRID Integration Workshop.

[2]  Luca Benini,et al.  A Fast and Accurate Technique for Mapping Parallel Applications on Stream-Oriented MPSoC Platforms with Communication Awareness , 2007, International Journal of Parallel Programming.

[3]  J. Hooker,et al.  Logic-based Benders decomposition , 2003 .

[4]  Rizos Sakellariou,et al.  DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm , 2010, 2010 18th Euromicro Conference on Parallel, Distributed and Network-based Processing.

[5]  Luca Benini,et al.  Optimal resource allocation and scheduling for the CELL BE platform , 2011, Ann. Oper. Res..

[6]  Dimitrios Kritharidis,et al.  Compiling Scilab to high performance embedded multicore systems , 2013, Microprocess. Microsystems.

[7]  Vikas Kumar,et al.  Task Scheduling in Multiprocessor System Using Genetic Algorithm , 2010, 2010 Second International Conference on Machine Learning and Computing.

[8]  Pascal Van Hentenryck,et al.  Hybrid optimization : the ten years of CPAIOR , 2011 .

[9]  Celso C. Ribeiro,et al.  Multiprocessor scheduling under precedence constraints: Polyhedral results , 2006, Discret. Appl. Math..

[10]  John N. Hooker,et al.  Planning and Scheduling by Logic-Based Benders Decomposition , 2007, Oper. Res..

[11]  Christos T. Maravelias,et al.  A decomposition framework for the scheduling of single- and multi-stage processes , 2006, Comput. Chem. Eng..

[12]  Krzysztof Kuchcinski,et al.  Constraints-driven scheduling and resource assignment , 2003, TODE.

[13]  P. Chitra,et al.  Modified genetic algorithm for multiobjective task scheduling on heterogeneous computing system , 2011, Int. J. Inf. Technol. Commun. Convergence.

[14]  John N. Hooker,et al.  Integrated methods for optimization , 2011, International series in operations research and management science.

[15]  Ishfaq Ahmad,et al.  On Exploiting Task Duplication in Parallel Program Scheduling , 1998, IEEE Trans. Parallel Distributed Syst..

[16]  Laurence A. Wolsey,et al.  Integer Programming and Constraint Programming in Solving a Multi-Machine Assignment Scheduling Problem With Deadlines and Release Dates , 2003, INFORMS J. Comput..

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

[18]  Toby Walsh,et al.  Handbook of Constraint Programming , 2006, Handbook of Constraint Programming.

[19]  Dharma P. Agrawal,et al.  A task duplication based scheduling algorithm for heterogeneous systems , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[20]  David Laiymani,et al.  Task scheduling for dynamically reconfigurable parallel machines , 1997, PDP.

[21]  Xiaobo Sharon Hu,et al.  Temperature-Aware Scheduling and Assignment for Hard Real-Time Applications on MPSoCs , 2011, IEEE Trans. Very Large Scale Integr. Syst..

[22]  George Theodoridis,et al.  An integer linear programming model for mapping applications on hybrid systems , 2009, IET Comput. Digit. Tech..

[23]  François Charot,et al.  Constraint Programming Approach to Reconfigurable Processor Extension Generation and Application Compilation , 2012, TRETS.