Sciweavers

DAC
1993
ACM

Rotation Scheduling: A Loop Pipelining Algorithm

13 years 9 months ago
Rotation Scheduling: A Loop Pipelining Algorithm
— We consider the resource-constrained scheduling of loops with interiteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the number of iterations between dependencies. We design a novel and flexible technique, called rotation scheduling, for scheduling cyclic DFG’s using loop pipelining. The rotation technique repeatedly transforms a schedule to a more compact schedule. We provide a theoretical basis for the operations based on retiming. We propose two heuristics to perform rotation scheduling and give experimental results showing that they have very good performance.
Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Me
Added 09 Aug 2010
Updated 09 Aug 2010
Type Conference
Year 1993
Where DAC
Authors Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
Comments (0)