No article text was recorded for this version.
hierarchical collective communication
Version 1 of 135 papers52 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Improving MPI Collective I/O for High Volume Non-Contiguous Requests With Intra-Node Aggregation
- Blog: Reducing Communication in Algebraic Multigrid with Multi-step Node Aware Communication
- Blog: Tutel: Adaptive Mixture-of-Experts at Scale
- Blog: Impact of RoCE Congestion Control Policies on Distributed Training of DNNs
- Blog: Efficient Large-scale Data Analysis Using MapReduce
- Blog: The Architecture of PIER: an Internet-Scale Query Processor
- Blog: On the design space of MapReduce ROLLUP aggregates
- Blog: Characterizing the Performance of Node-Aware Strategies for Irregular Point-to-Point Communication on Heterogeneous Architectures
- Blog: SynCron: Efficient Synchronization Support for Near-Data-Processing Architectures
- Blog: Scaling Molecular Dynamics with ab initio Accuracy to 149 Nanoseconds per Day
- Blog: A new adaptive data transfer library for model coupling
- Blog: Performance Analysis and Optimal Node-Aware Communication for Enlarged Conjugate Gradient Methods
- Blog: An optimized hierarchical MapReduce framework in supercomputing Internet environment
- Blog: Cohort Squeeze: Beyond a Single Communication Round per Cohort in Cross-Device Federated Learning
- Blog: One Quadrillion Triangles Queried on One Million Processors
- Blog: Parallel boosted regression trees for web search ranking
- Blog: Communication Optimization for Distributed Training: Architecture, Advances, and Opportunities
- Blog: Parallax: Sparsity-aware Data Parallel Training of Deep Neural Networks
- Blog: Templating Shuffles
- Blog: LightFDG: An Integrated Approach to Flow Detection and Grooming in Optical Wireless DCNs
- Blog: ViFusion: In-Network Tensor Fusion for Scalable Video Feature Indexing
- Blog: PhGraph: A High-Performance ReRAM-Based Accelerator for Hypergraph Applications
- Blog: Communication Reducing Algorithms for Distributed Hierarchical N-Body Problems with Boundary Distributions
- Blog: Improving communication scheduling for array redistribution
- Blog: Scaling Structured Multigrid to 500K+ Cores through Coarse-Grid Redistribution
- Blog: Rapid Tomographic Image Reconstruction via Large-Scale Parallelization
- Blog: Node aware sparse matrix-vector multiplication
- Blog: TriPoll: Computing Surveys of Triangles in Massive-Scale Temporal Graphs with Metadata
- Blog: Scalable Linear Time Dense Direct Solver for 3-D Problems Without Trailing Sub-Matrix Dependencies
- Blog: An efficient spatial query processing algorithm in multi-sink wireless sensor networks
- Blog: Efficient Pipelining Parallel Methods for Image Compositing in Sort-Last Rendering
- Blog: Quantum Supremacy Circuit Simulation on Sunway TaihuLight
- Blog: CLEC: Combination Locality Based Erasure Code for Permissioned Blockchain Storage
- Blog: Top-N Anfrageverarbeitung in PDMS: Anforderungen und Lösungswege
- Blog: MiCS: Near-linear Scaling for Training Gigantic Model on Public Cloud
History & citation
Current · Permanent link
- This direction split from Hierarchical Aggregation for Scalable Distributed Communication (57% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_hierarchical_collective_communication_77e64346,
title = {hierarchical collective communication},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-collective-communication/rdr_77e64346998943b2ac2ebbd3383dcc8c},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-21},
}This exact version (version 1, frozen text):
@misc{lacuna_hierarchical_collective_communication_77e64346_v1,
title = {hierarchical collective communication},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/hierarchical-collective-communication/rdr_77e64346998943b2ac2ebbd3383dcc8c/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-21},
}