Summary: Barrier Inference
Alexander Aiken \Lambda and David Gay \Lambda
EECS Department
University of California, Berkeley
Berkeley, CA 94720­1776
faiken,dgayg@cs.berkeley.edu
Abstract
Many parallel programs are written in SPMD style, i.e.
by running the same sequential program on all processes.
SPMD programs include synchronization, but it is easy to
write incorrect synchronization patterns. We propose a sys­
tem that verifies a program's synchronization pattern. We
also propose language features to make the synchroniza­
tion pattern more explicit and easily checked. We have
implemented a prototype of our system for Split­C and suc­
cessfully verified the synchronization structure of realistic
programs.
1 Introduction
Explicitly parallel programming---where the programmer
specifies the parallelism in a computation---is arguably the

Source: Aiken, Alex - Department of Computer Science, Stanford University

Collections: Computer Technologies and Information Sciences