On the public citation graph

A unified data-flow framework for optimizing communication

https://doi.org/10.1007/bfb0025884
0 signed · 46 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.1002/spe.4380200203openalex-snapshot
Structured dataflow analysis for arrays and its use in an optimizing compiler
inferredcites →https://doi.org/10.1007/3-540-57502-2_42openalex-snapshot
Compiler analysis for irregular problems in fortran D
inferredcites →https://doi.org/10.1007/3-540-57659-2_13openalex-snapshot
A framework for exploiting data availability to optimize communication
inferredcites →https://doi.org/10.1016/0167-8191(88)90002-6openalex-snapshot
SUPERB: A tool for semi-automatic MIMD/SIMD parallelization
inferredcites →https://doi.org/10.1016/s0022-0000(74)80049-8openalex-snapshot
Testing flow graph reducibility
inferredcites →https://doi.org/10.1109/71.86110openalex-snapshot
An implementation of interprocedural bounded regular section analysis
inferredcites →https://doi.org/10.1109/71.86111openalex-snapshot
Compiling communication-efficient programs for massively parallel machines
inferredcites →https://doi.org/10.1109/71.97901openalex-snapshot
Compiling global name-space parallel loops for distributed execution
inferredcites →https://doi.org/10.1109/icpp.1993.51openalex-snapshot
Automating Parallelism of Regular Computations for Distributed-Memory Multicomputers in the Paradigm Compiler
inferredcites →https://doi.org/10.1109/icpp.1993.58openalex-snapshot
Compilation Techniques for Optimizing Communication on Distributed-Memory Systems
inferredcites →https://doi.org/10.1145/125826.126714openalex-snapshot
Detecting redundant accesses to array data
inferredcites →https://doi.org/10.1145/135226.135230openalex-snapshot
Compiling Fortran D for MIMD distributed-memory machines
inferredcites →https://doi.org/10.1145/143095.143135openalex-snapshot
How to analyze large programs efficiently and informatively
inferredcites →https://doi.org/10.1145/143369.143433openalex-snapshot
A methodology for high-level synthesis of communication on multicomputers
inferredcites →https://doi.org/10.1145/155090.155102openalex-snapshot
Communication optimization and code generation for distributed memory machines
inferredcites →https://doi.org/10.1145/174223.158909openalex-snapshot
High performance Fortran language specification
inferredcites →https://doi.org/10.1145/359060.359069openalex-snapshot
Global optimization by suppression of partial redundancies
inferredcites →https://doi.org/10.1145/360018.360025openalex-snapshot
A program data flow analysis procedure
inferredcites →https://doi.org/10.1145/73141.74824openalex-snapshot
Process decomposition through locality of reference
inferredcites →https://doi.org/10.1145/78969.78963openalex-snapshot
An interval-based approach to exhaustive and incremental interprocedural data-flow analysis

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-61736-1_45openalex-snapshot
State of the art in compiling HPF
inferred← citeshttps://doi.org/10.1007/bf02577773openalex-snapshot
Combining flow and dependence analyses to expose redundant array accesses
inferred← citeshttps://doi.org/10.1007/bfb0014218openalex-snapshot
Interprocedural data flow based optimizations for compilation of irregular problems
inferred← citeshttps://doi.org/10.1007/bfb0017242openalex-snapshot
Cross-loop reuse analysis and its application to cache optimizations
inferred← citeshttps://doi.org/10.1007/bfb0017264openalex-snapshot
Resource-based communication placement analysis
inferred← citeshttps://doi.org/10.1007/bfb0100674openalex-snapshot
Advanced communication optimizations for data-parallel programs
inferred← citeshttps://doi.org/10.1109/71.707537openalex-snapshot
Interprocedural partial redundancy elimination with application to distributed memory compilation
inferred← citeshttps://doi.org/10.1109/71.895791openalex-snapshot
Minimizing data and synchronization costs in one-way communication
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750598openalex-snapshot
Interprocedural communication optimizations for message passing architectures
inferred← citeshttps://doi.org/10.1109/hipc.1996.565824openalex-snapshot
A communication placement framework with unified dependence and data-flow analysis
inferred← citeshttps://doi.org/10.1109/icpp.1998.708483openalex-snapshot
Minimizing data and synchronization costs in one-way communication
inferred← citeshttps://doi.org/10.1109/icpp.2004.1327910openalex-snapshot
Global partial replicate computation partitioning
inferred← citeshttps://doi.org/10.1109/icpp.2004.38openalex-snapshot
Global partial replicate computation partitioning
inferred← citeshttps://doi.org/10.1109/ipps.1995.395954openalex-snapshot
Combining dependence and data-flow analyses to optimize communication
inferred← citeshttps://doi.org/10.1109/ipps.1998.669892openalex-snapshot
A generalized framework for global communication optimization
inferred← citeshttps://doi.org/10.1109/tpds.2002.1011416openalex-snapshot
Distribution assignment placement: effective optimization of redistribution costs
inferred← citeshttps://doi.org/10.1145/207110.207157openalex-snapshot
Interprocedural partial redundancy elimination and its application to distributed memory compilation
inferred← citeshttps://doi.org/10.1145/224170.224336openalex-snapshot
Interprocedural compilation of irregular applications for distributed memory machines
inferred← citeshttps://doi.org/10.1145/224170.224422openalex-snapshot
An HPF compiler for the IBM SP2
inferred← citeshttps://doi.org/10.1145/3190619.3190638openalex-snapshot
SecureMR
inferred← citeshttps://doi.org/10.1145/330643.330647openalex-snapshot
A global communication optimization technique based on data-flow analysis and linear algebra
inferred← citeshttps://doi.org/10.1155/1997/790426openalex-snapshot
An Algebraic Machinery for Optimizing Data Motion for HPF
inferred← citeshttps://doi.org/10.1201/9781420040579.ch11openalex-snapshot
Compilation for Distributed Memory Architectures
inferred← citeshttps://doi.org/10.12694/scpe.v2i2.127openalex-snapshot
Aggressive Communication Optimizations for Clusters of Workstations.
inferred← citeshttps://doi.org/10.5555/522659.825662openalex-snapshot
Interprocedural distribution assignment placement: more than just enhancing intraprocedural placing techniques
inferred← citeshttps://doi.org/10.5753/sbac-pad.1999.19767openalex-snapshot
Performance Portability of XL HPF Compiler on IBM SP2 and SMP Multiprocessors
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.