Name
Abstract | ||
|---|---|---|
Efficient mapping of DAGs on heterogeneous multicore platforms is a key component for modern embedded applications. An approach based on the Benders decomposition principle that uses a heuristic pre-solver and Integer Linear and Constraint Programming methods to find proven-optimal solutions is introduced. We present multiple cuts generation schemes, that improve the performance of the solution process, and extensive experimental results, that show significant speedups compared to the pure ILP-based method. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/ISVLSI.2015.98 | 2015 IEEE Computer Society Annual Symposium on VLSI |
Keywords | Field | DocType |
Multicore architectures,DAGs mapping,Benders decomposition,ILP CP optimization | Integer,Heuristic,Scheduling (computing),Computer science,Constraint programming,Parallel computing,Embedded applications,Multi-core processor,Benders' decomposition | Conference |
ISSN | Citations | PageRank |
2159-3469 | 2 | 0.37 |
References | Authors | |
12 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andreas Emeretlis | 1 | 11 | 2.95 |
| George Theodoridis | 2 | 10 | 1.91 |
| Panayiotis Alefragis | 3 | 120 | 14.33 |
| Nikos S. Voros | 4 | 25 | 5.31 |