A linear-time algorithm for optimal barrier placement

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 circular intervals. We show that barrier minimization is equivalent to finding a hierarchy of minimum cardinality point sets that cut all intervals. For a single loop, modeled as a simple family of circular intervals, a linear-time algorithm is known. We extend this result, finding a linear-time solution for nested circular interval families. This result solves the barrier minimization problem for general nested loops. Categories and Subject Descriptors D.3.3 [Programming Languages]: Language Constructs and Features—Concurrent programming structures; D.3.4 [Programming Languages]: Processors—Compilers, Optimization; F.2.2 [Analys...

• Type: Conference
• Year: 2005
• Where: PPOPP
• Authors: Alain Darte, Robert Schreiber
• Keywords: Barrier Minimization Problem, Circular Interval, Distributed And Parallel Computing, Nested, PPOPP 2005