A. Emeretlis, G. Theodoridis, P. Alefragis, N. Voros, 4th Workshop on Virtual Prototyping of Parallel and Embedded Systems (ViPES 2016), July 17th, Samos Island, Greece, 2016
Presented by George Theodoridis
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.