cs.DC · 2026-07-25 · No. 64

Distributed, Parallel, and Cluster Computing, 2026-07-25.

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

01 — The papers

4 entries
  1. 01

    Controlled Periodic Synchronization for Efficient Data-Parallel Training

    Imane Ettifouri, Mostapha Zbakh, Claude Tadonki

    cs.DC

    Data-parallel training relies on frequent gradient synchronization across workers. Standard DDP synchronizes gradients at every iteration, which is effective on fast local-area networks but increasingly sensitive to communication latency and network variability in geographically distributed environments. Periodic methods such as LocalSGD reduce synchronization frequency but rely mainly on parameter averaging, which may be insufficient when...

    arxiv.org/abs/2607.21224 · PDF

  2. 02

    Solving Large Traveling Salesman Problems (TSPs) by a Recursive Clustering Algorithm and a Scalable FPGA-Based Implementation

    Junqi Huang, Hawraa Abbas Almurieb, T. Nandha Kumar, Haider A. F. Almurib, Fabrizio Lombardi

    cs.DC

    The Traveling Salesman Problem (TSP) continues to attract significant research interest due to its critical role in various applications. This paper introduces a recursive clustering approach that divides cities into a limited number of clusters, each containing up to five cities and its own centroid. Constrained TSP and simulated annealing techniques are employed to route cities within each cluster, using the centroids of neighboring...

    arxiv.org/abs/2607.21182 · PDF

  3. 03

    Multimmit: Extending Blocks for Faster Finality

    Andrew Lewis-Pye, Patrick O'Grady

    cs.DC

    To meet the throughput demands of modern blockchain systems, protocols for State Machine Replication (SMR) increasingly have many processors disseminate blocks of transactions in parallel, with consensus then establishing a total ordering on the blocks of all producers. Such designs face a choice as to when a block may enter the ordering. Certified approaches wait for a quorum to attest a block's availability, which is robust but adds message...

    arxiv.org/abs/2607.21021 · PDF

  4. 04

    The Consensus Number of Untraceable Cryptocurrencies

    Christian Cachin, David Lehnherr, Juan Villacis, François-Xavier Wicht

    cs.DC · cs.CR

    Sender untraceability hides the account spent by a cryptocurrency transfer among a set of candidates, its masking set. What a transfer does to that set separates two designs: classical schemes retain the whole set and append a nullifier marking the spent account, so the ledger grows with every transfer; constant-state schemes instead consume and replace the entire set. We ask how this choice affects synchronization. We formalize the two...

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