On the public citation graph

Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors

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.
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-4615-3604-8_13openalex-snapshot
The MIT Alewife Machine: A Large-Scale Distributed-Memory Multiprocessor
inferredcites →https://doi.org/10.1007/bfb0017263openalex-snapshot
Communication-minimal partitioning of parallel loops and data arrays for cache-coherent distributed-memory multiprocessors
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(90)90086-5openalex-snapshot
Data optimization: Allocation of arrays to reduce communication on SIMD machines
inferredcites →https://doi.org/10.1109/71.127259openalex-snapshot
Demonstration of automatic data partitioning techniques for parallelizing compilers on multicomputers
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/71.86107openalex-snapshot
Compile-time partitioning of iterative parallel loops to reduce cache coherency traffic
inferredcites →https://doi.org/10.1109/71.97902openalex-snapshot
A loop transformation theory and an algorithm to maximize parallelism
inferredcites →https://doi.org/10.1109/71.97903openalex-snapshot
Compile-time techniques for data distribution in distributed memory machines
inferredcites →https://doi.org/10.1109/icpp.1993.49openalex-snapshot
Automatic Partitioning of Parallel Loops for Cache-Coherent Multiprocessors
inferredcites →https://doi.org/10.1145/135226.135230openalex-snapshot
Compiling Fortran D for MIMD distributed-memory machines
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/193209.193217openalex-snapshot
SUIF
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/223982.223985openalex-snapshot
The MIT Alewife machine

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45403-9_16openalex-snapshot
Advanced Code Generation for High Performance Fortran
inferred← citeshttps://doi.org/10.1007/3-540-45403-9_9openalex-snapshot
Optimal Tiling for Minimizing Communication in Distributed Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1007/bf02950408openalex-snapshot
Supporting flexible data distribution in software DSMs
inferred← citeshttps://doi.org/10.1007/bfb0057792openalex-snapshot
An efficient data partitioning method for limited memory embedded systems
inferred← citeshttps://doi.org/10.1016/s0167-8191(98)00025-8openalex-snapshot
Tools and techniques for automatic data layout: A case study
inferred← citeshttps://doi.org/10.1023/a:1007516818651openalex-snapshot
Index Set Splitting
inferred← citeshttps://doi.org/10.1109/71.914756openalex-snapshot
Exploiting wavefront parallelism on large-scale shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1109/csitss.2017.8447691openalex-snapshot
Concerto: A Program Parallelization, Orchestration and Distribution Infrastructure
inferred← citeshttps://doi.org/10.1109/ipps.1998.669887openalex-snapshot
Compiler optimization of implicit reductions for distributed memory multiprocessors
inferred← citeshttps://doi.org/10.1109/pact.1999.807572openalex-snapshot
On index set splitting
inferred← citeshttps://doi.org/10.1109/real.1998.739740openalex-snapshot
Compiler optimizations for real time execution of loops on limited memory embedded systems
inferred← citeshttps://doi.org/10.1145/1854273.1854335openalex-snapshot
Compiler-assisted data distribution for chip multiprocessors
inferred← citeshttps://doi.org/10.1145/2503210.2503285openalex-snapshot
Semi-automatic restructuring of offloadable tasks for many-core accelerators
inferred← citeshttps://doi.org/10.1145/509705.509706openalex-snapshot
Automatic data and computation decomposition on distributed memory parallel computers
inferred← citeshttps://doi.org/10.5555/520793.825729openalex-snapshot
On index set splitting
showing the first 15 of 16 · page through all 16
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.