cs.DC · 2026-09-23 · No. 122

Distributed, Parallel, and Cluster Computing, 2026-09-23.

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

01 — The papers

5 entries
  1. 01

    Seeking Cost-Optimal Infrastructure Size for Distributed Filesystems: A Ceph Case Study

    Niccolo Tosato, Isac Pasianotto, Ruggero Lot, Stefano Cozzini

    cs.DC · cs.PF

    Distributed Filesystems (DFS) are a crucial component of modern computing environments, and their performance is critical to the success of all the facilities that rely on them. However, predicting the DFS I/O performance solely based on the storage system hardware is not trivial. In this paper, we address this challenge by presenting an empirical method that tries to quantitatively assess how hardware configuration choices influence the...

    arxiv.org/abs/2609.26616 · PDF

  2. 02

    A Configurable Heuristic for the MLCS Problem

    Farhana Akter Tumpa, Rebin Silva Valan Arasu, Rajiv Gupta

    cs.DC

    Motivation: The Multiple Longest Common Subsequence (MLCS) problem for an arbitrary number of sequences is an NP-hard problem in sequence analysis. Existing exact algorithms based on dynamic programming or MLCS-DAG pruning rapidly exhaust memory as sequence lengths and set sizes grow, while heuristic and hyper-heuristic approaches compromise solution quality and require heavy parameter tuning, respectively. Results: This paper presents the...

    arxiv.org/abs/2609.26602 · PDF

  3. 03

    Don't let your Memory defy you: Fragmentation-Aware Serverless Allocation with Elastic Memory Locality

    Achilleas Tzenetopoulos, Dimosthenis Masouros, Sotirios Xydis, Francky Catthoor, Dimitrios Soudris

    cs.DC

    Serverless platforms commonly rely on bundled, memory-centric configurations, where CPU capacity follows the specified memory size. Resource decoupling reduces this waste, but can create external fragmentation by producing diverse CPU-memory shapes that leave residual capacity stranded across nodes. Memory disaggregation and tiering can turn these resource holes into usable capacity by enabling elastic memory locality, where instances use...

    arxiv.org/abs/2609.26476 · PDF

  4. 04

    DHSched: Stateless Control for Stateful Real-Time Avatar Serving

    Xin Wang, Haitong Zhang, Xianghong Li, Shumin Lin, Xianzheng Song, Lin Wang, Zhenyu Xu

    cs.DC

    Real-time avatar services run long-lived, GPU-backed sessions that transform a continuous text stream into speech, facial motion, rendered video, and RTC media. Elastic operation repeatedly reassigns these sessions across Workers. A reassignment updates shared placement state while the previous GPU runtime and RTC connection remain alive, opening a gap between control-plane assignment and execution authority. A stateful controller serializes...

    arxiv.org/abs/2609.26363 · PDF

  5. 05

    Hydrozoan: Latency-Adaptive DAG Consensus under Mixed Byzantine and Crash Faults

    Qianyu Yu, Lefteris Kokoris-Kogias, Alberto Sonnino

    cs.DC · cs.CR

    DAG-based consensus protocols can achieve great throughput and the optimal three-message-delay limit for n = 3f+1 consensus. While two-delay protocols exist, they pay with reduced resilience (requiring 5f+1-style committees) or rely on fallbacks that sacrifice the DAG's high throughput. This paper introduces Hydrozoan, the first DAG protocol with a dual commit path under a hybrid fault model of f Byzantine and c crashed validators, on n =...

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