Fine-Grain Compilation for Pipelined Machines
| dc.contributor.author | Pingali, Keshav | en_US |
| dc.date.accessioned | 2007-04-23T17:34:11Z | |
| dc.date.available | 2007-04-23T17:34:11Z | |
| dc.date.issued | 1988-08 | en_US |
| dc.description.abstract | Computer architecture design requires careful attention to the balance between the complexity of code scheduling problems and the cost and feasibility of building a machine. In this paper, we show that recently developed software pipelining algorithms produce optimal or near-optimal code for a large class of loops when the target architecture is a clean pipelined parallel machine. The important feature of these machines is the absence of structural hazards. We argue that the robustness of the scheduling algorithms and relatively simple hardware make these machines realistic and cost-effective. To illustrate the delicate balance between architecture and scheduling complexity, we show that scheduling with structural hazards is NP-hard, and that there are machines with simple structural hazards for which vectorization and the software pipelining techniques generate poor code. | en_US |
| dc.format.extent | 1752164 bytes | |
| dc.format.extent | 459341 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/TR88-934 | en_US |
| dc.identifier.uri | https://hdl.handle.net/1813/6774 | |
| 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 | Fine-Grain Compilation for Pipelined Machines | en_US |
| dc.type | technical report | en_US |