Publication
Transactions on Architecture and Code Optimization
Paper

Orchestrating stream graphs using model checking

Download paper

Abstract

In this article we use model checking to statically distribute and schedule Synchronous DataFlow (SDF) graphs on heterogeneous execution architectures. We show that model checking is capable of providing an optimal solution and it arrives at these solutions faster (in terms of algorithm runtime) than equivalent ILP formulations. Furthermore, we also show how different types of optimizations such as task parallelism, data parallelism, and state sharing can be included within our framework. Finally, comparison of our approach with the current state-of-the-art heuristic techniques show the pitfalls of these techniques and gives a glimpse of how these heuristic techniques can be improved. © 2013 ACM.

Date

16 Sep 2013

Publication

Transactions on Architecture and Code Optimization

Authors

Resources

Share