Cover Image

Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gupta, Chetan, Korhonen, Janne H., Studený, Jan, Suomela, Jukka, Vahidi, Hossein
Format:	Preprint
Published:	2024
Subjects:	Distributed, Parallel, and Cluster Computing F.2.1; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

Faster CONGEST Approximation Algorithms for Maximum Weighted Independent Set in Sparse Graphs
by: Faour, Salwa, 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)

Restless reachability problems in temporal graphs
by: Thejaswi, Suhas, et al.
Published: (2020)

Low-Depth Spatial Tree Algorithms
by: Baumann, Yves, et al.
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)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
by: Attiya, Hagit, 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)

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)

Towards Communication-Efficient Peer-to-Peer Networks
by: Hourani, Khalid, et al.
Published: (2024)

Near-Optimal Wafer-Scale Reduce
by: Luczynski, Piotr, et al.
Published: (2024)

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

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

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
by: Hirose, Jion, et al.
Published: (2025)

Conflict-Freedom as a Progress Condition
by: Kuznetsov, Petr, et al.
Published: (2026)

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

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)

Bandwidth Efficient Livestreaming in Mobile Wireless Networks: A Peer-to-Peer ACIDE Solution
by: Negulescu, Andrei, et al.
Published: (2023)

On the Computation of 2-Dimensional Recurrence Equations
by: Natale, Giuseppe
Published: (2024)

Supercomputers as a Continous Medium
by: Karp, Martin, et al.
Published: (2024)

PackSELL: A Sparse Matrix Format for Precision-Agnostic High-Performance SpMV
by: Suzuki, Kengo, et al.
Published: (2026)

On Solving Problems of Substantially Super-linear Complexity in $N^{o(1)}$ Rounds in the MPC Model
by: Lingas, Andrzej
Published: (2026)

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

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)

RadiK: Scalable and Optimized GPU-Parallel Radix Top-K Selection
by: Li, Yifei, et al.
Published: (2025)

Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
by: Bok, Jan, et al.
Published: (2025)

Augmenting the FedProx Algorithm by Minimizing Convergence
by: Sarkar, Anomitra, et al.
Published: (2024)

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

AAFLOW: Scalable Patterns for Agentic AI Workflows
by: Sarker, Arup Kumar, et al.
Published: (2026)

CooperLLM: Cloud-Edge-End Cooperative Federated Fine-tuning for LLMs via ZOO-based Gradient Correction
by: Sun, He, et al.
Published: (2026)

Scalable overset computation between a forest-of-octrees- and an arbitrary distributed parallel mesh
by: Brandt, Hannes, et al.
Published: (2026)

A Preliminary Model of Coordination-free Consistency
by: Li, Shulu, et al.
Published: (2025)

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

Stabilizing Consensus is Impossible in Lossy Iterated Immediate Snapshot Models
by: Felber, Stephan, et al.
Published: (2024)