[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
article
Free access

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

Published: 01 May 1990 Publication 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]
John Beck ct. al., "A 3b Microprocessor with On-Chip Virtual Memory Management," 1984 IEEE Inrernational Solid Stnte Circlrits Conference, pp. 17- 170.
[2]
Ray Cheng, Virtual Address Cache in UNIX, Proceedings of Summer 1987 USENIX Conference, pp. 217-224.
[3]
Peter J. Denning, Virtual Memory, Computing Surveys, vol. 2, no. 3, September 1970.
[4]
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.
[5]
Mark Hill et. al., Design Decisions in SPUR, Computer vol. 19, no. 11, November 1986, pp. 8-22.
[6]
Gerry Kane, MIPS RISC Architecture, Prentice-Hall, 19S7.
[7]
F. F. Lee, Study of 'Look Aside' Memory, IEEE Transactions on Computers, vol. lS, no. 11, November 1960, pp. 1062-1064.
[8]
Ruby Lee, Precision Architecture, Computer, vol. 22, 110. 1, January 1989, pp. 78-91.
[9]
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.
[10]
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.
[11]
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.
[12]
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.
[13]
Alan J. Smith, Cache Memories, Computing Surveys, vol. 14, no. 3, September 1982, pp. 473-530.
[14]
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.
[15]
David Wood et. al., An In-Cache Address Translation Mechanism, Proc. Thirteenth. IEEE/ACM International Symposium on Computer Architecture, June 1986, pp. 358365.

Cited By

View all
  • (2023)Secure Speculation via Speculative Secret Flow TrackingJournal of Computer Science and Technology10.1007/s11390-021-1249-438:2(422-438)Online publication date: 30-Mar-2023
  • (2021)Validation of Side-Channel Models via Observation RefinementMICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3466752.3480130(578-591)Online publication date: 18-Oct-2021
  • (2020)Validation of Abstract Side-Channel Models for Computer ArchitecturesComputer Aided Verification10.1007/978-3-030-53288-8_12(225-248)Online publication date: 21-Jul-2020
  • Show More Cited By

Index Terms

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

    Recommendations

    Comments

    Please enable JavaScript to view thecomments powered by Disqus.

    Information & Contributors

    Information

    Published In

    cover image ACM SIGARCH Computer Architecture News
    ACM SIGARCH Computer Architecture News  Volume 18, Issue 2SI
    Special Issue: Proceedings of the 17th annual international symposium on Computer Architecture
    June 1990
    356 pages
    ISSN:0163-5964
    DOI:10.1145/325096
    Issue’s Table of Contents

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 01 May 1990
    Published in SIGARCH Volume 18, Issue 2SI

    Check for updates

    Qualifiers

    • Article

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)144
    • Downloads (Last 6 weeks)30
    Reflects downloads up to 15 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2023)Secure Speculation via Speculative Secret Flow TrackingJournal of Computer Science and Technology10.1007/s11390-021-1249-438:2(422-438)Online publication date: 30-Mar-2023
    • (2021)Validation of Side-Channel Models via Observation RefinementMICRO-54: 54th Annual IEEE/ACM International Symposium on Microarchitecture10.1145/3466752.3480130(578-591)Online publication date: 18-Oct-2021
    • (2020)Validation of Abstract Side-Channel Models for Computer ArchitecturesComputer Aided Verification10.1007/978-3-030-53288-8_12(225-248)Online publication date: 21-Jul-2020
    • (2018)Co-Scheduling HPC Workloads on Cache-Partitioned CMP Platforms2018 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/CLUSTER.2018.00052(348-358)Online publication date: Sep-2018
    • (2018)Keeping up with Real TimeAdvances in Aeronautical Informatics10.1007/978-3-319-75058-3_9(121-133)Online publication date: 11-May-2018
    • (2017)Towards "Full Containerization" in Containerized Network Function VirtualizationACM SIGARCH Computer Architecture News10.1145/3093337.303771345:1(467-481)Online publication date: 4-Apr-2017
    • (2017)Towards "Full Containerization" in Containerized Network Function VirtualizationACM SIGPLAN Notices10.1145/3093336.303771352:4(467-481)Online publication date: 4-Apr-2017
    • (2017)Towards "Full Containerization" in Containerized Network Function VirtualizationACM SIGOPS Operating Systems Review10.1145/3093315.303771351:2(467-481)Online publication date: 4-Apr-2017
    • (2017)Towards "Full Containerization" in Containerized Network Function VirtualizationProceedings of the Twenty-Second International Conference on Architectural Support for Programming Languages and Operating Systems10.1145/3037697.3037713(467-481)Online publication date: 4-Apr-2017
    • (2017)Near-Memory Address Translation2017 26th International Conference on Parallel Architectures and Compilation Techniques (PACT)10.1109/PACT.2017.56(303-317)Online publication date: Sep-2017
    • Show More Cited By

    View Options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Login options

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media