The hardness of cache conscious data placement

MaRDI QIDQ3369935zbMATH OpenFDO

Authors Erez Petrank, Dror Rawitz

Publication date 6 February 2006

zbMATH Keywords

NP optimization problems

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Approximation algorithms (68W25)

Recommendations

• The hardness of cache conscious data placement
• The hardness of data packing
• A hierarchical model of data locality
• Approximation Algorithms for Data Placement Problems
• Optimal mapping in direct mapped cache environments

Cited in

(10)

• Optimal mapping in direct mapped cache environments
• Placement algorithms for hierarchical cooperative caching
• The hardness of data packing
• Remote memory references at block granularity
• Approximation Algorithms for Data Placement Problems
• scientific article; zbMATH DE number 1305451 (Why is no real title available?)
• The hardness of cache conscious data placement
• On the complexity of cache analysis for different replacement policies
• A hierarchical model of data locality
• The subset assignment problem for data placement in caches

This page was built for publication: The hardness of cache conscious data placement

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