| 摘要 |
<p>A method is disclosed for scheduling synchronous data flow (SDF) graphs from which program code can be generated which is optimally compacted to save program memory space. The schedule produced can also consider optimal combinations of system performance criteria, including program and data memory space requirements, latency and execution time. A maximum buffer length schedule is generated from the SDF graph which is consistent with the precedence established by the graph, and which maximizes the contiguous prime factors of the invocation frequencies for each actor from the graph. An ordered loop set of actors is generated for each prime factor. The list of loop sets are ordered from the set with the most actors to the set with the fewest. Loop schedules are extracted from the set list which maximize looping in the schedules and nesting of the loops.</p> |
