Reproduce “On Thread Convergence” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Vinod Grover, Manjunath Kudlur
The authors propose a control-flow analysis that identifies nodes and edges where a barrier is guaranteed to synchronize all threads in a block. The work-list algorithm propagates convergence using branch and merge rules, with a linear cost in graph nodes and edges. It assumes well-synchronized programs; unknown means convergence was not proved, not that synchronization is unsafe. No empirical evaluation is reported.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.