On the public citation graph

Partitioning and mapping of nested loops for linear array multicomputers

0 signed · 30 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.1016/0743-7315(90)90004-9openalex-snapshot
Task allocation onto a hypercube by recursive mincut bipartitioning
inferredcites →https://doi.org/10.1016/0743-7315(92)90030-qopenalex-snapshot
A solution of the cache ping-pong problem in multiprocessor systems
inferredcites →https://doi.org/10.1109/12.123395openalex-snapshot
Independent partitioning of algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/12.30873openalex-snapshot
Minimum distance: a method for partitioning recurrences for multiprocessors
inferredcites →https://doi.org/10.1109/12.75137openalex-snapshot
Partitioning problems in parallel, pipeline, and distributed computing
inferredcites →https://doi.org/10.1109/12.90251openalex-snapshot
Time optimal linear schedules for algorithms with uniform dependencies
inferredcites →https://doi.org/10.1109/71.149968openalex-snapshot
Synchronization and communication costs of loop partitioning on shared-memory multiprocessor systems
inferredcites →https://doi.org/10.1109/71.308531openalex-snapshot
Communication-free data allocation techniques for parallelizing compilers on multicomputers
inferredcites →https://doi.org/10.1109/71.80176openalex-snapshot
Pipelined data parallel algorithms-II: design
inferredcites →https://doi.org/10.1109/71.97900openalex-snapshot
Partitioning and mapping nested loops on multiprocessor systems
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/massp.1985.1163741openalex-snapshot
VLSI Array processors
inferredcites →https://doi.org/10.1109/tc.1979.1675434openalex-snapshot
Time and Parallel Processor Bounds for Fortran-Like Loops
inferredcites →https://doi.org/10.1109/tc.1987.5009494openalex-snapshot
Nearest-Neighbor Mapping of Finite Element Graphs onto Processor Meshes
inferredcites →https://doi.org/10.1145/3392717.3400034openalex-snapshot
Optimizing supercompilers for supercomputers
inferredcites →https://doi.org/10.1145/360827.360844openalex-snapshot
The parallel execution of DO loops
inferredcites →https://doi.org/10.1145/76263.76335openalex-snapshot
A methodology for parallelizing programs for multicomputers and complex memory multiprocessors
inferredcites →https://doi.org/10.1145/76263.76337openalex-snapshot
More iteration space tiling
inferredcites →https://doi.org/10.1145/7902.7904openalex-snapshot
Advanced compiler optimizations for supercomputers

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-39999-2_10openalex-snapshot
Skewed Data Partition and Alignment Techniques for Compiling Programs on Distributed Memory Multicomputers
inferred← citeshttps://doi.org/10.1007/s11227-005-0298-8openalex-snapshot
Hyperplane Grouping and Pipelined Schedules: How to Execute Tiled Loops Fast on Clusters of SMPs
inferred← citeshttps://doi.org/10.1023/a:1013683521693openalex-snapshot
Skewed Data Partition and Alignment Techniques for Compiling Programs on Distributed Memory Multicomputers
inferred← citeshttps://doi.org/10.1109/71.879777openalex-snapshot
Chain grouping: a method for partitioning loops onto mesh-connected processor arrays
inferred← citeshttps://doi.org/10.1109/icpp.2000.876163openalex-snapshot
Evaluation of loop grouping methods based on orthogonal projection spaces
inferred← citeshttps://doi.org/10.1109/icpp.2009.19openalex-snapshot
Efficient Scheduling of Nested Parallel Loops on Multi-Core Systems
inferred← citeshttps://doi.org/10.1109/icppw.2002.1039778openalex-snapshot
A pipelined execution of tiled nested loops on SMPs with computation and communication overlapping
inferred← citeshttps://doi.org/10.1109/tpds.2003.1239870openalex-snapshot
An efficient code generation technique for tiled iteration spaces
inferred← citeshttps://doi.org/10.1145/1534530.1534551openalex-snapshot
Cache-aware partitioning of multi-dimensional iteration spaces
inferred← citeshttps://doi.org/10.12681/eadd/16956openalex-snapshot
Algorithms design for the parallelization of nested loops
inferred← citeshttps://doi.org/10.2495/hpc000191openalex-snapshot
Partitioning And Mapping Nested Loops On Multicomputer
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.