Paging and the address-translation problem

DOI10.1145/3737700MaRDI QIDQ6907348zbMATH OpenFDO

Authors Michael A. Bender, Abhishek Bhattacharjee, Alex Conway, Martin Farach-Colton, Rob Johnson, Sudarsun Kannan, William Kuszmaul, Nirjhar Mukherjee, Don Porter, Guido Tagliavini, Janet Vorobyeva, Evan West

Publication date 3 November 2025

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1145/3737700

zbMATH Keywords

address translationhashingiceberg hashingpagingTLBvirtual memory

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• Cache-oblivious algorithms
• Closing the Gap Between Theory and Practice: New Measures for On-Line Algorithm Analysis
• Competitive algorithms for restricted caching and matroid caching
• Competitive paging algorithms
• How asymmetry helps load balancing
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 1301967 (Why is no real title available?)
• scientific article; zbMATH DE number 1303544 (Why is no real title available?)
• scientific article; zbMATH DE number 1947417 (Why is no real title available?)
• scientific article; zbMATH DE number 2079385 (Why is no real title available?)
• scientific article; zbMATH DE number 1445384 (Why is no real title available?)
• Iceberg hashing: optimizing many hash-table criteria at once
• On the relative dominance of paging algorithms
• On-line restricted caching
• The relative worst-order ratio applied to paging
• The working set model for program behavior
• The Worst Page-Replacement Policy
• Tiny pointers

This page was built for publication: Paging and the address-translation problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6907348)