On the public citation graph

Hierarchical compilation of macro dataflow graphs for multiprocessors with local memory

0 signed · 34 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/bf02187679openalex-snapshot
Covering a square by small perimeter rectangles
inferredcites →https://doi.org/10.1016/0166-218x(87)90061-8openalex-snapshot
The decomposition of a square into rectangles of minimal perimeter
inferredcites →https://doi.org/10.1109/12.29467openalex-snapshot
Utilizing multidimensional loop parallelism on large scale parallel processor systems
inferredcites →https://doi.org/10.1109/71.113083openalex-snapshot
Efficient processor assignment algorithms and loop transformations for executing nested parallel loops on 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/tc.1987.1676921openalex-snapshot
Distributing Hot-Spot Addressing in Large-Scale Multiprocessors
inferredcites →https://doi.org/10.1137/0217077openalex-snapshot
The Decomposition of a Rectangle into Rectangles of Minimal Perimeter
inferredcites →https://doi.org/10.1145/113379.113399openalex-snapshot
Generalised multiprocessor scheduling using optimal control
inferredcites →https://doi.org/10.1145/125826.126138openalex-snapshot
A fast static scheduling algorithm for DAGs on an unbounded number of processors
inferredcites →https://doi.org/10.1145/69624.357206openalex-snapshot
Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors
inferredcites →https://doi.org/10.1145/73141.74825openalex-snapshot
Mul-T: a high-performance parallel Lisp
inferredcites →https://doi.org/10.1145/76263.76337openalex-snapshot
More iteration space tiling

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_9openalex-snapshot
Optimal Tiling for Minimizing Communication in Distributed Shared-Memory Multiprocessors
inferred← citeshttps://doi.org/10.1007/978-1-84882-310-5_5openalex-snapshot
Parallel Tasks
inferred← citeshttps://doi.org/10.1007/bf01942605openalex-snapshot
The Optimal Control Approach to Generalized Multiprocessor Scheduling
inferred← citeshttps://doi.org/10.1007/bfb0024749openalex-snapshot
Generalized multiprocessor scheduling
inferred← citeshttps://doi.org/10.1016/j.parco.2006.08.004openalex-snapshot
An improved two-step algorithm for task and data parallel scheduling in distributed memory machines
inferred← citeshttps://doi.org/10.1109/12.599897openalex-snapshot
Compile-time scheduling of dynamic constructs in dataflow program graphs
inferred← citeshttps://doi.org/10.1109/71.466632openalex-snapshot
Automatic partitioning of parallel loops and data arrays for distributed shared-memory multiprocessors
inferred← citeshttps://doi.org/10.1109/71.506703openalex-snapshot
Generalized multiprocessor scheduling and applications to matrix computations
inferred← citeshttps://doi.org/10.1109/71.642945openalex-snapshot
A framework for exploiting task and data parallelism on distributed memory multicomputers
inferred← citeshttps://doi.org/10.1109/icpp.2001.952048openalex-snapshot
A low-cost approach towards mixed task and data parallel scheduling
inferred← citeshttps://doi.org/10.1109/ipdps.2001.924977openalex-snapshot
CPR: mixed task and data parallel scheduling for distributed systems
inferred← citeshttps://doi.org/10.1109/superc.1994.344283openalex-snapshot
Generalized multiprocessor scheduling for directed acyclic graphs
inferred← citeshttps://doi.org/10.1145/3168832openalex-snapshot
Transforming loop chains via macro dataflow graphs
inferred← citeshttps://doi.org/10.1145/3179541.3168832openalex-snapshot
Transforming loop chains via macro dataflow graphs
inferred← citeshttps://doi.org/10.1145/3489469openalex-snapshot
Hierarchical Scheduling of an SDF/L Graph onto Multiple Processors
inferred← citeshttps://doi.org/10.1145/602770.602812openalex-snapshot
Generalized multiprocessor scheduling for directed acylic graphs
inferred← citeshttps://doi.org/10.1186/s40064-016-2808-yopenalex-snapshot
An iterative expanding and shrinking process for processor allocation in mixed-parallel workflow scheduling
inferred← citeshttps://doi.org/10.18122/td/1654/boisestateopenalex-snapshot
Polyhedral+Dataflow Graphs
inferred← citeshttps://doi.org/10.5555/602770.602812openalex-snapshot
Generalized multiprocessor scheduling for directed acyclic graphs
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.