Skip to main content


eCommons@Cornell

eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1813/6661
Title: Loop Quantization: an Analysis and Algorithm
Authors: Aiken, Alexander
Nicolau, Alexandru
Keywords: computer science
technical report
Issue Date: Mar-1987
Publisher: Cornell University
Citation: http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-821
Abstract: Loop unwinding is a well-known technique for reducing loop overhead, exposing parallelism, and increasing the efficiency of pipelining. Traditional loop unwinding is limited to the innermost loop of a set of nested loops and the amount of unwinding is either fixed or must be specified by the user. In this paper we present a general technique, loop quantization, for unwinding multiple nested loops, explain its advantages over other transformations, and illustrate its practical effectiveness. An abstraction of nested loops is presented which leads to results about the complexity of computing quantizations and an algorithm.
URI: http://hdl.handle.net/1813/6661
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
87-821.pdf2.85 MBAdobe PDFView/Open
87-821.ps745.38 kBPostscriptView/Open

Refworks Export

Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.

 

© 2014 Cornell University Library Contact Us