|
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/6549
| Title: | Loop Quantization: Unwinding for Fine-Grain Parallelism Exploitation |
| Authors: | Nicolau, Alexandru |
| Keywords: | computer science technical report |
| Issue Date: | Oct-1985 |
| Publisher: | Cornell University |
| Citation: | http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR85-709 |
| 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 in a group of nested loops and the amount of unwinding is either fixed or has to be specified by the user, on a case by case basis. In this paper we present a general technique for automatically unwinding multply nested loops, explain its advantages over other transformation techniques and illustrates its practical effectiveness. |
| URI: | http://hdl.handle.net/1813/6549 |
| Appears in Collections: | Computer Science Technical Reports
|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.
|