skip to main content
10.1145/1283780.1283863acmconferencesArticle/Chapter ViewAbstractPublication PagesislpedConference Proceedingsconference-collections
Article

On the latency, energy and area of checkpointed, superscalar register alias tables

Published:27 August 2007Publication History

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.

References

  1. H. Akkary, et al., "An Analysis of Resource Efficient Checkpoint Architecture", ACM Transaction on Architecture and Code Optimization, 1(4), Dec. 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. B. Bishop, et al., "The Design of a Register Renaming unit", Great Lakes Symposium on VLSI, Mar. 1999 Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 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 ScholarGoogle Scholar
  4. 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 ScholarGoogle ScholarCross RefCross Ref
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle ScholarCross RefCross Ref
  7. A. Moshovos, "Checkpointing Alternatives for High Performance, Power-Aware Processors", IEEE International Symposium on Low Power Electronic and Design, 318--321, Aug. 2003 Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. S. Palacharla, "Complexity-effective Superscalar Processors", Ph.D. Thesis, University of Wisconsin-Madison, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  10. D. Tarjan, S. Thoziyoor and N. P. Jouppi, CACTI 4.0, HP Labs Technical Report HPL-2006-86, 2006.Google ScholarGoogle Scholar
  11. K. C. Yeager, "The MIPS R10000 Superscalar Microprocessor", IEEE MICRO, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. V. Zyuban, "Inherently Lower-Power High-Performance Superscalar Architectures", PhD Thesis, University of Notre Dame, Jan. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. On the latency, energy and area of checkpointed, superscalar register alias tables

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          ISLPED '07: Proceedings of the 2007 international symposium on Low power electronics and design
          August 2007
          432 pages
          ISBN:9781595937094
          DOI:10.1145/1283780

          Copyright © 2007 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 27 August 2007

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • Article

          Acceptance Rates

          Overall Acceptance Rate398of1,159submissions,34%

          Upcoming Conference

          ISLPED '24

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader