Notes /95 ■ Unfolding of an edge with w delays in the original DFG produces J-w edges with no delay and w edges with 1 delay in J-unfolded DFG when w<J. Unfolding preserves precedence constraints of a DSP program. 2021年2月 11
2021年2月 11 Notes Unfolding of an edge with w delays in the original DFG produces J-w edges with no delay and w edges with 1 delay in J-unfolded DFG when w<J. Unfolding preserves precedence constraints of a DSP program
5.3 Properties of unfolding Property 1: Unfolding preserve the number of delays in a DFG. +=w 2021年2月 12
2021年2月 12 5.3 Properties of unfolding Property 1: Unfolding preserve the number of delays in a DFG. w J w J J w J w J w 1 ... 1 2
■Property2: W J-unfolding of a loop I with w delays in the original DFG leads to gcd(wi,)loops in the unfolded DFG,and each of these new loops contains w/gcd(w,J)delays and ]/gcd(wi,J)copies of each J gcd node that appears in loop l. gcd(wi,J) gcd:greatest common divisor ged J ged 2021年2月 13
2021年2月 13 Property 2: J-unfolding of a loop l with wl delays in the original DFG leads to gcd(wl ,J) loops in the unfolded DFG, and each of these new loops contains wl /gcd(wl ,J) delays and J/gcd(wl ,J) copies of each node that appears in loop l. gcd: greatest common divisor wl Wl gcd ____ J gcd ____ . . . Wl gcd ____ J gcd ____ . . . . . . gcd(wl,J)
U /96d U D 3D 2D T D Uo D D D D U 1 U D U 0 T U2 D U2 V2 0 U D D D 2021年2月 14
2021年2月 14 U V T 3D 2D D U0 U2 U1 V0 V2 V1 T0 T2 T1 D D D D D D D U0 U3 U2 U1 V0 T0 T3 T2 V1 T1 V3 V2 D D D D D D