cs.DC · 2026-10-31 · No. 159
Distributed, Parallel, and Cluster Computing, 2026-10-31.
10 new papers in cs.DC. Titles, authors,
abstracts. Links to arXiv. Want this in your inbox every morning? Subscribe →
01 — The papers
10 entries-
01
Nearly-Optimal Time-Sample Trade-off in Consensus Dynamics
Francesco d'Amore, Joel Rybicki, Nobutaka Shimizu, Takeharu Shiraga, Robin Vacus
cs.DC · cs.DS · math.PR
How does the number of sampled opinions affect the time required to reach consensus in distributed consensus dynamics? We study the synchronous $h$-\textsf{Majority}, in which every node independently samples $h$ nodes uniformly at random with replacement in each round and adopts a most frequent sampled opinion, breaking ties uniformly at random. We show that $h$-\textsf{Majority} achieves the nearly-optimal trade-off between the sample size...
-
02
AI in the EGI e-infrastructure -- Past experiences and future strategies
Gergely Sipos, Sergio Andreozzi, Marco Rorro, Andrea Manzi, Tiziana Ferrari
cs.DC · cs.AI · cs.CY
The EGI Federation has provided federated e-infrastructure services to European and global science for over 15 years. We review EGI's early experiences with AI in the interTwin and iMagine Horizon Europe projects, which built digital twins in physics and environmental sciences and an image-analysis platform for aquatic research. We then examine how the AI landscape has changed since 2023 and argue that the focus of AI in science has shifted...
-
03
SPECTRUM: A Strategic Framework and Technical Blueprint for European Exascale Research Data and Compute Infrastructure
Sergio Andreozzi, Stefano Bagnasco, Florian Berberich, Tommaso Boccali, Concezio Bozzi, Luis Cifuentes, Luca...
cs.DC · astro-ph.IM
The HiLumi LHC, the SKA Observatory and LOFAR 2.0 will take High Energy Physics (HEP) and Radio Astronomy (RA) towards exabyte-scale data within the next decade, beyond the capacity of today's infrastructure. The SPECTRUM project responded with two documents built on the same evidence. A Technical Blueprint describes a European compute and data continuum as a capability map, consolidates the gaps found in HEP, RA and related use cases, and...
-
04
Can We Rely on Language Models to Orchestrate Services across the Edge-Cloud Continuum?
Zhenghao Wu, Ruihai Dong, Reza Farahani, Hamed Haddadi, Omer Rana, Hadi Tabatabaee Malazi
cs.DC
Service orchestration across the edge--cloud continuum increasingly uses language models (LMs) to translate intents and operational evidence into scheduling, configuration, diagnosis, and remediation decisions. Yet, useful model outputs do not by themselves establish dependable orchestration: reliability also depends on where the LM enters the decision process, what authority it is granted, how actions are constrained, and what system-level...
-
05
Only Accepted Tokens Count: An Energy Accounting of Speculative Decoding Under Latency Targets
Bole Ma, Ayesha Afzal, Jan Eitzinger, Harald Koestler, Gerhard Wellein
cs.DC · cs.AI · cs.LG · cs.PF
Large language model serving is limited by facility power. Energy per token determines how many tokens a datacenter can serve, while a latency target bounds how quickly each user receives them. During decode, every weight is read from memory for every generated token. Batching amortizes this read across users but makes no individual user faster. Speculative decoding does: a drafter proposes several future tokens, and the target model verifies...
-
06
PhOSv1: Efficient Scaling of Model Sleeping on a Single Server for Autoscaling with GPU-Context Deduplication
Tianle Sun, Xingda Wei, Rong Chen
cs.DC · cs.OS
Autoscaling is a key mechanism in model-as-a-service systems, where fast scale-up is essential because the scale-up time directly determines how long a model service remains overloaded, which in turn governs serving quality. The state-of-the-art approach, model sleeping, adopted by mainstream serving engines including vLLM and SGLang, achieves near-zero-cost scale-up by pausing pre-spawned engines on the GPU. However, sleeping is not a free...
-
07
An Exact Parallel Dense Gauss-Seidel Algorithm with Trade-Offs between Parallel Execution Time and Preprocessing Time
Mugurel-Ionuţ Andreica, Pantelimon George Popescu, Eliana-Dina Tîrşa
cs.DC · cs.DS
The Gauss-Seidel iterative method is commonly used for solving systems of linear equations because of its good convergence properties. However, the Gauss-Seidel algorithm cannot be easily parallelized because of the data dependencies existing at each iteration. The best parallel execution time for dense systems of equations is $O(n)$ given that enough processors are available and no preprocessing is performed. In this paper we propose a new...
-
08
TRACEs: Fine-Grained Embedded Provenance for Distributed Scientific Workflows
Ty Anderson, Kin Ng, Rajiv Mayani, Jay Lofstead, Ewa Deelman, Michela Taufer
cs.DC · cs.CE
Large-scale scientific workflows run on distributed HPC resources, making it hard to explain how scientific data products are generated and why similar workflow executions can yield very different results. Existing systems usually focus on either distributed workflow execution or provenance management and rarely treat fine-grained provenance as an intrinsic property of distributed scientific data artifacts. We present TRACEs (Traceable...
-
09
Enabling Dynamic Resource Scaling in Quantum Circuit Simulations
Íñigo Aréjula-Aísa, Sergio Iserte, Petter Sandås, Ricard S. Raigada-García, Oliver Brown, James Richings, Antonio J. Peña
cs.DC
Studies of quantum algorithms often simulate se- quences of circuits whose number of qubits changes from one circuit to the next, such as instances of increasing size of the same problem. Since each additional qubit doubles the state- vector, every circuit needs a different number of nodes, which a fixed allocation on a shared High-Performance Computing (HPC) system cannot provide: a job sized for the largest circuit leaves most of its nodes...
-
10
Sandman: Building and Operating Sandboxes for Agentic Reinforcement Learning on Shared Kubernetes
Yiming Yan, Hongyang Wang, Wenbo Chen, Xuan Wang, Jingguo Liu, Xian Li, Chen Qi, Leo Fan, Siwei Li, Qianli Wu,...
cs.DC · cs.AI · cs.LG
Agentic reinforcement learning (RL) often requires repeated tool calls in task-specific environments. A training job may create thousands of these environments in bursts while sharing a cluster with other jobs. We present Sandman, a sandbox service built and operated at Amazon for agent tool execution and evaluation. It serves multiple production agentic RL workloads on shared Kubernetes. A training framework supplies a task image and uses...
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.
#D99C5E. Built and served on an always-free VM. The masthead is set 14% letterspaced because newspapers do that and it works.