cs.DC · 2026-10-20 · No. 149
Distributed, Parallel, and Cluster Computing, 2026-10-20.
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
FaaSpot: Fault-Tolerant Serverless Workflow Execution on Spot Instances
Bandhan Patel, Sushruth Harsha, Kwangsung Oh, In Kee Kim
cs.DC
Serverless computing is increasingly used to run complex DAG workflows across diverse applications, and individual function execution times have grown to support them, pushing workflow makespans to hours. Open-source serverless platforms, deployed on a pool of VMs, typically use on-demand instances, and their cost increases with the makespan. Spot instances are far cheaper, but a preemption is likely before the workflow finishes. A preemption...
-
02
CQTwin: A Digital-Twin Toolkit for Operational Analytics of HPC Schedulers
Kanglin Xu, Yash Kurkure, Yihe Zhang, Michael E. Papka, Zhiling Lan
cs.DC · cs.PF
HPC facilities collect years of job scheduler records, yet much of this operational data remains underused because accessible tools for turning it into actionable insight are scarce. We present CQTwin, an open-source digital-twin toolkit for operational analytics of HPC scheduling data. CQTwin addresses this gap through two complementary modes: offline trace replay and online event-driven simulation. Built on the Python-based CQSim...
-
03
SafeWall: A Risk-Aware Job Walltime Recommendation for HPC Scheduling
Kanglin Xu, Michael Papka, Zhiling Lan
cs.DC · cs.LG
In high-performance computing (HPC), users must submit resource requirements for their jobs, with user-supplied walltime being a critical parameter. However, these estimates are notoriously inaccurate, as users tend to overestimate walltime to prevent the scheduler from terminating their jobs prematurely. While existing work on learning-based walltime prediction primarily focuses on maximizing prediction accuracy, such predictions are...
-
04
KrMM Recurrences: HPC-Enhanced Estimators for Nonlinear Classical Shadows
Matthias Gruber, Sabrina Herbst, Ivona Brandic, Vincenzo De Maio
cs.DC · cs.ET · quant-ph
While quantum technologies are rapidly evolving, near-term applications heavily rely on hybrid quantum-classical paradigms. Among these, the classical shadows framework has gained a lot of traction, not only for quantum information science, but also for the development and verification of quantum hardware. It allows to efficiently classically estimate many properties of quantum states from randomized measurements alone, a task that is...
-
05
Pangolin: Efficient DAG-based BFT State-Machine Replication with TEE-Accelerated Commitment
Paul Franke-Bergmann, Maya Kuhlmann, Alexander Heß, Marc Leinweber, Rüdiger Kapitza, Hannes Hartenstein, Franz J....
cs.DC
Currently many Byzantine fault-tolerant (BFT) protocols use directed acyclic graphs (DAGs) to let replicas propose blocks of requests in parallel for improved throughput. Yet, the existing DAG-based designs mainly consider the atomic-broadcast layer: They typically do not describe an efficient client interaction layer, their garbage collection is either unspecified or relies on trusted external storage, and the lowest-latency designs rely on...
-
06
Bridging In-Situ Visualization to Game Engines: From ParaView Catalyst via ANARI to Unreal Engine
Thomas George, Severin A. T. Klapproth, Jens Henrik Göbbert, Jonathan Windgassen, Andreas Adelmann, Sriramkrishnan...
cs.DC
In-situ high-performance computing (HPC) simulations produce massive datasets that remain difficult to stream into game engines for interactive visualization. We present an in-situ, disk-free pipeline that couples simulation data to Unreal Engine 5 through ParaView's ANARI rendering API. A modified ANARI-USD device captures Universal Scene Description (USD) scene graphs in memory at the ANARI layer and streams the engine-agnostic USD format...
-
07
GeoTrain: Energy-Aware Automatic Parallelism for Foundation Model Training on Heterogeneous Geo-Distributed Resources
Bui-Khanh Hoang, TianZhang He, Mohammad Goudarzi
cs.DC
Training foundation models at the frontier typically requires large-scale dedicated and centralized clusters with fast interconnects - infrastructure that is prohibitively expensive and generally accessible only to well-resourced organizations. Decentralized training over pooled, geographically distributed GPUs offers an alternative, but introduces substantial heterogeneity in compute, memory, power, and network performance. Existing...
-
08
CEMA-Router: Infrastructure-Aware Batch Routing for LLM Inference in Cloud-Edge Systems
Xijia Wang, TianZhang He, Mohammad Goudarzi
cs.DC
Large language models (LLM) are increasingly integrated into pervasive applications spanning heterogeneous cloud-edge resources. These heterogeneous resources differ in computational capacity, energy efficiency, network conditions, and deployed model quality, creating trade-offs among response quality, monetary cost, energy consumption, and batch completion time when routing inference requests. Existing LLM routers typically make per-query...
-
09
Holistic Buoyancy-Driven Cloud Native Resource Management
Oliver Larsson, Thijs Metsch, Cristian Klein, Erik Elmroth
cs.DC
Efficient resource management is a challenge in multi-tenant cloud environments as workloads compete for shared resources such as last-level cache and memory bandwidth, whose congestion can change dynamically as workload composition and resource demands evolve. Existing resource management approaches often rely on static resource requirements or prior workload profiling, limiting their ability to respond to changing resource contention as...
-
10
Fault-Tolerant Offloading Framework for Real-Time Applications in Mobile Edge Computing
Chuanchao Gao, Yiyang Gao, Michael Yuhas, Arvind Easwaran
cs.DC
This paper studies a Deadline-constrained task Offloading and resource Allocation Problem (DOAP) in a backhaul-network-enabled Mobile Edge Computing (MEC) system with both bandwidth and computational resource constraints. The goal is to maximize the total inference accuracy improvement across all tasks. We formulate this problem, denoted as $\mathbf{P}$, as an Integer Linear Programming (ILP) problem and show it is NP-hard via a reduction...
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.