On the public citation graph

Efficient Algorithms for Block-Cyclic Redistribution of Arrays

0 signed · 56 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.1109/71.342126openalex-snapshot
CCL: a portable and tunable collective communication library for scalable parallel computers
inferredcites →https://doi.org/10.1109/ipps.1994.288220openalex-snapshot
The block distributed memory model for shared memory multiprocessors

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jpdc.1999.1571openalex-snapshot
Adaptive Communication Algorithms for Distributed Heterogeneous Systems
inferred← citeshttps://doi.org/10.1007/11424925_106openalex-snapshot
Optimizations of Data Distribution Localities in Cluster Grid Environments
inferred← citeshttps://doi.org/10.1007/11508380_92openalex-snapshot
Localized Communications of Data Parallel Programs on Multi-cluster Grid Systems
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/11564621_9openalex-snapshot
Localization Techniques for Cluster-Based Data Grid
inferred← citeshttps://doi.org/10.1007/11572961_24openalex-snapshot
Irregular Redistribution Scheduling by Partitioning Messages
inferred← citeshttps://doi.org/10.1007/3-540-64359-1_759openalex-snapshot
A mapping methodology for designing software task pipelines for embedded signal processing
inferred← citeshttps://doi.org/10.1007/978-3-540-68083-3_6openalex-snapshot
Optimizing Communications of Data Parallel Programs in Scalable Cluster Systems
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-15646-5_12openalex-snapshot
An In-Place Algorithm for Irregular All-to-All Communication with Limited Memory
inferred← citeshttps://doi.org/10.1007/s00453-001-0031-9openalex-snapshot
Parallel Implementation of a Class of Adaptive Signal Processing Applications
inferred← citeshttps://doi.org/10.1007/s11227-005-0247-6openalex-snapshot
Sparse Matrix Block-Cyclic Realignment on Distributed Memory Machines
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-008-0185-1openalex-snapshot
A message passing strategy for array redistributions in a torus network
inferred← citeshttps://doi.org/10.1007/s11227-010-0463-6openalex-snapshot
Efficient selection strategies towards processor reordering techniques for improving data locality in heterogeneous clusters
inferred← citeshttps://doi.org/10.1007/s11227-015-1519-4openalex-snapshot
Scheduling array redistribution with virtual channel support
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/s0167-8191(00)00027-2openalex-snapshot
Contention-free communication scheduling for array redistribution
inferred← citeshttps://doi.org/10.1023/a:1019059632297openalex-snapshot
Block‐cyclic redistribution over heterogeneous networks
inferred← citeshttps://doi.org/10.1023/b:ijpp.0000038068.80639.52openalex-snapshot
A Pipeline Technique for Dynamic Data Transfer on a Multiprocessor Grid
inferred← citeshttps://doi.org/10.1080/00207160600845203openalex-snapshot
On further reducing the cost of parallel pipelined message broadcasts
inferred← citeshttps://doi.org/10.1080/00207160701537873openalex-snapshot
A message combining approach for efficient array redistribution in non-all-to-all communication networks
inferred← citeshttps://doi.org/10.1088/1749-4699/5/1/014017openalex-snapshot
Overdetermined shooting methods for computing standing water waves with spectral accuracy
inferred← citeshttps://doi.org/10.1109/12.995452openalex-snapshot
An efficient algorithm for out-of-core matrix transposition
inferred← citeshttps://doi.org/10.1109/71.667897openalex-snapshot
A basic-cycle calculation technique for efficient dynamic data redistribution
inferred← citeshttps://doi.org/10.1109/71.819944openalex-snapshot
Algorithmic redistribution methods for block-cyclic decompositions
inferred← citeshttps://doi.org/10.1109/71.819945openalex-snapshot
Efficient algorithms for block-cyclic array redistribution between processor sets
inferred← citeshttps://doi.org/10.1109/71.895789openalex-snapshot
A generalized basic-cycle calculation method for efficient array redistribution
inferred← citeshttps://doi.org/10.1109/71.940748openalex-snapshot
A generalized processor mapping technique for array redistribution
inferred← citeshttps://doi.org/10.1109/79.708542openalex-snapshot
Utilizing the power of high-performance computing
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/cmpsac.1997.624761openalex-snapshot
Efficient methods for kr→r and r→kr array redistribution
inferred← citeshttps://doi.org/10.1109/cse.2009.255openalex-snapshot
Data Distribution Methods for Communication Localization in Multi-clusters with Heterogeneous Network
inferred← citeshttps://doi.org/10.1109/empdp.2001.905071openalex-snapshot
The SDAARC architecture
inferred← citeshttps://doi.org/10.1109/fmpc.1999.750588openalex-snapshot
Packing/unpacking information generation for efficient generalized kr/spl rarr/r and r/spl rarr/kr array redistribution
inferred← citeshttps://doi.org/10.1109/hpdc.1998.710017openalex-snapshot
Adaptive communication algorithms for distributed heterogeneous systems
inferred← citeshttps://doi.org/10.1109/icpads.1998.741147openalex-snapshot
A generalized basic cycle calculation method for efficient array redistribution
inferred← citeshttps://doi.org/10.1109/icpads.1998.741149openalex-snapshot
Contention-free communication scheduling for array redistribution
inferred← citeshttps://doi.org/10.1109/icpp.1997.622579openalex-snapshot
Message encoding techniques for efficient array redistribution
inferred← citeshttps://doi.org/10.1109/icpp.1997.622650openalex-snapshot
Efficient algorithms for multi-dimensional block-cyclic redistribution of arrays
inferred← citeshttps://doi.org/10.1109/icpp.2000.876148openalex-snapshot
An efficient algorithm for large-scale matrix transposition
inferred← citeshttps://doi.org/10.1109/ictta.2006.1684953openalex-snapshot
Pipelined Block-Cyclic Redistributions in Complete 2D Tori
inferred← citeshttps://doi.org/10.1109/ipps.1998.669890openalex-snapshot
Optimizing data scheduling on processor-in-memory arrays
inferred← citeshttps://doi.org/10.1109/pact.1998.727299openalex-snapshot
Efficient methods for multi-dimensional array redistribution
inferred← citeshttps://doi.org/10.1109/sc.1998.10035openalex-snapshot
Efficient Algorithms for Block-Cyclic Array Redistribution between Processor Sets
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/509058.509068openalex-snapshot
Efficient Algorithms for Block-Cyclic Array Redistribution between Processor Sets
inferred← citeshttps://doi.org/10.5555/522344.825691openalex-snapshot
Efficient methods for multi-dimensional array redistribution
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.