Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/192724.192742acmconferencesArticle/Chapter ViewAbstractPublication PagesmicroConference Proceedingsconference-collections
Article
Free Access

Cache designs with partial address matching

Authors Info & Claims
Published:30 November 1994Publication History

ABSTRACT

One critical aspect in designing set-associative cache at high clock rate is deriving timely results from directory lookup. In this paper we investigate the possibility of accurately approximating the results of conventional directory search with faster matches of few partial address bits. Such fast and accurate approximations may be utilized to optimize cache access timing, particularly in a customized design environment. Through analytic and simulation studies we examine the trade-offs of various design choices. We also discuss few other applications of partial address matching to computer designs.

References

  1. 1.C.J. Conti, "Concepts for Buffer Storage," IEEE Comp. Group News, 2, 8, (March 1969), pp. 9-13.Google ScholarGoogle Scholar
  2. 2.A. J. Smith, "A Comparative Study of Set Associative Memory Mapping Algorithms and Their Use for Cache and Main Memory," IEEE Trans. on Software Engineering, SE-4, 2 (March 1978).Google ScholarGoogle Scholar
  3. 3.A. J. Smith, "Cache Memories," Computing Surveys, 14, 3 (September 1982), pp. 473-530. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 4.M. Hill "A Case for Direct-Mapped Caches," IEEE Computer, 21,12 (December 1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. 5.S. Przybylski, M. Horowitz and J. Hennessy, "Performance Tradeoffs in Cache Design," Proc. 15th International Symp. on Computer Architecture (June 1988). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. 6.T. Wada, S. Rajan and S. A. Pryzybylski, "An Analytic Access Time Model for On-Chip Cache Memories," IEEE Journal of Sohd-State Czrcu~ts, Vol. 27, No. 8 (August 1992) pp. 1147-1156.Google ScholarGoogle ScholarCross RefCross Ref
  7. 7.J. J. Losq, G. S. Rao and H. E. Sachar, "Decode History Table for Conditional Branch instructions,'' U.S. Patent No. 4,477,872 (October 16, 1984).Google ScholarGoogle Scholar
  8. 8.R. E Kessler, R. Jooss, A. Lebeck and M. Hill, "Inexpensive Implementations of Set- Associativity," Proc. 16th {nternatzonal Syrup. on Computer Architecture, (June 1989). Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. 9.L. Liu, "Partial Address Directory for Cache Access,'' IBM Research Report, RC18803 (February 1993). Also published in IEEE Trans. on VLSI Systems, Vol. 2, No. 2 (June 1994) pp. 226-240.Google ScholarGoogle Scholar
  10. 10.J. M. Lee and A. Weinberger, "A Solution to the Synonym Problem," IBM Technical D~sclosure Bulletin, 22, 8A (January 1980), pp. 3331-3333.Google ScholarGoogle Scholar
  11. 11."3033 Processor Complex, Theory of Operation/Diagrams Manual (Vol. 4), Processor Storage Control Function (15SCF),'' IBM, Poughkeepsie, New York (1978).Google ScholarGoogle Scholar
  12. 12.A. J. Smith, "Characterizing the Storage Process and Its Effect on the Update of Memory for Write-Through," Journal of A CM, 26, 1 (January 1979). Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. 13.J. H. Chang, H. Chao and K. So, "Cache Design of a Sub-Micron CMOS System/370," Proc. ljth International Syrup. on Computer Architecture, (June 1987). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. 14.K. Hun, A. Hunt, L. Liu, J. Peir, D. Pruett and J. Temple, "Early Resolution of Address Translation in Cache Design," Proc. 1990 IEEE International Conf. on Computer Design (September 1990)Google ScholarGoogle Scholar
  15. 15.S. G. Tucker, "The IBM 3090 Systems: An Overview," IBM Systems Journal, 25, 6 (January 1986).Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. 16.J. R. Goodman. "Using Cache Memory to Reduce Processor Memory Traffic," Proc. l Oth Intl. Symp. on Computer Archztecture (May 1983) pp. 124-131. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Cache designs with partial address matching

            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
              MICRO 27: Proceedings of the 27th annual international symposium on Microarchitecture
              November 1994
              233 pages
              ISBN:0897917073
              DOI:10.1145/192724

              Copyright © 1994 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: 30 November 1994

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • Article

              Acceptance Rates

              Overall Acceptance Rate484of2,242submissions,22%

              Upcoming Conference

              MICRO '24

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader