STATIC SCHEDULING for SYNCHRONOUS DATA FLOW GRAPHS

This paper addresses the issue of determining the iteration bound for a synchronous data flow graph (SDFG) and determining whether or not a SDFG is live based on some calculations done. The main result of this paper is finding an iteration bound equation that is used to find an integral static schedule for the SDFG, where a node is issued at the beginning of a clock cycle. We show that we can schedule a SDFG without converting it to its equivalent homogeneous graph (EHG). Finally, we clarify our method by some examples.