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

The TLB slice—a low-cost high-speed address translation mechanism

Authors Info & Claims
Published:01 May 1990Publication History

ABSTRACT

The MIPS R6000 microprocessor relies on a new type of translation lookaside buffer — called a TLB slice — which is less than one-tenth the size of a conventional TLB and as fast as one multiplexer delay, yet has a high enough hit rate to be practical. The fast translation makes it possible to use a physical cache without adding a translation stage to the processor's pipeline. The small size makes it possible to include address translation on-chip, even in a technology with a limited number of devices.

The key idea behind the TLB slice is to have both a virtual tag and a physical tag on a physically-indexed cache. Because of the virtual tag, the TLB slice needs to hold only enough physical page number bits — typically 4 to 8 — to complete the physical cache index, in contrast with a conventional TLB, which needs to hold both a virtual page number and a physical page number. The virtual page number is unnecessary because the TLB slice needs to provide only a hint for the translated physical address rather than a guarantee. The full physical page number is unnecessary because the cache hit logic is based on the virtual tag. Furthermore, if the cache is multi-level and references to the TLB slice are “shielded” by hits in a virtually indexed primary cache, the slice can get by with very few entries, once again lowering its cost and increasing its speed. With this mechanism, the simplicity of a physical cache can been combined with the speed of a virtual cache.

References

  1. Bcck84.John Beck ct. al., "A 3b Microprocessor with On-Chip Virtual Memory Management," 1984 IEEE Inrernational Solid Stnte Circlrits Conference, pp. 17- 170.Google ScholarGoogle Scholar
  2. Cheng87.Ray Cheng, Virtual Address Cache in UNIX, Proceedings of Summer 1987 USENIX Conference, pp. 217-224.Google ScholarGoogle Scholar
  3. Denning70.Peter J. Denning, Virtual Memory, Computing Surveys, vol. 2, no. 3, September 1970. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Goodman87.James R. Goodman, Coherency for Multiprocessor Virtual Address Caches, Proc. Second International Conference on Architectural Support for Programming Languages and Qerating Systems, October 1987, pp. 72-81. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Hill86.Mark Hill et. al., Design Decisions in SPUR, Computer vol. 19, no. 11, November 1986, pp. 8-22. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Kane87.Gerry Kane, MIPS RISC Architecture, Prentice-Hall, 19S7. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Lee60.F. F. Lee, Study of 'Look Aside' Memory, IEEE Transactions on Computers, vol. lS, no. 11, November 1960, pp. 1062-1064.Google ScholarGoogle Scholar
  8. Lee89.Ruby Lee, Precision Architecture, Computer, vol. 22, 110. 1, January 1989, pp. 78-91. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Przybylski89.Steven Przybylski, Mark Horowitz and John Hennessy, Characteristics of Performance-Optimal Multi-Level Cache Hierarchies, PrOC. Sixteenth IEEE/ACM International Sympositrm on Computer Architecture, June 1989, pp. 114-121. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Riordan89.Torn Riordan, G.P. Grewel, Simon Hsu, John Kinsel, Jeff Libby, Roger March, Marvin Mills, Paul Ries and Rancly Scoikld, System Design Using the MIPS R3OCO/3010 RISC Chipset, Digest o,f Papers Spring 1989 IEEE Compcon, pp. 494498.Google ScholarGoogle Scholar
  11. Roberts90.David Roberts, Tim Layman and George Taylor, An ECL Microprocessor Designed for Two-Level Cache, Digest of Papers Spring 1990 IEEE Compcon, pp. 228-231.Google ScholarGoogle Scholar
  12. Short88.Robert Short and Henry Levy, A Simulation Study of Two-Level Caches, Proc. Fifteenth IEEEIACM International Symposium on Computer Architecture, June 1988, pp. 81-88. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Smith82.Alan J. Smith, Cache Memories, Computing Surveys, vol. 14, no. 3, September 1982, pp. 473-530. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Wang89.Wen-Harm Wang, Jean-Loup Baer and Henry Levy, Organization and Performance of a Two-Level Virtual-l&l Cache Hierarchy, Proc. Skteenth IEEE/ACM International Simpositrum on Computer Architecture, June 19S9, pp. 140-14s. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Wood86.David Wood et. al., An In-Cache Address Translation Mechanism, Proc. Thirteenth. IEEE/ACM International Symposium on Computer Architecture, June 1986, pp. 358365. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. The TLB slice—a low-cost high-speed address translation mechanism

    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

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader