The hardness of cache conscious data placement

Conference Record of the Annual ACM Symposium on Principles of Programming Languages

Volumn , Issue , 2002, Pages 101-112

  Petrank, Erez ^a   Rawitz, Dror ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Cache conscious code rearrangement; Cache conscious data placement; Computational complexity; Hardness of approximation; Memory management

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; OPTIMIZATION; STORAGE ALLOCATION (COMPUTER);

CACHE CONSCIOUS CODE REARRANGEMENT; CACHE CONSCIOUS DATA PLACEMENT; MEMORY MANAGEMENT;

PROGRAMMING THEORY;

EID: 0036040497     PISSN: 07308566     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/503272.503283     Document Type: Conference Paper

References (24)

1. Hardness of approximations
2. Proof verification and the hardness of approximation problems
3. Probabilistic checking of proofs: A new characterization of NP
4. Free bits, PCPs, and nonapproximability - Towards tight results
5. Reducing garbage collector cache misses
6. Cache-conscious data placement
7. Cache-conscious structure definition
8. Cache-conscious structure layout
9. Using generational garbage collection to implement cache-conscious data placement
10. Approximating clique is almost NP-complete
11. Zero knowledge and the chromatic number
12. Procedure placement using temporal-ordering information
13. 1-ε
14. FDPR - A post-link optimization tool for large subsystems
15. Improving data locality with loop transformations
16. Eliminating conflict misses for high performance architectures
17. Profile-directed restructuring of operating system code