Metraipolis › archive › dc_3322668f296f

Coded Computing for Dynamic System via Cartesian Products — arXiv:2609.39373

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.39373
License (as archived)
CC0-1.0
Archived
2026-10-07T14:40:42.123Z
SHA-256 of the archived text
57047ee664aac60765d15800bd79f53b6ba6805aa25949eb0de520d057f152cb
Stable URL of this page
https://metraipolis.com/documento/dc_3322668f296f

How to cite

Coded Computing for Dynamic System via Cartesian Products — arXiv:2609.39373 — arXiv (en), https://arxiv.org/abs/2609.39373 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3322668f296f (Metraipolis archive dc_3322668f296f, sha256 57047ee664aac60765d15800bd79f53b6ba6805aa25949eb0de520d057f152cb)
BibTeX
@misc{dc3322668f296f,
  title = {Coded Computing for Dynamic System via Cartesian Products — arXiv:2609.39373},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.39373},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3322668f296f; sha256 57047ee664aac60765d15800bd79f53b6ba6805aa25949eb0de520d057f152cb},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.39373. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper studies coded distributed computing (CDC) in a dynamic system in which workers may depart and new clusters may join. The caches of the surviving workers and their existing Reduce assignments stay untouched, while the storage brought by arriving clusters is put to use. In contrast to elastic computing, which targets linear functions, and to dynamic coded caching, which requires placement across all users, the model considered here accommodates general MapReduce tasks under a placement that is partly fixed and partly new. The proposed scheme builds cluster-wise placement delivery arrays (PDAs) and couples them through a Cartesian product. A delivery-aware rule reassigns the abandoned Reduce functions, and a generalized communication PDA allows even workers that hold no Reduce function to serve as coded transmitters. For arbitrary feasible disconnections, the exact load is derived. A file-wise converse for instantly decodable XOR multicasts shows that, in the absence of disconnections, the scheme lies within a factor of two of the best scheme in this multicast class when new clusters arrive, and within a factor of four otherwise, even when the benchmark optimizes over all feasible uncoded placements.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-10-01 in math.IT).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2609.39373 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-07T14:14:20.780Z dalla pagina https://arxiv.org/catchup/math.IT/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).