skip to main content
10.1145/264107.264200acmconferencesArticle/Chapter ViewAbstractPublication PagesiscaConference Proceedingsconference-collections
Article
Free Access

Dynamic instruction reuse

Authors Info & Claims
Published:01 May 1997Publication History

ABSTRACT

This paper introduces the concept of dynamic instruction reuse. Empirical observations suggest that many instructions, and groups of instructions, having the same inputs, are executed dynamically. Such instructions do not have to be executed repeatedly --- their results can be obtained from a buffer where they were saved previously. This paper presents three hardware schemes for exploiting the phenomenon of dynamic instruction reuse, and evaluates their effectiveness using execution-driven simulation. We find that in some cases over 50% of the instructions can be reused. The speedups so obtained, though less striking than the percentage of instructions reused, are still quite significant.

References

  1. 1.D. Burger, T. M. Austin, and S. Bennett. Evaluating Future Microprocessors: The SimpleSealar Tool Set. Technical Report CS-TR-96- 1308, University of Wisconsin-Madison, July 1996. (URL: http://www.cs.wise.ed u/-msealar/simplescalar.html)Google ScholarGoogle Scholar
  2. 2.S.P. Harbison. A Computer Architecture for the Dynamic Optimization of ttigh-Level Language Programs. Ph.D. thesis, Carnegie Mellon University, Sept. 1980. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. 3.S.P. Harbison. An architectural alternative to optimizing compilers. In Proc. International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), page 57 65, Mar. 1982. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.M.H. Lipasti and J. P. Shen. Exceeding the dataflow limit via value prediction. In Proc. of 29th International Symposium on Microarchitecture, pages 226--237, Dee. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.M.H. Lipasti, C. B. Wilkerson, and J. P. Shen. Value locality and load value prediction. In Proc. of ASPLOS VII, pages 138-147, Sept. 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.S.F. Oberman and M. J. Flynn. On Division and Reciprocal Caches. Technical Report CSL-TR-95-666, Stanford University, Apr. 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. 7.S.E. Richardson. Caching function results: Faster arithmetic by avoiding unnecessary computation. Technical Report SMLI TR-92-1, Sun Miemsystems Laboratories, Sept. 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 8.J. Smith and A. Pleszl~n. Implementing precise interrupts in pipelined processors. 1EEE Transactions on Computers, 37(5):562-573, May 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Dynamic instruction reuse

                  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
                    ISCA '97: Proceedings of the 24th annual international symposium on Computer architecture
                    June 1997
                    350 pages
                    ISBN:0897919017
                    DOI:10.1145/264107
                    • cover image ACM SIGARCH Computer Architecture News
                      ACM SIGARCH Computer Architecture News  Volume 25, Issue 2
                      Special Issue: Proceedings of the 24th annual international symposium on Computer architecture (ISCA '97)
                      May 1997
                      349 pages
                      ISSN:0163-5964
                      DOI:10.1145/384286
                      Issue’s Table of Contents

                    Copyright © 1997 Authors

                    Publisher

                    Association for Computing Machinery

                    New York, NY, United States

                    Publication History

                    • Published: 1 May 1997

                    Permissions

                    Request permissions about this article.

                    Request Permissions

                    Check for updates

                    Qualifiers

                    • Article

                    Acceptance Rates

                    Overall Acceptance Rate543of3,203submissions,17%

                    Upcoming Conference

                    ISCA '24

                  PDF Format

                  View or Download as a PDF file.

                  PDF

                  eReader

                  View online with eReader.

                  eReader