Abstract
Hierarchical reduction is a unified approach to scheduling both within and across basic blocks. The motivation for the technique is to make software pipelining applicable to all innermost loops, including those containing conditional statements. Software pipelining has previously been defined only for loops containing straight-line code bodies. A simple conditional statement in the loop would have rendered the technique inapplicable. A loop such as the following would have been extremely inefficient on a heavily pipelined and parallel data path.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1989 Kluwer Academic Publishers
About this chapter
Cite this chapter
Lam, M.S. (1989). Hierarchical Reduction. In: A Systolic Array Optimizing Compiler. The Kluwer International Series in Engineering and Computer Science, vol 64. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1705-0_6
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1705-0_6
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8961-6
Online ISBN: 978-1-4613-1705-0
eBook Packages: Springer Book Archive