TY - GEN
T1 - Rotation scheduling
T2 - Proceedings of the 30th ACM/IEEE Design Automation Conference
AU - Chao, Liang Fang
AU - LaPaugh, Andrea Suzanne
AU - Sha, Edwin Hsing Mean
PY - 1993/1/1
Y1 - 1993/1/1
N2 - We consider the resource-constrained scheduling of loops with inter-iteration 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 DFGs using loop pipelining. The rotation technique repeatedly transforms a schedule to a more compact schedule. We provide a theoretical basis of the operations based on retiming. We propose two heuristics to perform rotation scheduling, and give experimental results showing that they have very good performance.
AB - We consider the resource-constrained scheduling of loops with inter-iteration 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 DFGs using loop pipelining. The rotation technique repeatedly transforms a schedule to a more compact schedule. We provide a theoretical basis of the operations based on retiming. We propose two heuristics to perform rotation scheduling, and give experimental results showing that they have very good performance.
UR - http://www.scopus.com/inward/record.url?scp=0027277240&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0027277240&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:0027277240
SN - 0897915771
T3 - Proceedings - Design Automation Conference
SP - 566
EP - 572
BT - Proceedings - Design Automation Conference
PB - Publ by IEEE
Y2 - 14 June 1993 through 18 June 1993
ER -