Iterative Algorithms for Periodic Scheduling of Synchronous Data Flow Graphs
Ashish Mishra, Devang N Dave, Vishal Mittal, Kota Solomon Raju · SSRN Electronic Journal · 2015
Electronic Design Automation (EDA) tools are extensively used for simulation and synthesizing communication signal processing system. Synchronous Data Flow (SDF) model of computation is widely used for multi-rate signal processing applications. Behavioral representation of such system results in critical SDF graph that consists of hundreds of components and interconnection between them. Large variations in data transfer between different components and their execution are observed in such kinds of multi rate system. Simulating this SDF graph using conventional algorithm leads to unacceptable simulation time and memory requirement. In this paper, two different algorithms for SDF scheduling are presented which can effectively reduce memory requirement, either by reducing code size or by buffer size.