URSA: A Unified ReSource Allocator for Registers and Functional Units In VLIW Architectures (1992)
Cached
Download Links
- [ftp.cs.pitt.edu]
- [www.cs.pitt.edu]
- [www.cs.pitt.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | In Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism |
| Citations: | 37 - 5 self |
BibTeX
@INPROCEEDINGS{Berson92ursa:a,
author = {David Berson and Rajiv Gupta and Mary Lou Soffa},
title = {URSA: A Unified ReSource Allocator for Registers and Functional Units In VLIW Architectures},
booktitle = {In Conference on Architectures and Compilation Techniques for Fine and Medium Grain Parallelism},
year = {1992},
pages = {243--254}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
The division of instruction scheduling and register allocation and assignment into separate phases can adversely affect the performance of these tasks and thus the quality of the code generated for load/store fine grained parallel architectures. Improved performance in one phase can deteriorate the performance of the other phase, possibly resulting in poorer overall performance. In this paper we present an approach that partitions instruction scheduling and register allocation and assignment into a new set of phases in an attempt to construct phases with minimal interaction. This approach uses a technique that unifies the problems of allocating registers and functional units. The technique, which consists of three phases, operates on a dependence DAG representation of the program. The first phase carries out the measurement of resource requirements and identifies regions with excess requirements. The second phase applies transformations that reduce the requirements to levels supported ...
Citations
No citations identified.
