Timothy W. O'Neil
synchronous data-flow graphs, resource-constrained scheduling
Many common iterative or recursive DSP applications can be represented by synchronous data-flow graphs (SDFGs). Our prior work with SDFGs introduced a static scheduling algorithm which produces a time-optimal schedule on an ideal system with unlimited resources. In this paper, we now present a variation on that algorithm for scheduling an SDFG to achieve efficient execution in the presense of resource constraints. Herein, we outline our methods, evaluate their time complexity and demonstrate their effectiveness on several examples.
Important Links:
Go Back
