A reordering technique for efficient code motion

Luiz C. V. dos Santos, Jochen A. G. Jess
1999 Proceedings of the 36th ACM/IEEE conference on Design automation conference - DAC '99  
Emerging design problems are prompting the use of code motion and speculative execution in high-level synthesis to shorten schedules and meet tight timeconstraints. However, some code motions are not worth doing from a worst-case execution perspective. We propose a technique that selects the most promising code motions, thereby increasing the density of optimal solutions in the search space.
doi:10.1145/309847.309935 dblp:conf/dac/SantosJ99 fatcat:y26thrftufdatehulbpql74b6u