Resource constrained dataflow retiming heuristics for VLIW ASIPs
Margarida F. Jacome, Gustavo de Veciana, Cagdas Akturan · 1999
This paper addresses issues in code generation of time critical loops for VLIW ASlPs with h&erogenous distributed register structtnes.We discuss a code generationphasing whereby one first considers binding options that minimize the significant delays that may be incurred on such pn~essnrs.Given such a binding we consider retiming, subject to code size constraints, so as tn enhance petfotmance.Finally a compatible schedule, minimizing latency, is sought.Our main focus in this paper is on the role retiming plays in this complex code generation problem.We propose heuristic algorithms for exploring code sizelperfotmance tradeoffs through retiming.Experimental results ate presented indicating that the heuristics perform well on a sample of dataflows.