Improving data locality by chunking
From MaRDI portal
Recommendations
- Improving whole-program locality using intra-procedural and inter-procedural transformations
- Restructuring computations for temporal data cache locality
- Data-centric transformations for locality enhancement
- Memory system support for dynamic cache line assembly
- Arranging program statements for locality on the basis of neighbourhood preferences
Cited in
(17)- Restructuring computations for temporal data cache locality
- Reducing cache conflicts by multi-level cache partitioning and array elements mapping
- Improving whole-program locality using intra-procedural and inter-procedural transformations
- Improving effective bandwidth through compiler enhancement of global cache reuse
- Predicting locality phases for dynamic memory optimization
- Array unification: A locality optimization technique
- The hardness of data packing
- Locality approximation using time
- Memory system support for dynamic cache line assembly
- Structuring statement sequences in instance-based locality optimization
- Data sequence locality: A generalization of temporal locality
- Memory cache and lisp
- scientific article; zbMATH DE number 2090593 (Why is no real title available?)
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
- Languages and Compilers for Parallel Computing
- Languages and Compilers for Parallel Computing
- Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies
This page was built for publication: Improving data locality by chunking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4417808)
