Metraipolis › archive › dc_db9dba0be02c

Cyclotron: A Recurrence Language for Expressing Interprocessor Communication — arXiv:2610.20981

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.20981
License (as archived)
CC0-1.0
Archived
2026-10-16T10:04:27.150Z
SHA-256 of the archived text
ae28005c56a5ca62b81106b6d3859ecc963ea683a8462bd352e3e9c5f17f4629
Stable URL of this page
https://metraipolis.com/documento/dc_db9dba0be02c

How to cite

Cyclotron: A Recurrence Language for Expressing Interprocessor Communication — arXiv:2610.20981 — arXiv (en), https://arxiv.org/abs/2610.20981 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db9dba0be02c (Metraipolis archive dc_db9dba0be02c, sha256 ae28005c56a5ca62b81106b6d3859ecc963ea683a8462bd352e3e9c5f17f4629)
BibTeX
@misc{dcdb9dba0be02c,
  title = {Cyclotron: A Recurrence Language for Expressing Interprocessor Communication — arXiv:2610.20981},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.20981},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db9dba0be02c; sha256 ae28005c56a5ca62b81106b6d3859ecc963ea683a8462bd352e3e9c5f17f4629},
  year = {2026}
}

Archived text

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

We present Cyclotron, a compiler that expresses streaming dataflow algorithms using recurrence equations, which are then compiled to distributed topologies of interlinked processors. Our compiler lowers a language of recurrences over logical iteration spaces into per-processor programs of sends, receives, and computations. In these recurrences, data accesses are not limited to external accesses to memory; data can live separately on the iteration space itself, allowing internal points to communicate values directly with other points. Users specify this communication directly in the recurrence language, which allows them to express various communication patterns such as a nearest-neighbor systolic exchange, a one-to-all broadcast, a bidirectional split ring, or an asymmetric and piecewise broadcast pattern, which are often not supported by standard distributed linear algebra libraries. These recurrences describe the algorithm and communication independently of how they map onto the hardware. A programmer then chooses which dimensions execute across processors and which execute over time, without rewriting the entire program. Users only specify data dependencies across the iteration space, and the compiler safely generates a program, per process, with correct placement of both communication and computational operators according to the chosen space--time mapping. We evaluate distributed matrix multiplication, TRSM, Cholesky, and fused Cholesky--TRSM on up to 16 CPU nodes and 16 GPUs, comparing against ScaLAPACK, SLATE, and cuSolverMp. Cyclotron is competitive with and often outperforms these hand-optimized libraries; for Cholesky, the best communication strategy changes with problem size and architecture.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2610.20981 — 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-16T08:45:02.675Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).