ABSTRACT
We present two full-custom implementations of the Register Alias Table (RAT) for a 4-way superscalar dynamically-scheduled processor in a commercial 130nm CMOS technology. The implementations differ in the way they organize the embedded global checkpoints (GCs) which support speculative execution. In the first implementation, representative of early designs, the GCs are organized as shift registers. In the second implementation, representative of more recent proposals, the GCs are organized as random access buffers. We measure the impact of increasing thenumber of GCs on the latency, energy, and area of the RAT. The results support the importance of recent techniques that reduce the number of GCs while maintaining performance.
- H. Akkary, et al., "An Analysis of Resource Efficient Checkpoint Architecture", ACM Transaction on Architecture and Code Optimization, 1(4), Dec. 2004. Google ScholarDigital Library
- B. Bishop, et al., "The Design of a Register Renaming unit", Great Lakes Symposium on VLSI, Mar. 1999 Google ScholarDigital Library
- A. De Gloria, et al. , "An Application Specific Multi-Port RAM Cell Circuit for Register Renaming Units in High Speed Microprocessors", IEEE International Symposium on Circuits and Systems, 4:934--937, May 2001.Google Scholar
- R. Heald et al., "A Third-Generation SPARC V9 64-b Microprocessor", IEEE Journal of Solid-State Circuits, 35(11) : 1526--1538, Nov. 2000.Google ScholarCross Ref
- R. K. Krishnamurthy, et al., "130-nm 6-GHz 256 - 32 bit Leakage-Tolerant Register File", IEEE Journal of Solid-State Circuits,37(5): 624--632, May 2002Google ScholarCross Ref
- G. Kuçuk, et.al," Reducing Power Dissipation of Register Alias Tables in High-Performance Processors, IEE Proceedings on Computers and Digital Techniques, 152(6): 739--746, Nov. 2005.Google ScholarCross Ref
- A. Moshovos, "Checkpointing Alternatives for High Performance, Power-Aware Processors", IEEE International Symposium on Low Power Electronic and Design, 318--321, Aug. 2003 Google ScholarDigital Library
- S. Palacharla, "Complexity-effective Superscalar Processors", Ph.D. Thesis, University of Wisconsin-Madison, 1998. Google ScholarDigital Library
- R. Sangireddy, "Reducing Rename Logic Complexity for High-Speed and Low-Power Front-End Architectures", IEEE Transactions of Computers, 55(6):672--685, Jun. 2006. Google ScholarDigital Library
- D. Tarjan, S. Thoziyoor and N. P. Jouppi, CACTI 4.0, HP Labs Technical Report HPL-2006-86, 2006.Google Scholar
- K. C. Yeager, "The MIPS R10000 Superscalar Microprocessor", IEEE MICRO, 1996. Google ScholarDigital Library
- V. Zyuban, "Inherently Lower-Power High-Performance Superscalar Architectures", PhD Thesis, University of Notre Dame, Jan. 2000. Google ScholarDigital Library
Index Terms
- On the latency, energy and area of checkpointed, superscalar register alias tables
Recommendations
A physical level study and optimization of CAM-based checkpointed register alias table
ISLPED '08: Proceedings of the 2008 international symposium on Low Power Electronics & DesignUsing full-custom layouts in 130 nm technology, this work studies how the latency and energy of a checkpointed, CAM-based Register Alias Table (cRAT) vary as a function of the window size, the issue width, and the number of embedded global checkpoints (...
On the latency and energy of checkpointed superscalar register alias tables
This paper investigates how the latency and energy of register alias tables (RATs) vary as a function of the number of global checkpoints (GCs), processor issue width, and window size. It improves upon previous RAT checkpointing work that ignored the ...
Virtual register renaming
ARCS'13: Proceedings of the 26th international conference on Architecture of Computing SystemsThis paper presents a novel high performance substrate for building energy-efficient out-of-order superscalar cores. The architecture does not require a reorder buffer or physical registers for register renaming and instruction retirement. Instead, it ...
Comments