Throughput-memory footprint trade-off in synthesis of streaming software on embedded multiprocessors
Authors:
Open Access
- 24 December 2013
- journal article
- research article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 13 (3) , 1-26
Abstract
We study the trade-off between throughput and memory footprint of embedded software that is synthesized from acyclic static dataflow (task graph) specifications targeting distributed memory multiprocessors. We identify iteration overlapping as a knob in the synthesis process by which one can trade application throughput for its memory requirement. Given an initial processor assignment and non-overlapped task schedule, we formally present underlying properties of the problem, such as constraints on a valid iteration overlapping, maximum possible throughput, and minimum memory footprint. Moreover, we develop an effective algorithm for generation of a rich set of design points that provide a range of trade-off options. Experimental results on a number of applications and architectures validate the effectiveness of our approach.Keywords
This publication has 15 references indexed in Scilit:
- Orchestrating the execution of stream programs on multicore platforms2008
- Beyond single-appearance schedulesACM Transactions on Embedded Computing Systems, 2007
- Exploiting coarse-grained task, data, and pipeline parallelism in stream programs2006
- Deterministic Parallel ProcessingInternational Journal of Parallel Programming, 2006
- Reactive process networks2004
- Buffer merging—a powerful technique for reducing memory requirements of synchronous dataflow specificationsACM Transactions on Design Automation of Electronic Systems, 2004
- Exploring embedded-systems architectures with ArtemisComputer, 2001
- Software pipelining showdown1996
- Iterative modulo scheduling1994
- Synchronous data flowProceedings of the IEEE, 1987