Answers are grounded in this paper and cite their sources.
This paper describes a method for loop compaction with resource constraints that is an extension of a dynamicprogramming method for compacting straight-line code. Although the method is guaranteed to find an optimal solution, its exponential worst-case time-complexity limits its practical utility to small problems. The technique is applied to two sets of test programs to provide intuition about its practicality.
No takes yet. Share an insight, caveat, or question.
Stephen R. Vegdahl (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: