The hardness of cache conscious data placement

DOI10.1145/503272.503283MaRDI QIDQ5178901zbMATH OpenOpenAlexFDO

Authors Erez Petrank, Dror Rawitz

Publication date 17 March 2015

Published in Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages (Search for Journal in Brave)

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

zbMATH Keywords

cache conscious code rearrangementcache conscious data placementcomputational complexityhardness of approximationmemory management

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) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• The hardness of cache conscious data placement
• The subset assignment problem for data placement in caches
• The subset assignment problem for data placement in caches
• Approximation Algorithms for Data Placement Problems
• Approximation algorithms for data placement on parallel disks
• scientific article; zbMATH DE number 1445307
• Cache investment
• scientific article; zbMATH DE number 1305451
• Placement algorithms for hierarchical cooperative caching

Cited in

(7)

• Optimal mapping in direct mapped cache environments
• The hardness of data packing
• Remote memory references at block granularity
• The hardness of cache conscious data placement
• Approximation Algorithms for Data Placement Problems
• 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 Q5178901)