cs.DC · 2026-11-10 · No. 169

Distributed, Parallel, and Cluster Computing, 2026-11-10.

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

01 — The papers

8 entries
  1. 01

    Contention Resolution with a Fast-but-Fickle Channel

    Umesh Biswas, Vini Chaudhary, Shafqat Hasan, Maxwell Young

    cs.DC

    The contention-resolution problem studies how $n$ devices share a communication channel without centralized coordination. Classical models typically assume a single continuously available channel and focus on minimizing total completion time. However, modern wireless systems increasingly rely on shared spectrum, where access may be abruptly revoked by incumbent users. Motivated by this setting, we study contention resolution with two...

    arxiv.org/abs/2611.12843 · PDF

  2. 02

    Resetting-based designated information distribution

    Xiaojuan Ma, Yan Wang, Indranil Gupta

    cs.DC · cond-mat.stat-mech · cs.SI

    For a network of $n$ nodes under random gossip dynamics, we show that by introducing the additional resetting mechanism (with rate $β$) to a designated subset of $r$ nodes, the expected sum of all node values is asymptotically equal to $\tfrac{n}{r}$ times the sum of the initial values of the $r$ designated nodes, in the small-$β$ and long-time limit. We also analyze the convergence speed to this asymptotic state and provide an approximate...

    arxiv.org/abs/2611.12485 · PDF

  3. 03

    Adapting Multi-Stage Distributed Real-Time Systems Design to Vehicular Edge Computing

    Niraj Kumar, Anant Gautam

    cs.DC

    Vehicular Edge Computing (VEC) aims to support computation-intensive applications in intelligent transportation systems while meeting stringent latency requirements. When processed remotely, applications require access to different resource types in a specific sequence, forming a multi-stage processing pipeline. This structure closely resembles multi-stage distributed applications executing across heterogeneous resources, making established...

    arxiv.org/abs/2611.12370 · PDF

  4. 04

    Release Sooner, Expose Less: Offloading MoE Dispatch in NCCL-EP under Dual-Batch Overlap

    Hsin-Chun Yin, Khaled Hamidouche, Ian Ziemba, Arjun Kashyap, Pak Markthub, Subhadeep Bhattacharya, Ke Wen, Assaf...

    cs.DC

    Dual-batch overlap (DBO) hides mixture-of-experts (MoE) communication behind another microbatch's computation, but only after dispatch send releases the GPU. The time dispatch send holds the GPU therefore stays exposed, while network progress after release can be hidden. We evaluate three research configurations built on NCCL-EP that target this exposed communication time: GPI, in which the GPU constructs GPU-Friendly Descriptors (GFDs) and...

    arxiv.org/abs/2611.12362 · PDF

  5. 05

    Mitigating SM-Level Load Imbalance in 3D Gaussian Splatting on GPUs

    Junha Ryu, Hoi-Jun Yoo

    cs.DC · cs.CV · cs.GR · cs.LG

    3D Gaussian Splatting (3DGS) enables photorealistic, real-time rendering on commodity GPUs and is increasingly adopted in generative world models and autonomous driving simulators. However, existing optimizations rely on algorithmic changes that often require retraining, or on specialized accelerators that lack flexibility across evolving 3DGS variants. In this paper, we identify a fundamental inefficiency in GPU-based 3DGS rendering: severe...

    arxiv.org/abs/2611.12319 · PDF

  6. 06

    Evolving Infra: Agent-Adaptive LLM Serving at Scale

    Hao Kang, Weili Xu, Ziyang Li, Zheng Du, Hanchen Li, Tian Xia, Song Bian, Tushar Krishna, Huizi Mao, Ion Stoica, Song Han

    cs.DC

    Agentic workloads are a major source of LLM inference demand. Existing prefill--decode (PD) disaggregated serving systems offer limited flexibility for runtime adaptation of compute allocation and KV cache management, and rely on coarse signals that only partly capture the diverse and dynamic agent workload. These limitations lead to load imbalance between prefill and decode nodes and eviction of KV caches that agents will reuse. We present...

    arxiv.org/abs/2611.12304 · PDF

  7. 07

    RecoGEM: A Serving System for Production-Scale Generative Recommendation

    Xiangrui Yang, Yunfeng Zhao, Jiawei Yang, Fangyu Zhang, Enrui Zhao, Liang Zeng, Cheng Peng, Minhui Xie, Jiaqiang...

    cs.DC · cs.AI · cs.IR

    Generative recommendation (GR) is moving industrial recommender systems (RecSys) from scoring candidate items to autoregressively generating item identifiers. This shift promises higher recommendation quality, but makes serving substantially harder: each request executes a short sequence of dependent decoding steps that explore a large item space and select promising candidates on the latency-critical path. GR not only creates structural...

    arxiv.org/abs/2611.12296 · PDF

  8. 08

    Optimal Proximity Black Hole Search with Programmable Matter

    Giuseppe Antonio Di Luna, Alfredo Navarra, Francesco Piselli

    cs.DC

    The concept of programmable matter (PM) envisions objects composed of tiny, mobile particles capable of self-arrangement, which allows them to change shape, color, and move. We initiate the study of the Black Hole Search problem within the context of PM. The problem involves a dangerous and unnoticeable location, the black hole, that, without a trace, destroys any particle visiting it. In our setting, particles move inside a convex area...

    arxiv.org/abs/2611.12170 · 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.