Symmetry Breaking for Multi-criteria Mapping and Scheduling on Multicores
- Cite this paper as:
- Tendulkar P., Poplavko P., Maler O. (2013) Symmetry Breaking for Multi-criteria Mapping and Scheduling on Multicores. In: Braberman V., Fribourg L. (eds) Formal Modeling and Analysis of Timed Systems. FORMATS 2013. Lecture Notes in Computer Science, vol 8053. Springer, Berlin, Heidelberg
Multiprocessor mapping and scheduling is a long-old difficult problem. In this work we propose a new methodology to perform mapping and scheduling along with buffer memory optimization using an SMT solver. We target split-join graphs, a formalism inspired by synchronous data-flow (SDF) which provides a compact symbolic representation of data-parallelism. Unlike the traditional design flow for SDF which involves splitting of a big problem into smaller heuristic sub-problems, we deal with this problem as a whole and try to compute exact Pareto-optimal solutions for it. We introduce symmetry breaking constraints in order to reduce the run-times of the solver. We have tested our work on a number of SDF graphs and demonstrated the practicality of our method. We validate our models by running an image decoding application on the Tilera multicore platform.
Keywordssynchronous data-flow multiprocessor multicore mapping scheduling SMT SAT solver
Unable to display preview. Download preview PDF.