On the public citation graph
Enhancing spatial locality via data layout optimizations
0 signed · 32 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/jpdc.2000.1639openalex-snapshot
Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines
inferredcites →https://doi.org/10.1007/bfb0038675openalex-snapshot
Reduction of cache coherence overhead by compiler data layout and loop transformation
inferredcites →https://doi.org/10.1016/0743-7315(88)90014-7openalex-snapshot
Strategies for cache and local memory management by global program transformation
inferredcites →https://doi.org/10.1109/71.97903openalex-snapshot
Compile-time techniques for data distribution in distributed memory machines
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/113446.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/195473.195557openalex-snapshot
Compiler optimizations for improving data locality
inferredcites →https://doi.org/10.1145/207110.207145openalex-snapshot
Unifying data and control transformations for distributed shared-memory machines
inferredcites →https://doi.org/10.1145/209936.209954openalex-snapshot
Data and computation transformations for multiprocessors
inferredcites →https://doi.org/10.1145/209936.209955openalex-snapshot
Reducing false sharing on shared memory multiprocessors through compile time data transformations
inferredcites →https://doi.org/10.1145/209937.209954openalex-snapshot
Data and computation transformations for multiprocessors
inferredcites →https://doi.org/10.1145/224538.224541openalex-snapshot
Compiler cache optimizations for banded matrix problems
inferredcites →https://doi.org/10.1145/233561.233564openalex-snapshot
Improving data locality with loop transformations
inferredcites →https://doi.org/10.1145/263580.263650openalex-snapshot
A compiler algorithm for optimizing locality in loop nests
inferredcites →https://doi.org/10.1145/277830.277849openalex-snapshot
A hyperplane based approach for optimizing spatial locality in loop nests
inferredcites →https://doi.org/10.1145/77626.79170openalex-snapshot
A set of level 3 basic linear algebra subprograms
inferredcites →https://doi.org/10.5555/522659.825639openalex-snapshot
Compiler algorithms for optimizing locality and parallelism on shared and distributed memory machines
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.1018openalex-snapshot
Is Morton layout competitive for large two‐dimensional arrays yet?
inferred← citeshttps://doi.org/10.1007/3-540-44905-1_1openalex-snapshot
High Performance Numerical Computing in Java: Language and Compiler Issues
inferred← citeshttps://doi.org/10.1007/3-540-45706-2_37openalex-snapshot
Is Morton Layout Competitive for Large Two-Dimensional Arrays?
inferred← citeshttps://doi.org/10.1016/j.future.2013.10.020openalex-snapshot
Architectural investigation of matrix data layout on multicore processors
inferred← citeshttps://doi.org/10.1016/j.simpat.2019.102043openalex-snapshot
Spatio-Fog: A green and timeliness-oriented fog computing model for geospatial query resolution
inferred← citeshttps://doi.org/10.1109/asp-dac47756.2020.9045410openalex-snapshot
Emerging memories as enablers for in-memory layout transformation acceleration and virtualization
inferred← citeshttps://doi.org/10.1109/micro.2018.00073openalex-snapshot
MDACache: Caching for Multi-Dimensional-Access Memories
inferred← citeshttps://doi.org/10.1109/micro50266.2020.00055openalex-snapshot
D-SOAP: Dynamic Spatial Orientation Affinity Prediction for Caching in Multi-Orientation Memory Systems
inferred← citeshttps://doi.org/10.1109/pact.1999.807526openalex-snapshot
Localizing non-affine array references
inferred← citeshttps://doi.org/10.1145/3314221.3314644openalex-snapshot
Huron: hybrid false sharing detection and repair
inferred← citeshttps://doi.org/10.1145/3552326.3587440openalex-snapshot
ALT: Breaking the Wall between Data Layout and Loop Optimizations for Deep Learning Compilation
inferred← citeshttps://doi.org/10.1145/3578244.3583723openalex-snapshot
Systematically Exploring High-Performance Representations of Vector Fields Through Compile-Time Composition
inferred← citeshttps://doi.org/10.1147/sj.391.0021openalex-snapshot
Java programming for high-performance numerical computing
inferred← citeshttps://doi.org/10.1155/2001/61965openalex-snapshot
A Systematic Approach to Reduce the System Bus Load and Power in Multimedia Algorithms
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.