Optimal mapping in direct mapped cache environments

DOI10.1007/BF01582076MaRDI QIDQ1327568zbMATH OpenOpenAlexFDO

Authors Shmuel Gal, Yaniv Hollander, Alon Itai

Publication date 19 June 1994

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01582076

zbMATH Keywords

direct mapped cachememory system

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20)

Recommendations

• Optimal Worst Case Formulas Comparing Cache Memory Associativity
• scientific article; zbMATH DE number 1305454
• The hardness of cache conscious data placement
• The hardness of cache conscious data placement
• An analysis of optimum caching

Cites work

• scientific article; zbMATH DE number 3571502 (Why is no real title available?)
• An analysis of optimum caching
• Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment
• Some Distribution-Free Aspects of Paging Algorithm Performance
• Structured Partitioning Problems

Cited in

(5)

• The hardness of cache conscious data placement
• Hierarchical binary set partitioning in cache memories
• Languages and Compilers for Parallel Computing
• Packing trees
• Optimal Worst Case Formulas Comparing Cache Memory Associativity

This page was built for publication: Optimal mapping in direct mapped cache environments

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