## Resource-constrained Static Scheduling of Synchronous Data-flow Graphs

- Timothy W. O’Neil
- 2012

@article{Ho1997FullySP, title={Fully static processor-optimal assignment of data-flow graphs}, author={Yeh-Chin Ho and Jong-Chuang Tsay}, journal={IEEE Signal Processing Letters}, year={1997}, volume={4}, pages={146-148} }

- Published 1997 in IEEE Signal Processing Letters

The data-flow graph (DFG) is an important graph-theoretic model for multiprocessor implementation of real-time digital signal processing (DSP) algorithms. Given a time schedule for a DFG, we consider the problem of the processor-optimal assignment for a fully static schedule. Previously, the solution of this problem was found by solving an integer… CONTINUE READING

### Presentations referencing similar topics