The hardness of cache conscious data placement

zbMATH Open1087.68021MaRDI QIDQ3369935FDOQ3369935

Authors: Erez Petrank, Dror Rawitz 

Publication date: 6 February 2006

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

zbMATH Keywords

NP optimization problems

Mathematics Subject Classification ID

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

Cited In (10)

• Placement algorithms for hierarchical cooperative caching
• The subset assignment problem for data placement in caches
• On the complexity of cache analysis for different replacement policies
• The hardness of cache conscious data placement
• Optimal mapping in direct mapped cache environments
• Title not available (Why is that?)
• The hardness of data packing
• A hierarchical model of data locality
• Approximation Algorithms for Data Placement Problems
• Remote memory references at block granularity

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)