A hybrid approach for mapping and scheduling on heterogeneous multicore systems

A hybrid approach for mapping applications represented as Directed Acyclic Graphs (DAGs) is introduced in this work. It combines the Benders decomposition principle, which integrates Integer Linear and Constraint Programming (ILP and CP) methods, with a pure ILP model to find optimal solutions. The cuts that are generated during the iterative Benders solution process are later exploited by the ILP solver to prune the remaining search space. The proposed model succeeds to provide the optimal solution in cases where either method alone fails to do so, while it also reduces the total solution time.

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

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

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

[4]  Adam N. Letchford,et al.  COVER INEQUALITIES , 2009 .

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

[6]  Marianthi G. Ierapetritou,et al.  Improving benders decomposition using maximum feasible subsystem (MFS) cut generation strategy , 2010, Comput. Chem. Eng..

[7]  Mei-Hui Su,et al.  Characterization of scientific workflows , 2008, 2008 Third Workshop on Workflows in Support of Large-Scale Science.

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

[9]  George Theodoridis,et al.  Mapping DAGs on Heterogeneous Platforms Using Logic-Based Benders Decompostion , 2015, 2015 IEEE Computer Society Annual Symposium on VLSI.

[10]  Michela Milano,et al.  Constraint and Integer Programming: Toward a Unified Methodology (Operations Research/Computer Science Interfaces, 27) , 2003 .

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

[12]  M. Fischetti,et al.  Minimal Infeasible Subsystems and Benders cuts , 2008 .

[13]  J. Christopher Beck,et al.  Logic-based Benders Decomposition for Alternative Resource Scheduling with Sequence Dependent Setups , 2012, ECAI.

[14]  Ulrich Junker,et al.  QUICKXPLAIN: Preferred Explanations and Relaxations for Over-Constrained Problems , 2004, AAAI.

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

[16]  George Theodoridis,et al.  A Logic-Based Benders Decomposition Approach for Mapping Applications on Heterogeneous Multicore Platforms , 2016, TECS.

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

[18]  John N. Hooker,et al.  A Hybrid Method for the Planning and Scheduling , 2005, Constraints.