Loop Quantization: an Analysis and Algorithm
| dc.contributor.author | Aiken, Alexander | en_US |
| dc.contributor.author | Nicolau, Alexandru | en_US |
| dc.date.accessioned | 2007-04-23T17:18:51Z | |
| dc.date.available | 2007-04-23T17:18:51Z | |
| dc.date.issued | 1987-03 | en_US |
| dc.description.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. | en_US |
| dc.format.extent | 2915670 bytes | |
| dc.format.extent | 763269 bytes | |
| dc.format.mimetype | application/pdf | |
| dc.format.mimetype | application/postscript | |
| dc.identifier.citation | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR87-821 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6661 | |
| dc.language.iso | en_US | en_US |
| dc.publisher | Cornell University | en_US |
| dc.subject | computer science | en_US |
| dc.subject | technical report | en_US |
| dc.title | Loop Quantization: an Analysis and Algorithm | en_US |
| dc.type | technical report | en_US |