On the public citation graph

Data redistribution in an automatic data distribution tool

0 signed · 18 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/bfb0014213openalex-snapshot

Automatic selection of dynamic data partitioning schemes for distributed-memory multicomputers

inferredcites →https://doi.org/10.1007/bfb0025871openalex-snapshot

Detecting and using affinity in an automatic data distribution tool

inferredcites →https://doi.org/10.1007/bfb0025872openalex-snapshot

Array distribution in data-parallel programs

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.86111openalex-snapshot

Compiling communication-efficient programs for massively parallel machines

inferredcites →https://doi.org/10.1109/fmpc.1990.89493openalex-snapshot

Index domain alignment: minimizing cost of cross-referencing between distributed arrays

inferredcites →https://doi.org/10.1145/143369.143377openalex-snapshot

Automatic data mapping for distributed-memory parallel computers

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_13openalex-snapshot

Compiler Optimization of Dynamic Data Distributions for Distributed-Memory Multicomputers

inferred← citeshttps://doi.org/10.1007/3-540-49530-4_6openalex-snapshot

Data Flow Analysis Driven Dynamic Data Partitioning

inferred← citeshttps://doi.org/10.1007/bfb0017244openalex-snapshot

Data distribution and loop parallelization for shared-memory multiprocessors

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.1109/cisis.2008.89openalex-snapshot

A Consistency Combination Algorithm for Global Dynamic Computation and Data Decomposition

inferred← citeshttps://doi.org/10.1109/iccad.2005.1560077openalex-snapshot

Two-dimensional data locality: definition, abstraction, and application

inferred← citeshttps://doi.org/10.1109/spdp.1996.570321openalex-snapshot

A framework for automatic dynamic data mapping

inferred← citeshttps://doi.org/10.1145/369028.369048openalex-snapshot

Dynamic data distribution with control flow analysis

inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.6181openalex-snapshot

Automatic Data and Computation Mapping for Distributed-Memory Machines.

inferred← citeshttps://doi.org/10.5555/1129601.1129641openalex-snapshot

2D data locality: definition, abstraction, and application

inferred← citeshttps://doi.org/10.5821/dissertation-2117-93296openalex-snapshot

Automatic data distribution for massively parallel processors

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.