Incremental tree height reduction for high level synthesis

Abstract

A local and incremental tree height reduction (THR) technique for parallelization of application programs is presented. While known compaction techniques yield constant factor of speed-up (even with unlimited resources), THR has speed-up of O(n/log n). Furthermore, THR is able to compact programs when other techniques fail (due to data dependency between operations). The capability of this system to integrate THR with beyond-basic-blocks compaction and with loop pipelining means that more operations may be considered for THR which may yield much more aggressive compaction.