[2608.13757] A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators

Skip to main content

Search arXiv

Press Enter to search · Advanced search

-->

Computer Science > Programming Languages

arXiv:2608.13757 (cs)

[Submitted on 13 Aug 2026]

Title:A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators

Authors:Chungha Sung, Nikil V. Shyamsunder, Hanliang Zhang, Daniel Kroening, Joonwon Choi<br>View a PDF of the paper titled A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators, by Chungha Sung and 4 other authors

View PDF<br>HTML (experimental)

Abstract: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.

Comments:<br>To appear in the 2027 IEEE/ACM International Symposium on Code Generation and Optimization (CGO '27). 16 pages, 8 figures, 2 tables

Subjects:

Programming Languages (cs.PL); Distributed, Parallel, and Cluster Computing (cs.DC)

Cite as:<br>arXiv:2608.13757 [cs.PL]

(or<br>arXiv:2608.13757v1 [cs.PL] for this version)

https://doi.org/10.48550/arXiv.2608.13757

Focus to learn more

arXiv-issued DOI via DataCite (pending registration)

Submission history<br>From: Chungha Sung [view email]<br>[v1]<br>Thu, 13 Aug 2026 20:35:02 UTC (75 KB)

Full-text links:<br>Access Paper:

View a PDF of the paper titled A Barrier-Free Synchronization Algorithm for Multi-Engine AI Accelerators, by Chungha Sung and 4 other authors<br>View PDF<br>HTML (experimental)<br>TeX Source

view license

Current browse context:

cs.PL

next >

new<br>recent<br>| 2026-08

Change to browse by:

cs<br>cs.DC

References & Citations

NASA ADS<br>Google Scholar

Semantic Scholar

export BibTeX citation<br>Loading...

BibTeX formatted citation

&times;

loading...

Data provided by:

Bookmark

Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle

Bibliographic Explorer (What is the Explorer?)

Connected Papers Toggle

Connected Papers (What is Connected Papers?)

Litmaps Toggle

Litmaps (What is Litmaps?)

scite.ai Toggle

scite Smart Citations (What are Smart Citations?)

Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle

alphaXiv (What is alphaXiv?)

Links to Code Toggle

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub Toggle

DagsHub (What is DagsHub?)

GotitPub Toggle

Gotit.pub (What is GotitPub?)

Huggingface Toggle

Hugging Face (What is Huggingface?)

ScienceCast Toggle

ScienceCast (What is ScienceCast?)

Demos

Demos

Replicate Toggle

Replicate (What is Replicate?)

Spaces Toggle

Hugging Face Spaces (What is Spaces?)

Spaces Toggle

TXYZ.AI (What is TXYZ.AI?)

Related Papers

Recommenders and Search Tools

Link to Influence Flower

Influence Flower (What are Influence Flowers?)

Core recommender toggle

CORE Recommender (What is CORE?)

Author

Venue

Institution

Topic

About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .

Which authors of this paper are endorsers? |<br>Disable MathJax (What is MathJax?)

Major funding support from