A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour
The design of new embedded systems is getting more and more complex as more functionality is integrated into these systems. To deal with the design complexity, a predictable design flow is needed. The result should be a system that guarantees that an application can perform its own tasks within strict timing deadlines, independent of other applications running on the system. Synchronous Dataflow Graphs (SDFGs) provide predictability and are often used to model time-constrained streaming applications that are mapped onto a multiprocessor platform. However, the model abstracts from the dynamic application behaviour which may lead to a large overestimation of its resource requirements.
We present a design flow that takes the dynamic behaviour of applications into account when mapping them onto a multiprocessor platform. The design flow provides throughput guarantees for each application independent of the other applications while taking into account the available processing capacity, memory and communication bandwidth. The design flow generates a set of mappings that provide a trade-off in their resource usage. This trade-off can be used by a run-time mechanism to adapt the mapping in different use-cases to the available resource. The experimental results show that our design flow reduces the resource requirements of an MPEG-4 decoder by 66% compared to a state-of-the-art design flow based on SDFGs.
- A Predictable Multiprocessor Design Flow for Streaming Applications with Dynamic Behaviour
S. Stuijk, M.C.W. Geilen and T. Basten.
In Digital System Design, 13th Euromicro Conference, DSD 10 Proceedings, pages 548-555. Lille, France, 1-3 September 2010. IEEE Computer Society Press, Los Alamitos, CA, USA, 2010. (abstract, pdf, doi).