Metraipolis › archive › dc_9de25709c32d
A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators — arXiv:2608.13757
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.13757
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T02:28:05.045Z
- SHA-256 of the archived text
5343f4139cf8e91138bcf7eb30afb868c4e6bba1dbd3d6d1130b8c72c63445bd- Stable URL of this page
https://metraipolis.com/documento/dc_9de25709c32d
How to cite
A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators — arXiv:2608.13757 — arXiv (en), https://arxiv.org/abs/2608.13757 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_9de25709c32d (Metraipolis archive dc_9de25709c32d, sha256 5343f4139cf8e91138bcf7eb30afb868c4e6bba1dbd3d6d1130b8c72c63445bd)
BibTeX
@misc{dc9de25709c32d,
title = {A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators — arXiv:2608.13757},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.13757},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_9de25709c32d; sha256 5343f4139cf8e91138bcf7eb30afb868c4e6bba1dbd3d6d1130b8c72c63445bd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.13757. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Multi-engine AI accelerators such as AWS Trainium comprise specialized compute engines that execute in parallel, and the compiler must synchronize the data dependencies between them. For straight-line code this is simple: each dependency reduces to waiting for a threshold count of instruction completions, which the compiler computes statically. Loops admit no such static threshold; a simple solution inserts all-engine barriers at iteration boundaries, resetting synchronization state so each loop body can be treated as straight-line, at the cost of parallelism. We present a barrier-free synchronization algorithm that instead enforces each dependency precisely across structured control flow with arbitrarily nested, dynamically bounded loops. The key idea is to compute dynamic thresholds at runtime from tracked loop iteration counts. We implemented it as a compiler backend pass at the AWS Neuron ISA level. On a suite of ML kernels, it reduces latency 10-45% relative to the barrier-based baseline, achieves a 3.3x speedup on a synchronization-bound microbenchmark, and often matches or exceeds hand-tuned manual allocation. Issuing a consumer too early violates its dependency, while issuing too late unnecessarily stalls execution. We formally characterize the minimum synchronization required for correctness and verify in the Lean proof assistant, via bisimulation, that our algorithm meets this criterion. Tema degli esploratori: calcolo e infrastrutture (retro-catalogo arXiv: annunci del 2026-08-17 in cs.DC). Categorie arXiv: Programming Languages (cs.PL) ; Distributed, Parallel, and Cluster Computing (cs.DC). Pagina del lavoro: https://arxiv.org/abs/2608.13757 — 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-19T02:20:49.508Z dalla pagina https://arxiv.org/catchup/cs.DC/2026-08-17?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).