Exploiting short-lived variables in superscalar processors
- 1 November 1995
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10724451,p. 292-302
- https://doi.org/10.1109/micro.1995.476839
Abstract
In this paper we present experimental evidence showing that a significant number of program variables are short-lived in the sense that their live ranges span only a few instructions. In dynamically scheduled superscalar processors using mechanisms like the reorder buffer, the live ranges for these short-lived variables may occur entirely within the reorder buffer. Therefore, there should be no need to retire (commit) the values produced by these live ranges to the register file. On the basis of this observation, we have proposed a scheme that includes a compiler analysis and a simple architecture extension to avoid the useless commits of the values generated for these short-lived variables. Moreover we have proposed an extension to the existing register allocation mechanism that does not assign these short-lived variables to locations in the register file. Analyses and results are presented.Keywords
This publication has 10 references indexed in Scilit:
- Partitioned Register Files For VLIWs: A Preliminary Analysis Of TradeoffsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The performance potential of multiple functional unit processorsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Register file port requirements of transport triggered architecturesPublished by Association for Computing Machinery (ACM) ,1994
- Designing the McCAT compiler based on a family of structured intermediate representationsPublished by Springer Nature ,1993
- Data path issues in a highly concurrent machine (abstract)Published by Association for Computing Machinery (ACM) ,1992
- Implementing precise interrupts in pipelined processorsIEEE Transactions on Computers, 1988
- Checkpoint repair for out-of-order execution machinesPublished by Association for Computing Machinery (ACM) ,1987
- WISQ: a restartable architecture using queuesPublished by Association for Computing Machinery (ACM) ,1987
- Register allocation via coloringComputer Languages, 1981
- Look-Ahead ProcessorsACM Computing Surveys, 1975