A linear-time algorithm for optimal barrier placement

Abstract

We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the barrier minimization problem. No full solution to the problem has been given previously.Here we model the problem with a new combinatorial structure, a nested family of sets of… (More)
DOI: 10.1145/1065944.1065949

10 Figures and Tables

Topics

  • Presentations referencing similar topics