On the public citation graph

Processor mapping techniques toward efficient data redistribution

0 signed · 83 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.1006/jpdc.1994.1048openalex-snapshot
Generating Communication for Array Statements: Design, Implementation, and Evaluation
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.1016/0743-7315(91)90107-kopenalex-snapshot
The DINO parallel programming language
inferredcites →https://doi.org/10.1109/2.476198openalex-snapshot
Collective communication in wormhole-routed massively parallel computers
inferredcites →https://doi.org/10.1109/71.642949openalex-snapshot
Efficient algorithms for all-to-all communications in multiport message-passing systems
inferredcites →https://doi.org/10.1109/dmcc.1990.555408openalex-snapshot
The Complexity of Reshaping Arrays on Boolean Cubes
inferredcites →https://doi.org/10.1109/dmcc.1991.633086openalex-snapshot
Hypertasking Support for Dynamically Redistributable and Resizeable Arrays on the iPSC
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/icpp.1994.67openalex-snapshot
Communication Optimizations Used in the Paradigm Compiler for Distributed-Memory Multicomputers
inferredcites →https://doi.org/10.1109/ipps.1994.288261openalex-snapshot
Processor mapping techniques toward efficient data redistribution
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.1109/splc.1994.377007openalex-snapshot
MPI on IBM SP1/SP2: current status and future directions
inferredcites →https://doi.org/10.1109/superc.1992.236652openalex-snapshot
Interprocedural compilation of Fortran D for MIMD distributed-memory machines
inferredcites →https://doi.org/10.1145/169627.169735openalex-snapshot
Dynamic data distributions in Vienna Fortran
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.13140/rg.2.1.1568.4968openalex-snapshot
Fortran D Language Specification
inferredcites →https://doi.org/10.5555/147877.148083openalex-snapshot
Interprocedural compilation of Fortran D for MIMD distributed-memory machines

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.1996.0143openalex-snapshot
Optimal Compilation of HPF Remappings
inferred← citeshttps://doi.org/10.1006/jpdc.1996.0147openalex-snapshot
A Compiler-Directed Approach to Network Latency Reduction for Distributed Shared Memory Multiprocessors
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-37619-4_8openalex-snapshot
A Compressed Diagonals Remapping Technique for Dynamic Data Redistribution on Banded Sparse Matrix
inferred← citeshttps://doi.org/10.1007/3-540-63697-8_103openalex-snapshot
Block-cyclic array redistribution on networks of workstations
inferred← citeshttps://doi.org/10.1007/978-3-540-30566-8_33openalex-snapshot
Optimal Processor Mapping Scheme for Efficient Communication of Data Realignment
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-72905-1_36openalex-snapshot
A Dominant Input Stream for LUD Incremental Computing on a Contention Network
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/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-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-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/j.jpdc.2004.12.001openalex-snapshot
Improving communication scheduling for array redistribution
inferred← citeshttps://doi.org/10.1016/j.parco.2015.09.005openalex-snapshot
Assessing the cost of redistribution followed by a computational kernel: Complexity and performance results
inferred← citeshttps://doi.org/10.1016/s0167-8191(00)00027-2openalex-snapshot
Contention-free communication scheduling for array redistribution
inferred← citeshttps://doi.org/10.1016/s0167-8191(02)00113-8openalex-snapshot
Generating communication sets of array assignment statements for block-cyclic distribution on distributed memory parallel computers
inferred← citeshttps://doi.org/10.1023/a:1008065923301openalex-snapshot
Efficient Methods for kr → r and r → kr Array Redistribution1
inferred← citeshttps://doi.org/10.1023/a:1008167621154openalex-snapshot
Efficient Methods for Multi-Dimensional Array Redistribution
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/b:ijpp.0000038068.80639.52openalex-snapshot
A Pipeline Technique for Dynamic Data Transfer on a Multiprocessor Grid
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.1023/b:supe.0000026848.34971.27openalex-snapshot
A Divide-and-Conquer Algorithm for Irregular Redistribution in Parallelizing Compilers
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.1093/ietisy/e89-d.2.418openalex-snapshot
Message Scheduling for Irregular Data Redistribution in Parallelizing Compilers
inferred← citeshttps://doi.org/10.1109/71.506697openalex-snapshot
Efficient algorithms for array redistribution
inferred← citeshttps://doi.org/10.1109/71.663945openalex-snapshot
Scheduling block-cyclic array redistribution
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.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/cit.2004.1357239openalex-snapshot
Efficient list algorithms for irregular block redistribution in parallelizing compilers
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/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/hips.1998.665146openalex-snapshot
Improving performance of multi-dimensional array redistribution on distributed memory machines
inferred← citeshttps://doi.org/10.1109/icpads.1994.590385openalex-snapshot
Efficient algorithms for data distribution on distributed memory multicomputers
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/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/ispdc.2014.16openalex-snapshot
Determining the Optimal Redistribution for a Given Data Partition
inferred← citeshttps://doi.org/10.1109/pact.1998.727299openalex-snapshot
Efficient methods for multi-dimensional array redistribution
inferred← citeshttps://doi.org/10.1109/sbac-pad.2007.17openalex-snapshot
Multi2Sim: A Simulation Framework to Evaluate Multicore-Multithreaded Processors
inferred← citeshttps://doi.org/10.1109/sbac-pad.2007.30openalex-snapshot
Impacts of Multiprocessor Configurations on Workloads in Bioinformatics
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.1142/s0129054107005121openalex-snapshot
A FRAMEWORK FOR SOLVING SEQUENCE PROBLEM OF MULTIPLE INPUT STREAMS
inferred← citeshttps://doi.org/10.1177/1094342006061887openalex-snapshot
Data Redistribution Algorithms for Heterogeneous Processor Rings
inferred← citeshttps://doi.org/10.1587/transinf.2018edp7386openalex-snapshot
Genetic Node-Mapping Methods for Rapid Collective Communications
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
inferred← citeshttps://doi.org/10.5555/522344.825691openalex-snapshot
Efficient methods for multi-dimensional array redistribution
inferred← citeshttps://doi.org/10.70675/29c38ac9z6d86z424dz8dcez148daedf433bopenalex-snapshot
Memory-aware Algorithms and Scheduling Techniques for Matrix Computattions
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.