On the public citation graph

A generalized basic-cycle calculation method for efficient array redistribution

0 signed · 58 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/(sici)1096-9128(199611)8:9<707::aid-cpe269>3.0.co;2-vopenalex-snapshot
Redistribution of block‐cyclic data distributions using MPI
inferredcites →https://doi.org/10.1006/jpdc.1994.1048openalex-snapshot
Generating Communication for Array Statements: Design, Implementation, and Evaluation
inferredcites →https://doi.org/10.1006/jpdc.1995.1049openalex-snapshot
Generating Local Addresses and Communication Sets for Data-Parallel Programs
inferredcites →https://doi.org/10.1006/jpdc.1996.0011openalex-snapshot
Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines
inferredcites →https://doi.org/10.1006/jpdc.1996.0140openalex-snapshot
Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors
inferredcites →https://doi.org/10.1006/jpdc.1996.0142openalex-snapshot
Optimizations for Efficient Array Redistribution on Distributed Memory Multicomputers
inferredcites →https://doi.org/10.1006/jpdc.1996.0144openalex-snapshot
Efficient Index Set Generation for Compiling HPF Array Statements on Distributed-Memory Machines
inferredcites →https://doi.org/10.1006/jpdc.1997.1351openalex-snapshot
Fast Runtime Block Cyclic Data Redistribution on Multiprocessors
inferredcites →https://doi.org/10.1007/3-540-58184-7_112openalex-snapshot
A new approach to array redistribution: Strip mining redistribution
inferredcites →https://doi.org/10.1007/pl00008265openalex-snapshot
Efficient Algorithms for Block-Cyclic Redistribution of Arrays
inferredcites →https://doi.org/10.1016/0167-8191(95)00027-lopenalex-snapshot
Optimization of array redistribution for distributed memory multicomputers
inferredcites →https://doi.org/10.1109/71.476166openalex-snapshot
Processor mapping techniques toward efficient data redistribution
inferredcites →https://doi.org/10.1109/71.506697openalex-snapshot
Efficient algorithms for array redistribution
inferredcites →https://doi.org/10.1109/71.667897openalex-snapshot
A basic-cycle calculation technique for efficient dynamic data redistribution
inferredcites →https://doi.org/10.1109/fmpc.1995.380436openalex-snapshot
Automatic generation of efficient array redistribution routines for distributed memory multicomputers
inferredcites →https://doi.org/10.1109/hicss.1996.495504openalex-snapshot
Compiler techniques for determining data distribution and generating communication sets on distributed-memory machines
inferredcites →https://doi.org/10.1109/icpp.1997.622650openalex-snapshot
Efficient algorithms for multi-dimensional block-cyclic redistribution of arrays
inferredcites →https://doi.org/10.1109/ipps.1995.395968openalex-snapshot
Multi-phase array redistribution: modeling and evaluation
inferredcites →https://doi.org/10.1109/shpcc.1992.232670openalex-snapshot
A look at scalable dense linear algebra libraries
inferredcites →https://doi.org/10.1109/shpcc.1994.296659openalex-snapshot
Runtime array redistribution in HPF programs
inferredcites →https://doi.org/10.1109/splc.1994.377002openalex-snapshot
DaReL: a portable data redistribution library for distributed-memory machines
inferredcites →https://doi.org/10.1137/1.9781611970999openalex-snapshot
Computational Frameworks for the Fast Fourier Transform
inferredcites →https://doi.org/10.1145/125826.125890openalex-snapshot
Compile-time generation of regular communications patterns
inferredcites →https://doi.org/10.1145/174223.158909openalex-snapshot
High performance Fortran language specification
inferredcites →https://doi.org/10.1145/181181.181563openalex-snapshot
An approach to communication-efficient data redistribution
inferredcites →https://doi.org/10.1145/224538.224558openalex-snapshot
Efficient address generation for block-cyclic distributions
inferredcites →https://doi.org/10.1145/2591635.2667169openalex-snapshot
Compilation techniques for block-cyclic distributions
inferredcites →https://doi.org/10.13140/rg.2.1.1568.4968openalex-snapshot
Fortran D Language Specification

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11535294_19openalex-snapshot
Efficient Communication Scheduling Methods for Irregular Data Redistribution in Parallelizing Compilers
inferred← citeshttps://doi.org/10.1007/11572961_24openalex-snapshot
Irregular Redistribution Scheduling by Partitioning Messages
inferred← citeshttps://doi.org/10.1007/11942634_23openalex-snapshot
An Efficient Parallel Algorithm for Ultrametric Tree Construction Based on 3PR
inferred← citeshttps://doi.org/10.1007/978-3-030-10549-5_14openalex-snapshot
ASPEN: An Efficient Algorithm for Data Redistribution Between Producer and Consumer Grids
inferred← citeshttps://doi.org/10.1007/978-3-540-73940-1_50openalex-snapshot
ISO: Comprehensive Techniques Toward Efficient GEN_BLOCK Redistribution with Multidimensional Arrays
inferred← citeshttps://doi.org/10.1007/978-3-540-74450-4_32openalex-snapshot
On the Complexity of the Max-Edge-Coloring Problem with Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-540-74742-0_19openalex-snapshot
Efficient Multidimensional Data Redistribution for Resizable Parallel Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-13119-6_25openalex-snapshot
Message Clustering Technique towards Efficient Irregular Data Redistribution in Clusters and Grids
inferred← citeshttps://doi.org/10.1007/978-3-642-14822-4_8openalex-snapshot
A Compound Scheduling Strategy for Irregular Array Redistribution in Cluster Based Parallel System
inferred← citeshttps://doi.org/10.1007/978-3-642-22947-3_11openalex-snapshot
CAD: An Efficient Data Management and Migration Scheme across Clouds for Data-Intensive Scientific Applications
inferred← citeshttps://doi.org/10.1007/s11227-006-0024-1openalex-snapshot
Scheduling contention-free irregular redistributions in parallelizing compilers
inferred← citeshttps://doi.org/10.1007/s11227-006-6615-zopenalex-snapshot
An Efficient Communication Scheduling Method for the Processor Mapping Technique Applied Data Redistribution
inferred← citeshttps://doi.org/10.1007/s11227-007-0166-9openalex-snapshot
A flexible processor mapping technique toward data localization for block-cyclic data redistribution
inferred← citeshttps://doi.org/10.1007/s11227-009-0280-yopenalex-snapshot
Communication-free data alignment for arrays with exponential references in parallelizing compilers for scalable parallel systems
inferred← citeshttps://doi.org/10.1016/j.future.2008.10.009openalex-snapshot
Message scheduling for array re-decomposition on distributed memory systems
inferred← citeshttps://doi.org/10.1016/j.jpdc.2004.12.001openalex-snapshot
Improving communication scheduling for array redistribution
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00002-xopenalex-snapshot
Efficient communication sets generation for block–cyclic distribution on distributed-memory machines
inferred← citeshttps://doi.org/10.1023/a:1011602732570openalex-snapshot
A Framework for Efficient Data Redistribution on Distributed Memory Multicomputers
inferred← citeshttps://doi.org/10.1023/a:1015313917431openalex-snapshot
Scheduling GEN_BLOCK Array Redistribution
inferred← citeshttps://doi.org/10.1023/b:supe.0000026846.74050.18openalex-snapshot
A Compressed Diagonals Remapping Technique for Dynamic Data Redistribution on Banded Sparse Matrix
inferred← citeshttps://doi.org/10.1109/cluster49012.2020.00032openalex-snapshot
Flexible Data Redistribution in a Task-Based Runtime System
inferred← citeshttps://doi.org/10.1109/cw.2002.1180859openalex-snapshot
Data redistribution using MPI user-defined types
inferred← citeshttps://doi.org/10.1109/icppw.2002.1039784openalex-snapshot
Optimization of sparse matrix redistribution on multicomputers
inferred← citeshttps://doi.org/10.1109/ispan.2004.1300483openalex-snapshot
Processor mapping technique for communication free data redistribution on symmetrical matrix
inferred← citeshttps://doi.org/10.1109/tpds.2004.1264783openalex-snapshot
Using elementary linear algebra to solve data alignment for arrays with linear or quadratic references
inferred← citeshttps://doi.org/10.1109/tpds.2006.162openalex-snapshot
Optimizing Communications of Dynamic Data Redistribution on Symmetrical Matrices in Parallelizing Compilers
inferred← citeshttps://doi.org/10.1109/tpds.2021.3131657openalex-snapshot
Evaluating Data Redistribution in PaRSEC
inferred← citeshttps://doi.org/10.1504/ijahuc.2010.035537openalex-snapshot
A Two-Level Scheduling Strategy for optimising communications of data parallel programs in clusters
inferred← citeshttps://doi.org/10.3390/a12070142openalex-snapshot
New Bipartite Graph Techniques for Irregular Data Redistribution Scheduling
inferred← citeshttps://doi.org/10.5555/1761566.1761577openalex-snapshot
A compressed diagonals remapping technique for dynamic data redistribution on banded sparse matrix
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.