On the public citation graph

Locality analysis for distributed shared-memory multiprocessors

https://doi.org/10.1007/bfb0017243
0 signed · 28 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-1-4684-6894-6openalex-snapshot
Dependence Analysis for Supercomputing
inferredcites →https://doi.org/10.1007/bfb0038674openalex-snapshot
On estimating and enhancing cache effectiveness
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.466632openalex-snapshot
Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors
inferredcites →https://doi.org/10.1109/88.219857openalex-snapshot
High performance Fortran
inferredcites →https://doi.org/10.1145/106972.106981openalex-snapshot
The cache performance and optimizations of blocked algorithms
inferredcites →https://doi.org/10.1145/113445.113449openalex-snapshot
A data locality optimizing algorithm
inferredcites →https://doi.org/10.1145/155090.155101openalex-snapshot
Global optimizations for parallelism and locality on scalable parallel machines
inferredcites →https://doi.org/10.1145/1925805.1925813openalex-snapshot
A compiler framework for restructuring data declarations to enhance cache and TLB effectiveness
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/237090.237205openalex-snapshot
Operating system support for improving data locality on CC-NUMA compute servers
inferredcites →https://doi.org/10.1155/1995/937016openalex-snapshot
Unfavorable Strides in Cache Memory Systems (RNR Technical Report RNR‐92‐015)

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1006/jpdc.1997.1310openalex-snapshot
Communication-Minimal Tiling of Uniform Dependence Loops
inferred← citeshttps://doi.org/10.1006/jpdc.1999.1552openalex-snapshot
A Matrix-Based Approach to Global Locality Optimization
inferred← citeshttps://doi.org/10.1006/jpdc.2000.1639openalex-snapshot
Compiler Algorithms for Optimizing Locality and Parallelism on Shared and Distributed-Memory Machines
inferred← citeshttps://doi.org/10.1007/3-540-45574-4_10openalex-snapshot
Experimental Evaluation of Energy Behavior of Iteration Space Tiling
inferred← citeshttps://doi.org/10.1007/3-540-49530-4_5openalex-snapshot
Loop Transformations for Hierarchical Parallelism and Locality
inferred← citeshttps://doi.org/10.1007/978-3-540-24644-2_6openalex-snapshot
Compiler-Assisted Cache Replacement: Problem Formulation and Performance Evaluation
inferred← citeshttps://doi.org/10.1007/bfb0032680openalex-snapshot
Quantifying the multi-level nature of tiling interactions
inferred← citeshttps://doi.org/10.1007/bfb0032681openalex-snapshot
Reuse-driven tiling for data locality
inferred← citeshttps://doi.org/10.1023/a:1018782528453openalex-snapshot
Quantifying the Multi-Level Nature of Tiling Interactions
inferred← citeshttps://doi.org/10.1109/aspdac.2002.995007openalex-snapshot
Strategies for improving data locality in embedded applications
inferred← citeshttps://doi.org/10.1109/ipps.1999.760558openalex-snapshot
A graph based framework to detect optimal memory layouts for improving data locality
inferred← citeshttps://doi.org/10.1109/tpds.2001.1184186openalex-snapshot
Static and dynamic locality optimizations using integer linear programming
inferred← citeshttps://doi.org/10.1145/305138.305247openalex-snapshot
An integer linear programming approach for optimizing cache locality
inferred← citeshttps://doi.org/10.1147/rd.413.0233openalex-snapshot
Automatic selection of high-order transformations in the IBM XL FORTRAN compilers
inferred← citeshttps://doi.org/10.3233/emc-2005-00048openalex-snapshot
Improving power efficiency with compiler-assisted cache replacement
inferred← citeshttps://doi.org/10.5555/522659.825639openalex-snapshot
Compiler algorithms for optimizing locality and parallelism on shared and distributed memory machines
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.