Timothy W. O’Neil
Synchronous data-ﬂow graphs, resource-constrained scheduling
Numerous customary applications in digital signal processing may
be characterized by synchronous data-ﬂow graphs (SDFGs). Our
previous experiments with SDFGs led to the development of a
technique which constructs a static time-optimal schedule on a model
system possessing limitless functional elements. In this paper, we
now introduce a modiﬁcation of this method for scheduling an SDFG
to realize eﬃcient performance in a more restricted environment.
Herein, we summarize our approach, assess its time complexity and
exhibit its value on sample applications.