cs.DC · 2026-07-08 · No. 47

Distributed, Parallel, and Cluster Computing, 2026-07-08.

7 new papers in cs.DC. Titles, authors, abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →

01 — The papers

7 entries
  1. 01

    UBEP: Re-architecting Expert Parallelism Communication Library for Production Superpods

    Yipeng Liu, Chang Liu, Si Shen, Jiaqi Zheng, Mingfan Li, Yuyang Yang, Guanhua Li, Yuquan Zhang, Yimeng Xu, Zhongzhe...

    cs.DC · cs.AI · cs.NI

    The deployment of Mixture-of-Experts (MoE) models on production high-bandwidth superpods, such as NVIDIA's NVL72/576 and Huawei's CloudMatrix384, introduces critical challenges beyond raw interconnect bandwidth. While these systems provide unified global address spaces and high-bandwidth fabrics, their full potential for sparse MoE communication is hindered by three fundamental bottlenecks: (1) Strict execution serialization imposed by...

    arxiv.org/abs/2607.06202 · PDF

  2. 02

    Ordering by Unanimity: Giving Applications Sequencing Rights Without Breaking Composability

    Andrea Canidio

    cs.DC · econ.TH

    Blockchain applications may have preferences over the order in which transactions execute: an automated market maker may use an external feed to price its liquidity, and require that the oracle update incorporating this price execute before any swap; an exchange may want to execute cancellations of limit orders before incoming market orders; an application may run an on-chain auction by executing bids from highest to lowest, so that the first...

    arxiv.org/abs/2607.06144 · PDF

  3. 03

    DDB: Source-Level Interactive Debugging for Distributed Applications

    Yibo Yan, Junzhou He, Seo Jin Park

    cs.DC

    Interactive debugging is an effective tool for understanding program behavior at the source level, allowing developers to pause execution, navigate the call stack, and inspect runtime state. However, interactive debuggers are designed for single-process execution, and interactive debugging has been widely considered impractical for distributed systems. Call stacks stop at process boundaries, debugging state fails to survive infrastructure...

    arxiv.org/abs/2607.06107 · PDF

  4. 04

    A Dual-CRDT Architecture for Decentralized Trust Governance and Evolution

    Amos Brocco

    cs.DC · cs.CR

    While CRDTs provide decentralized replication and eventual consistency, Byzantine-resilient deployments require mechanisms for deciding which updates should be trusted and therefore contribute to the reconstructed state. In practice, the trust relationships underlying these decisions may evolve over time as participants join or leave, identities change, and governance rules are revised. However, the information used to make trust decisions is...

    arxiv.org/abs/2607.06068 · PDF

  5. 05

    The Surplus Parking Gathering Problem in Infinite Grids

    Animesh Maiti, Abhinav Chakraborty, Subhash Bhagat

    cs.DC · math.LO

    In this paper, we introduce the \emph{Surplus Parking Gathering Problem} ($\mathcal{SPG}$), a new coordination problem for robots deployed on an infinite grid. The input consists of a set of designated parking nodes, each associated with a prescribed capacity, while the total number of robots exceeds the total parking capacity. The objective is to saturate every parking node exactly according to its capacity while gathering all remaining...

    arxiv.org/abs/2607.05983 · PDF

  6. 06

    MatrixFSDP: communication-free matrix optimizers under ZeRO-3 parameter sharding

    Ming Gao, Yanwu Xu, Hao Zhang

    cs.DC

    Matrix optimizers such as Muon are attractive for large-scale training because they can improve convergence and token efficiency over coordinate-wise optimizers. Muon does this by orthogonalizing momentum-smoothed matrix updates with Newton-Schulz, producing spectrum-balanced updates that require the complete 2D matrix as input. This exposes a systems mismatch: FSDP/ZeRO-3 saves memory by making the optimizer see shards, not whole matrices....

    arxiv.org/abs/2607.05895 · PDF

  7. 07

    Layer 2 Coordinated Trusted Setup for Continuous CRS Generation

    Khalid Hassan, Sara Rouhani

    cs.DC

    Zero-knowledge proof systems rely on a trusted setup phase to generate a Common Reference String (CRS), yet existing approaches are typically static, one-time ceremonies that are inflexible and vulnerable to long-term compromise. Offloading continuous, recurring trusted setups to a decentralized Layer 2 (L2) network introduces a fundamental coordination challenge arising from the mismatch between high-throughput transaction processing and the...

    arxiv.org/abs/2607.05776 · PDF

This edition is part of The Daily Abstract — cs.DC archive. Subscribe to receive these in your inbox each morning, automatically translated to Spanish, with reply-to-PDF: arxivdaily.ignorelist.com.

Colophon Set in Georgia, with system sans for interface chrome and a monospaced stack for code and paper identifiers. Sole accent: amber #D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.