cs.DC · 2026-11-09 · No. 168

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

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

01 — The papers

9 entries
  1. 01

    Concurrent Use of FP32 and FP64 Computing Units on GPUs and Mixed-Precision Placement in WENO Reconstruction

    Jun Hatayama, Daichi Mukunoki, Yusuke Onishi, Atsushi Sekimoto, Toshinori Kouchi

    cs.DC

    Scientific computing often requires FP64 arithmetic, although FP64 performance is limited on NVIDIA GPUs. Double-float (DF) emulation, which represents a value using two FP32 values with about 48 bits of significand, outperforms native FP64 where FP64 units are limited. On the other hand, mixed-precision strategies offload to FP32 the operations that do not determine accuracy. In both approaches, the native FP64 units remain idle during FP32...

    arxiv.org/abs/2611.09651 · PDF

  2. 02

    Fast and Actionable Classification of HPC I/O Time Series

    Maxime Gonthier, Luan Teylo, Francesco Antici, Mihail Popov, Francieli Boito

    cs.DC

    Input/output (I/O) is a major bottleneck for highperformance computing (HPC) performance. One of the challenges is the contention between jobs when sharing the parallel file system. However, tackling this issue depends on knowing the temporal behavior of jobs. In this paper, we propose a clusteringbased approach to characterize jobs' temporal I/O behavior. We propose SAGE, a lightweight method that cuts I/O traces into short windows and...

    arxiv.org/abs/2611.09646 · PDF

  3. 03

    Towards Sustainable Federated Learning via Carbon-Aware Client Selection

    Wentao Gao, Omid Tavallaie, Albert Y. Zomaya

    cs.DC

    The Information/Communication Technology (ICT) industry is severely challenging the global environment due to the sharply rising carbon emissions generated by machine learning (ML) workloads. Federated Learning (FL) is one of the prominent distributed ML systems used in applications with billions of client devices, such as Google Gboard and Apple Siri. Nearly half of the total carbon footprint in FL originates from client-side computation...

    arxiv.org/abs/2611.09552 · PDF

  4. 04

    Nebula: Distributed Position-Independent Caching for LLM Serving

    Yifei Liu, Junbin Pan, Junhao Hu, Yang Liu, Junyi Chen, Juntong Wu, Chen Chen, Haiyuan Zhao, Xiaoxu Chen, Weihang Chen

    cs.DC

    Modern LLM workflows, such as retrieval-augmented generation (RAG) and LLM agents, build long prompts from multiple independent text segments, making prefill a major source of computation. Reusing KV caches is therefore important for reducing serving costs and latency: distributed caching systems spread KV cache across a cluster to increase aggregate capacity, while position-independent caching (PIC) enables reuse of recurring segments under...

    arxiv.org/abs/2611.09474 · PDF

  5. 05

    DataHelix: A CPU-GPU Co-Scheduling Data Plane for Multimodal Model Training

    Yuanhe Li, Jiazhen Wu, Dian Ding, Guangtao Xue, Yiming Zhang

    cs.DC · cs.AI

    Multimodal model training breaks the loose coupling between data loading and model execution assumed by conventional training pipelines. Large per-sample variation in decoding cost, token/latent count, and tensor size causes both CPU preprocessing time and GPU compute time to vary substantially across data-parallel ranks (training processes). In synchronous training, these two sources of heterogeneity interact tightly: GPU execution...

    arxiv.org/abs/2611.09411 · PDF

  6. 06

    Green500: Adventure in Qualifying a Cluster

    Nicolas Richart, Xavier Ouvrard, Julia Paolini, Manuel Cubero-Castan, Gilles Fourestey

    cs.DC

    Energy effciency has become a key metric for evaluating High Performance Computing (HPC) systems, as reflected by the Green500 ranking. However, energy effciency alone does not capture the full environmental impact of an HPC cluster. Using the Kuma cluster at EPFL, we report on two Green500 measurement campaigns at Level 2 and Level 3, and extend this analysis to a full carbon footprint assessment using the MITSI life-cycle based methodology....

    arxiv.org/abs/2611.09251 · PDF

  7. 07

    RPEG: Training Reasoning Language Models Scalably and Cost-Effectively

    Maciej Besta, Leonard Schmidt, Pierre Pang, Patrik Okanovic, Robert Gerstenberger, Torsten Hoefler

    cs.DC · cs.AI · cs.CL · cs.LG · cs.PF

    Reinforcement learning (RL) is now central to training Reasoning Language Models (RLMs), but RLM pipelines are difficult to scale and costly to run because each RL step couples multiple large models, heterogeneous stages, cross-step state, and complex asynchronous dependencies. Existing systems typically optimize only parts of this design space. We address this complexity by jointly optimizing the pipeline structure as well as its execution...

    arxiv.org/abs/2611.09207 · PDF

  8. 08

    UniExit: A Unified Latency-Aware Early-Exit Runtime for Heterogeneous Edge AI

    Yuhang Guan, Huanle Zhang, Xiaomin Ouyang, Zhidan Liu

    cs.DC

    Edge applications increasingly combine CNN-based perception with edge-deployable Transformer-based language models, but deploying such heterogeneous workloads on resource-constrained devices is challenging because inference latency varies with both input difficulty and runtime hardware state. Early-exit inference reduces computation by terminating at intermediate stages, yet existing methods are often model-specific and rely on static latency...

    arxiv.org/abs/2611.09159 · PDF

  9. 09

    DARIC: A Position-Independent KV Cache Reuse System with Distribution-Aware Recomputation

    Weikang Wang, Haiyang Liu, Xin Zhou, Jun Liu, Weifeng Zhang

    cs.DC

    The context lengths of large language models (LLMs) are rapidly increasing in real-world applications such as agentic systems and retrieval-augmented generation (RAG). To accelerate LLM inference in these scenarios, reusing position-independent key-value (KV) caches across requests has emerged as a promising approach. This technique typically relies on recomputing a selected subset of tokens to restore cross-chunk interactions. However,...

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