A new page table for 64-bit address spaces
- 1 January 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- Vol. 29 (5) , 184-200
- https://doi.org/10.1145/224056.224071
Abstract
Most computer architectures are moving to 64-bit virtual address spaces. We first discuss how this change impacts conventional linear, forwardmapped, and hashed page tables. We then introduce a new page table data structure—clustered page fable—that can be viewed as a hashed page table augmented with subblocking. Specifically, it associates mapping information for several pages (e.g., sixteen) with a single virtual tag and next pointer. Simulation results with several workloads show that clustered page tables use less memory than alternatives without adversely affecting page table access time.Keywords
This publication has 0 references indexed in Scilit: