• DocumentCode
    1053906
  • Title

    Concurrent support of multiple page sizes on a skewed associative TLB

  • Author

    Seznec, André

  • Author_Institution
    IRISA, Rennes, France
  • Volume
    53
  • Issue
    7
  • fYear
    2004
  • fDate
    7/1/2004 12:00:00 AM
  • Firstpage
    924
  • Lastpage
    927
  • Abstract
    Some architecture definitions (e.g., Alpha) allow the use of multiple virtual page sizes even for a single process. Unfortunately, on current set-associative TLBs (translation lookaside buffers), pages with different sizes cannot coexist together. Thus, processors supporting multiple page sizes implement fully associative TLBs. In this research note, we show how the skewed-associative TLB can accommodate the concurrent use of multiple page sizes within a single process. This allows us to envision either medium size L1 TLBs or very large L2 TLBs supporting multiple page sizes.
  • Keywords
    buffer storage; content-addressable storage; memory architecture; paged storage; table lookup; fully associative TLBs; multiple virtual page sizes; set-associative TLB; skewed-associative TLB; translation lookaside buffer; Proposals; 65; TLB; multiple page size; skewed associativity.;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/TC.2004.21
  • Filename
    1321052