Concurrent support of multiple page sizes on a skewed associative TLB
- 9 August 2004
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 53 (7), 924-927
- https://doi.org/10.1109/tc.2004.21
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.This publication has 9 references indexed in Scilit:
- Acase For Two-way Skewed-associative CachesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Increasing TLB reach using superpages backed by shadow memoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Recency-based TLB preloadingACM SIGARCH Computer Architecture News, 2000
- Using the SimOS machine simulator to study complex computer systemsACM Transactions on Modeling and Computer Simulation, 1997
- Surpassing the TLB performance of superpages with less operating system supportPublished by Association for Computing Machinery (ACM) ,1994
- Architectural support for translation table management in large address space machinesPublished by Association for Computing Machinery (ACM) ,1993
- Skewed-associative cachesLecture Notes in Computer Science, 1993
- Tradeoffs in supporting two page sizesPublished by Association for Computing Machinery (ACM) ,1992
- The interaction of architecture and operating system designPublished by Association for Computing Machinery (ACM) ,1991