DocumentCode
1704986
Title
Register file design considerations in dynamically scheduled processors
Author
Farkas, Keith I. ; Jouppi, Norman P. ; Chow, Paul
Author_Institution
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
fYear
1996
Firstpage
40
Lastpage
51
Abstract
We have investigated the register file requirements of dynamically scheduled processors using register renaming and dispatch queues running the SPEC92 benchmarks. We looked at processors capable of issuing either four or eight instructions per cycle and found that in most cases implementing precise exceptions requires a relatively small number of additional registers compared to imprecise exceptions. Systems with aggressive non-blacking load support were able to achieve performance similar to processors with perfect memory systems at the cost of some additional registers. Given our machine assumptions, we found that the performance of a four-issue machine with a 32-entry dispatch queue tends to saturate around 80 registers. For an eight-issue machine with a 64-entry dispatch queue performance does not saturate until about 128 registers. Assuming the machine cycle time is proportional to the register file cycle time, the 8-issue machine yields only 20% higher performance than the 4-issue machine due in part to the cycle time impact of additional hardware
Keywords
file organisation; processor scheduling; SPEC92 benchmarks; dispatch queue performance; dispatch queues; dynamically scheduled processors; register file design considerations; register file requirements; register renaming; Computer aided instruction; Costs; Dynamic scheduling; Educational institutions; Hardware; High performance computing; Out of order; Parallel processing; Processor scheduling; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
High-Performance Computer Architecture, 1996. Proceedings., Second International Symposium on
Conference_Location
San Jose, CA
Print_ISBN
0-8186-7237-4
Type
conf
DOI
10.1109/HPCA.1996.501172
Filename
501172
Link To Document