Cover Image

Near-Optimal Wafer-Scale Reduce

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Luczynski, Piotr, Gianinazzi, Lukas, Iff, Patrick, Wilson, Leighton, De Sensi, Daniele, Hoefler, Torsten
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing Performance F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Low-Depth Spatial Tree Algorithms
by: Baumann, Yves, et al.
Published: (2024)

Swing: Short-cutting Rings for Higher Bandwidth Allreduce
by: De Sensi, Daniele, et al.
Published: (2024)

Inductive Loop Analysis for Practical HPC Application Optimization
by: Schaad, Philipp, et al.
Published: (2025)

Arrow Matrix Decomposition: A Novel Approach for Communication-Efficient Sparse Matrix Multiplication
by: Gianinazzi, Lukas, et al.
Published: (2024)

PICO: Performance Insights for Collective Operations
by: Pasqualoni, Saverio, et al.
Published: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
by: Attiya, Hagit, et al.
Published: (2025)

A Note on Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds of the Congested Clique
by: Lingas, Andrzej
Published: (2024)

Sublinear-Time Sampling of Spanning Trees in the Congested Clique
by: Pemmaraju, Sriram V., et al.
Published: (2024)

Obfuscated Consensus
by: Aspnes, James, et al.
Published: (2025)

Anonymous Self-Stabilising Localisation via Spatial Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2024)

An Analysis of Avalanche Consensus
by: Amores-Sesar, Ignacio, et al.
Published: (2024)

The consensus number of a shift register equals its width
by: Aspnes, James
Published: (2025)

Bine Trees: Enhancing Collective Operations by Optimizing Communication Locality
by: De Sensi, Daniele, et al.
Published: (2025)

Clock Synchronization Is Almost Impossible with Bounded Memory
by: Charron-Bost, Bernadette, et al.
Published: (2024)

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
by: Gupta, Chetan, et al.
Published: (2024)

GVE-LPA: Fast Label Propagation Algorithm (LPA) for Community Detection in Shared Memory Setting
by: Sahu, Subhajit
Published: (2023)

An Incrementally Expanding Approach for Updating PageRank on Dynamic Graphs
by: Sahu, Subhajit
Published: (2024)

DF* PageRank: Improved Incrementally Expanding Approaches for Updating PageRank on Dynamic Graphs
by: Sahu, Subhajit
Published: (2024)

GVE-Louvain: Fast Louvain Algorithm for Community Detection in Shared Memory Setting
by: Sahu, Subhajit
Published: (2023)

GVE-Leiden: Fast Leiden Algorithm for Community Detection in Shared Memory Setting
by: Sahu, Subhajit
Published: (2023)

Lock-Free Computation of PageRank in Dynamic Graphs
by: Sahu, Subhajit
Published: (2024)

Boolean Matrix Multiplication for Highly Clustered Data on the Congested Clique
by: Lingas, Andrzej
Published: (2024)

The World's Fastest Matching Engine Algorithm
by: Yoon, Jake
Published: (2026)

Iterating Pointers: Enabling Static Analysis for Loop-based Pointers
by: Lepori, Andrea, et al.
Published: (2025)

EvalNet: A Practical Toolchain for Generation and Analysis of Extreme-Scale Interconnects
by: Besta, Maciej, et al.
Published: (2021)

Distributed Rhombus Formation of Sliding Squares
by: Kostitsyna, Irina, et al.
Published: (2025)

FedMon: Federated eBPF Monitoring for Distributed Anomaly Detection in Multi-Cluster Cloud Environments
by: Zehra, Sehar, et al.
Published: (2025)

Denoising Application Performance Models with Noise-Resilient Priors
by: de Morais, Gustavo, et al.
Published: (2025)

FPsPIN: An FPGA-based Open-Hardware Research Platform for Processing in the Network
by: Schneider, Timo, et al.
Published: (2024)

ADELIA: Automatic Differentiation for Efficient Laplace Inference Approximations
by: Boudaoud, Afif, et al.
Published: (2026)

SHIRO: Near-Optimal Communication Strategies for Distributed Sparse Matrix Multiplication
by: Zhuang, Chen, et al.
Published: (2025)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
by: Balliu, Alkida, et al.
Published: (2023)

Scalability Optimization in Cloud-Based AI Inference Services: Strategies for Real-Time Load Balancing and Automated Scaling
by: Jin, Yihong, et al.
Published: (2025)

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, et al.
Published: (2025)

Decentralized Distributed Graph Coloring: Cluster Graphs
by: Flin, Maxime, et al.
Published: (2024)

Deterministic Fault-Tolerant Local Load Balancing and its Applications against Adaptive Adversaries
by: Kowalski, Dariusz R., et al.
Published: (2025)

High-Quality Multi-Constraint Hypergraph Partitioning via Greedy Rebalancing
by: Maas, Nikolai
Published: (2026)

Gathering Semi-Synchronously Scheduled Two-State Robots
by: Otaka, Kohei, et al.
Published: (2024)

Data Scheduling Algorithm for Scalable and Efficient IoT Sensing in Cloud Computing
by: Mohammad, Noor Islam S.
Published: (2025)