Skip to main content

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((SECS,volume 64))

  • 101 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics