Single-rate approximations of cyclo-static synchronous dataflow graphs
Robert de Groote, Philip K. F. Hölzenspies, Jan Kuper, Gerard J.M. Smit · 2014
Exact analysis of synchronous dataflow (sdf) graphs is often considered too costly, because of the expensive transformation of the graph into a single-rate equivalent. As an alternative, several authors have proposed approximate analyses. Existing approaches to approximation are based on the operational semantics of an sdf graph.