On the public citation graph

Efficient algorithms for the reduce-scatter operation in LogGP

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.1007/bf01184933openalex-snapshot
Designing broadcasting algorithms in the postal model for message-passing systems
inferredcites →https://doi.org/10.1016/0166-218x(94)e0148-6openalex-snapshot
Optimal computation of census functions in the postal model
inferredcites →https://doi.org/10.1016/0167-8191(94)90027-2openalex-snapshot
The PVM concurrent computing system: Evolution, experiences, and trends
inferredcites →https://doi.org/10.1109/40.482310openalex-snapshot
Assessing fast network interfaces
inferredcites →https://doi.org/10.1109/empdp.2002.994296openalex-snapshot
Efficient implementation of reduce-scatter in MPI
inferredcites →https://doi.org/10.1109/spdp.1993.395513openalex-snapshot
Broadcasting multiple messages in simultaneous send/receive systems
inferredcites →https://doi.org/10.1145/155332.155333openalex-snapshot
LogP: towards a realistic model of parallel computation
inferredcites →https://doi.org/10.1145/165231.165250openalex-snapshot
Optimal broadcast and summation in the LogP model
inferredcites →https://doi.org/10.1145/215399.215427openalex-snapshot
LogGP

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.1007/11557265_20openalex-snapshot
An Improved Algorithm for (Non-commutative) Reduce-Scatter with an Application
inferred← citeshttps://doi.org/10.1007/978-3-540-75416-9_23openalex-snapshot
Optimization of Collective Communications in HeteroMPI
inferred← citeshttps://doi.org/10.1016/j.jpdc.2008.09.002openalex-snapshot
Bandwidth optimal all-reduce algorithms for clusters of workstations
inferred← citeshttps://doi.org/10.1016/j.simpat.2009.06.007openalex-snapshot
LogGP in theory and practice – An in-depth analysis of modern interconnection networks and benchmarking methods for collective operations
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00059-6openalex-snapshot
Efficient implementation of reduce-scatter in MPI
inferred← citeshttps://doi.org/10.1023/a:1025765910100openalex-snapshot
Contention-Aware Communication Schedule for High-Speed Communication
inferred← citeshttps://doi.org/10.1109/cluster52292.2023.00031openalex-snapshot
Uniform Algorithms for Reduce-scatter and (most) other Collectives for MPI
inferred← citeshttps://doi.org/10.1109/empdp.2002.994296openalex-snapshot
Efficient implementation of reduce-scatter in MPI
inferred← citeshttps://doi.org/10.1109/hpcsim.2014.6903768openalex-snapshot
Performance evaluation of SDN-enhanced MPI allreduce on a cluster system with fat-tree interconnect
inferred← citeshttps://doi.org/10.1109/ipdps.2004.1303019openalex-snapshot
Hierarchical gather/scatter algorithms with graceful degradation
inferred← citeshttps://doi.org/10.1109/ipdps.2007.370593openalex-snapshot
Low-Overhead LogGP Parameter Assessment for Modern Interconnection Networks
inferred← citeshttps://doi.org/10.1109/sbac-padw.2017.23openalex-snapshot
Automatic Scan Parallelization in OpenMP
inferred← citeshttps://doi.org/10.1145/1693453.1693476openalex-snapshot
Scalable communication protocols for dynamic sparse data exchange
inferred← citeshttps://doi.org/10.1145/1837853.1693476openalex-snapshot
Scalable communication protocols for dynamic sparse data exchange
inferred← citeshttps://doi.org/10.1145/3760789openalex-snapshot
Optimal, Non-pipelined Reduce-scatter and Allreduce Algorithms with an Application to All-to-all Communication
inferred← citeshttps://doi.org/10.1177/1094342005051521openalex-snapshot
Optimization of Collective Communication Operations in MPICH
inferred← citeshttps://doi.org/10.14529/jsfi140204openalex-snapshot
Energy, Memory, and Runtime Tradeoffs for Implementing Collective Communication Operations
inferred← citeshttps://doi.org/10.3929/ethz-b-000093896openalex-snapshot
Energy, Memory, and Runtime Tradeoffs for Implementing Collective Communication Operations
inferred← citeshttps://doi.org/10.47749/t/unicamp.2018.1045562openalex-snapshot
Support for parallel scan in OpenMP
inferred← citeshttps://doi.org/10.5821/dissertation-2117-93289openalex-snapshot
Performance Prediction and Evaluation Tools
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.