cs.DC · 2026-08-01 · No. 71

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

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

    Safe Quotes for Retroactive Liquidity Pools

    Peter Bro Miltersen

    cs.DC

    Automated market makers exchange assets through liquidity pools whose quoted prices depend on their reserves, with constant product pools being the most common. When such pools reside on different blockchains or shards, a sequence of swaps cannot in general be executed atomically. Aanes et al. introduced lock-swaps and retroactive constant product liquidity pools to provide price guarantees for such a setting. A retroactive pool implicitly...

    arxiv.org/abs/2607.28522 · PDF

  2. 02

    A Taxonomy of Performance Metrics for the Distributed Computing Continuum

    Praveen Kumar Donta, Boris Sedlak, Alfreds Lapkovskis, Alaa Saleh, Ying Li, Victor Casamayor Pujol, Ilir Murturi,...

    cs.DC · cs.NI · cs.PF

    Performance evaluation is essential for understanding, comparing, and improving computing systems, including Distributed Computing Continuum Systems (DCCS). In recent years, computational requirements have changed substantially with the growth of artificial intelligence and large-scale data-driven applications. These application tasks are increasingly distributed between resource-intensive data centers and resource-constrained edge...

    arxiv.org/abs/2607.28407 · PDF

  3. 03

    FAIR-Compute: A Roadmap for Fair and Efficient Allocation of Federated Digital Research Infrastructure

    Konstantinos, E. Zachariadis, Ahmed Sayed, Dimitris Fotakis, Angeliki Mathioudaki, Wan Shuen Siaw

    cs.DC

    As demand for high-performance computing (HPC), high-throughput computing and data storage grows, the way scarce compute is allocated -- not just how much exists -- has become a decisive factor in the productivity of UK research. FAIR-Compute studies allocation in a federated Digital Research Infrastructure (DRI) as a problem at the intersection of algorithmic game theory, transport economics and HPC scheduling. Our central observation is...

    arxiv.org/abs/2607.28290 · PDF

  4. 04

    Queue-Theoretic Admission Control for Multi-Tenant GPU Clusters

    Sohan Kunkerkar

    cs.DC

    GPU cluster operators cannot predict how long pending workloads will wait for admission. Existing systems use greedy heuristics with no formal wait time guarantees. We formalize GPU cluster admission as a multi-class, multi-resource queueing network and prove a structural decomposition: the pending queue partitions into quotable workloads (bounded wait time under stability) and unfeasible workloads (no finite bound without reconfiguration)....

    arxiv.org/abs/2607.28223 · PDF

  5. 05

    A Cloud Continuum Research Infrastructure for Distributed CPS Experimentation

    Fabio Orazio Mirto, Giuseppe Tricomi, Luca D'Agati, Andrea Sabbioni, Stefano Silvestri, Francesco Longo, Giovanni...

    cs.DC

    Cloud Continuum applications require experimental environments capable of combining heterogeneous Edge, Fog, Cloud, and high-performance computing resources while preserving reproducibility, observability, and control over distributed deployments. This paper presents a two-level reference architecture for Cloud Continuum experimentation built on top of the SLICES Cloud Continuum Blueprint. The proposed approach separates the...

    arxiv.org/abs/2607.28193 · PDF

  6. 06

    SmartGen: Seamless Disaggregated LLM Inference with Selective KV Cache Transfer

    Xuchuan Luo, Jiacheng Shen, Xin Wang, Yangfan Zhou

    cs.DC

    Disaggregating the prefill and decoding stages of large language model (LLM) inference into two separate sets of nodes is widely adopted in today's LLM serving systems. However, such an architecture poses significant challenges for self-hosted LLM deployments on rented cloud instances, since transferring enormous key-value (KV) caches between disaggregated nodes can easily saturate the limited inter-node network bandwidth. In this paper, we...

    arxiv.org/abs/2607.28150 · PDF

  7. 07

    ESBT: A Scalable and Deterministic Sequence CRDT for Distributed Collaborative Editing

    Moulay Driss Mechaoui, Abdessamad Imine

    cs.DC

    Modern collaborative editing systems require efficient mechanisms for managing concurrent updates across distributed replicas. Sequence Conflict-free Replicated Data Types (CRDTs) have become the de facto standard for supporting decentralized collaboration; they enable decentralized replicas to apply operations in arbitrary order while converging to a common state. Although existing sequence CRDTs guarantee Strong Eventual Consistency (SEC),...

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