Skip to content
Preprint

Cyclotron: A Recurrence Language for Expressing Interprocessor Communication

Oct 2026 · 0 citations · 41 references
Computer Science

TL;DR

Cyclotron is a compiler that expresses streaming dataflow algorithms using recurrence equations, which are then compiled to distributed topologies of interlinked processors, and is competitive with and often outperforms these hand-optimized libraries.

Abstract

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.

View source

Similar papers

Preprint Nov 2026

TauLang: A Language and Compiler for Space-Time Programming on Statically Scheduled Accelerators

Statically scheduled accelerators such as Groq's Tensor Streaming Processor (TSP) achieve low-latency large language model inference by stripping dynamic synchronization hardware from the chip. With no caches, arbiters, or hardware schedulers, the compiler must fix the exact slice and issue cycle of every operation, so...

Xu-Xiao Yang, Jun-Chi Wu, Yu-Qi Peng et al. · 0 citations
Preprint Nov 2026

Vectorizing Recurrences over Semirings

Recurrences are ubiquitous in signal and image processing, bioinformatics, numerical computing, combinatorial optimization, and many other domains. Because recurrences seem inherently sequential, they are often implemented serially and thus do not leverage vector instructions in modern hardware. This leaves much of the...

Yi-Hong Zhang, Bala Vinaithirthan, Karima Ma et al. · 0 citations
Sep 2026

The Canonical Parallel Form as a Substrate for Parallelizing Compilers and Agentic Optimizers

The Canonical Parallel Form (CPF), a device-neutral program state from which every ordering constraint the authors' analyses prove unnecessary has been removed, is introduced, a device-neutral program state from which every ordering constraint their analyses prove unnecessary has been removed.

Yakup Budanaz, Pratyai Mazumder, A. Calotoiu et al. · 1 citation
Sep 2026

Tiga: Compiling Graph Message Passing at Scale

Tiga is presented, a just-in-time compiler that separates the definition of a message-passing program from how its interactions are traversed, computed, and stored, enabling traversal specialization, fusion of relation generation with aggregation, and reverse-mode automatic differentiation.

Ming-Yuan Chi · 0 citations
Book Open access Sep 2026

Schedules Are Solvable Symbols: Tuning-Free Compilation of Tile Programs on Dataflow Architectures

Loom, a tuning-free symbolic compiler framework for tile-based SPMD programs on spatial dataflow architectures, is presented, suggesting that hardware-derived symbolic compilation provides a retargetable alternative to profiling-based tuning for spatial dataflow architectures while remaining interpretable by keeping op...

He-Ru Wang, Wei Li, Zhen-Yu Bai et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.