Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Scheduling data-flow graphs via retiming and unfolding
1997 / IEEE
This item was taken from the IEEE Periodical ' Scheduling data-flow graphs via retiming and unfolding ' Loop scheduling is an important problem in parallel processing. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. We combine these two techniques to obtain a static schedule with a reduced average computation time per iteration. We first prove that the order of retiming and unfolding is immaterial for scheduling a data-flow graph (DFG). From this nice property, we present a polynomial-time algorithm on the original DFG, before unfolding, to find the minimum-rate static schedule for a given unfolding factor. For the case of a unit-time DFG, efficient checking and retiming algorithms are presented.
Data Flow Graphs
Reduced Average Computation Time
Digital Signal Processing
Very Large Scale Integration
High Level Synthesis
Communication, Networking And Broadcast Technologies
Computing And Processing