On the public citation graph
Optimization principles for collective neighborhood communications
0 signed · 63 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/cpe.1586openalex-snapshot
Towards performance portability through runtime adaptation for high‐performance computing applications
inferredcites →https://doi.org/10.1002/cpe.1643openalex-snapshot
The scalable process topology interface of MPI 2.2
inferredcites →https://doi.org/10.1002/cpe.605openalex-snapshot
Parallel static and dynamic multi‐constraint graph partitioning
inferredcites →https://doi.org/10.1006/jcph.2000.6522openalex-snapshot
Lattice Boltzmann Method for 3-D Flows with Curved Boundary
inferredcites →https://doi.org/10.1006/jpdc.1994.1104openalex-snapshot
Communication Optimizations for Irregular Scientific Computations on Distributed Memory Architectures
inferredcites →https://doi.org/10.1006/jpdc.1997.1346openalex-snapshot
LogGP: Incorporating Long Messages into the LogP Model for Parallel Computation
inferredcites →https://doi.org/10.1007/11846802_18openalex-snapshot
High Performance RDMA Protocols in HPC
inferredcites →https://doi.org/10.1007/978-3-540-39924-7_38openalex-snapshot
Improving the Performance of Collective Operations in MPICH
inferredcites →https://doi.org/10.1007/978-3-540-87475-1_13openalex-snapshot
Sparse Non-blocking Collectives in Quantum Mechanical Calculations
inferredcites →https://doi.org/10.1007/bf01184933openalex-snapshot
Designing broadcasting algorithms in the postal model for message-passing systems
inferredcites →https://doi.org/10.1016/j.jcp.2007.01.037openalex-snapshot
A time-split nonhydrostatic atmospheric model for weather research and forecasting applications
inferredcites →https://doi.org/10.1016/j.parco.2007.06.005openalex-snapshot
MPI collective algorithm selection and quadtree encoding
inferredcites →https://doi.org/10.1016/j.parco.2009.09.001openalex-snapshot
Two-tree algorithms for full bandwidth broadcast, reduction and scan
inferredcites →https://doi.org/10.1016/s0743-7315(03)00104-7openalex-snapshot
Communication characteristics of large-scale scientific applications for contemporary cluster architectures
inferredcites →https://doi.org/10.1093/comjnl/10.1.85openalex-snapshot
An upper bound for the chromatic number of a graph and its application to timetabling problems
inferredcites →https://doi.org/10.1109/icpp.2009.70openalex-snapshot
Group Operation Assembly Language - A Flexible Way to Express Collective Communication
inferredcites →https://doi.org/10.1109/ipdps.2007.370291openalex-snapshot
Towards Optimal Multi-level Tiling for Stencil Computations
inferredcites →https://doi.org/10.1109/ipdps.2009.5160935openalex-snapshot
Sparse collective operations for MPI
inferredcites →https://doi.org/10.1109/ipdps.2010.5470407openalex-snapshot
Optimization of applications with non-blocking neighborhood collectives via multisends on the Blue Gene/P supercomputer
inferredcites →https://doi.org/10.1109/tpds.2009.61openalex-snapshot
Communication Requirements and Interconnect Optimization for High-End Scientific Applications
inferredcites →https://doi.org/10.1137/s1064827501386237openalex-snapshot
Parallel Algebraic Multigrid Methods on Distributed Memory Computers
inferredcites →https://doi.org/10.1145/1250734.1250761openalex-snapshot
Effective automatic parallelization of stencil computations
inferredcites →https://doi.org/10.1145/1362622.1362692openalex-snapshot
Implementation and performance analysis of non-blocking collective operations for MPI
inferredcites →https://doi.org/10.1145/165231.165250openalex-snapshot
Optimal broadcast and summation in the LogP model
inferredcites →https://doi.org/10.1145/181014.181756openalex-snapshot
Efficient algorithms for all-to-all communications in multi-port message-passing systems
inferredcites →https://doi.org/10.1145/2049662.2049663openalex-snapshot
The university of Florida sparse matrix collection
inferredcites →https://doi.org/10.1145/237578.237638openalex-snapshot
Automatic optimization of communication in compiling out-of-core stencil codes
inferredcites →https://doi.org/10.1145/79173.79181openalex-snapshot
A Bridging Model for Parallel Computation
inferredcites →https://doi.org/10.1145/963778.963780openalex-snapshot
Send-receive considered harmful
inferredcites →https://doi.org/10.1147/rd.492.0195openalex-snapshot
Overview of the Blue Gene/L system architecture
inferredcites →https://doi.org/10.1177/109434209100500406openalex-snapshot
Studying Quarks and Gluons On Mimd Parallel Computers
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.4421openalex-snapshot
Flexible all‐to‐all data redistribution methods for grid‐based particle codes
inferred← citeshttps://doi.org/10.1002/cpe.4964openalex-snapshot
Optimized all‐to‐all communication on multicore architectures applied to FFTs with pencil decomposition
inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_8openalex-snapshot
Towards a Modular and Variability-Aware Aerodynamic Simulator
inferred← citeshttps://doi.org/10.1007/978-981-10-0457-5_26openalex-snapshot
Optimizing Parallel Kinetic Monte Carlo Simulation by Communication Aggregation and Scheduling
inferred← citeshttps://doi.org/10.1016/j.comnet.2024.110860openalex-snapshot
Mitigating critical nodes in brain simulations via edge removal
inferred← citeshttps://doi.org/10.1016/j.compeleceng.2013.08.012openalex-snapshot
The Servet 3.0 benchmark suite: Characterization of network performance degradation
inferred← citeshttps://doi.org/10.1088/1742-6596/2697/1/012035openalex-snapshot
Enhancing MPI remote memory access model for distributed-memory systems through one-sided broadcast implementation
inferred← citeshttps://doi.org/10.1109/cluster59342.2025.11186462openalex-snapshot
Lessons from Profiling and Optimizing Placement in AMR Codes
inferred← citeshttps://doi.org/10.1109/cluster59578.2024.00018openalex-snapshot
Optimizing Neighbor Collectives with Topology Objects
inferred← citeshttps://doi.org/10.1109/cluster59578.2024.00019openalex-snapshot
A Topology- and Load-Aware Design for Neighborhood Allgather
inferred← citeshttps://doi.org/10.1109/h2rc51942.2020.00006openalex-snapshot
Programming Reconfigurable Heterogeneous Computing Clusters Using MPI With Transpilation
inferred← citeshttps://doi.org/10.1109/hipc.2017.00047openalex-snapshot
Exploiting Common Neighborhoods to Optimize MPI Neighborhood Collectives
inferred← citeshttps://doi.org/10.1109/hpec55821.2022.9926376openalex-snapshot
Improved Distributed-memory Triangle Counting by Exploiting the Graph Structure
inferred← citeshttps://doi.org/10.1109/icpp.2013.73openalex-snapshot
Protocols for Fully Offloaded Collective Operations on Accelerated Network Adapters
inferred← citeshttps://doi.org/10.1109/icpp.2013.74openalex-snapshot
Efficient Information Dissemination in Dynamic Networks
inferred← citeshttps://doi.org/10.1109/icpp.2013.75openalex-snapshot
A Novel Functional Partitioning Approach to Design High-Performance MPI-3 Non-blocking Alltoallv Collective on Multi-core Systems
inferred← citeshttps://doi.org/10.1109/icpp.2014.30openalex-snapshot
TRAM: Optimizing Fine-Grained Communication with Topological Routing and Aggregation of Messages
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00085openalex-snapshot
Exploring MPI Communication Models for Graph Applications Using Graph Matching as a Case Study
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00087openalex-snapshot
An Efficient Collaborative Communication Mechanism for MPI Neighborhood Collectives
inferred← citeshttps://doi.org/10.1109/ipdps54959.2023.00070openalex-snapshot
Designing and Optimizing GPU-aware Nonblocking MPI Neighborhood Collective Communication for PETSc*
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00034openalex-snapshot
Scalable Spike Transmission in Large-Scale Brain Network Simulations
inferred← citeshttps://doi.org/10.1109/sc.2016.62openalex-snapshot
A PCIe Congestion-Aware Performance Model for Densely Populated Accelerator Servers
inferred← citeshttps://doi.org/10.1109/sc41405.2020.00038openalex-snapshot
A Hierarchical and Load-Aware Design for Large Message Neighborhood Collectives
inferred← citeshttps://doi.org/10.1109/tpds.2016.2516540openalex-snapshot
Cache Line Aware Algorithm Design for Cache-Coherent Architectures
inferred← citeshttps://doi.org/10.1109/tpds.2024.3387720openalex-snapshot
HRCM: A Hierarchical Regularizing Mechanism for Sparse and Imbalanced Communication in Whole Human Brain Simulations
inferred← citeshttps://doi.org/10.1145/3320060openalex-snapshot
Demystifying Parallel and Distributed Deep Learning
inferred← citeshttps://doi.org/10.11606/t.3.2021.tde-18052021-154710openalex-snapshot
ASLI schenes as a kernel convolved way to optimize stencil computation.
inferred← citeshttps://doi.org/10.23919/isc.2024.10528923openalex-snapshot
ROCm-Aware Leader-based Designs for MPI Neighbourhood Collectives
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.