The hardness of cache conscious data placement

DOI10.1145/503272.503283zbMath1323.68320OpenAlexW2024023641MaRDI QIDQ5178901

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

computational complexitymemory managementhardness of approximationcache conscious code rearrangementcache conscious data placement

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) 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)

Related Items (1)

Unnamed Item

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