The hardness of data packing

DOI10.1145/2837614.2837669zbMATH Open1347.68172OpenAlexW2295173494WikidataQ131025502 ScholiaQ131025502MaRDI QIDQ2828259FDOQ2828259

Authors: Rahman Lavaee 

Publication date: 24 October 2016

Published in: Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (Search for Journal in Brave)

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

Recommendations

• The hardness of cache conscious data placement
• The hardness of cache conscious data placement
• Packing trees
• How to Pack Trees
• scientific article; zbMATH DE number 1956474

zbMATH Keywords

data packingblock reuse intervalcache block utilizationproximity hypergraph

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical problems of computer architecture (68M07)

Cited In (4)

• The hardness of cache conscious data placement
• A hierarchical model of data locality
• Variable-sized object packing and its applications to instruction cache design
• Remote memory references at block granularity

This page was built for publication: The hardness of data packing

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