The goal of scheduling is to map the register transfers in the low-level signal flow graph g into discrete time slots, called control steps. The graph g is engrafted upon a particular data path configuration and contains primitive operations only. The amount of parallelism in the data path is used as a constraint to convert the applicative, maximally parallel signal-flow graph into a procedural description with a proper sequence of the register transfers, i.e., the schedule.
KeywordsSchedule Algorithm Code Block Graph Transformation Data Path Control Step
Unable to display preview. Download preview PDF.