David E Gay

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-97-965
July 1997

http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/CSD-97-965.pdf

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 system that verifies a program's synchronization pattern. We also propose language features to make the synchronization pattern more explicit and easily checked. We have implemented a prototype of our system for Split-C and successfully verified the synchronization structure of realistic programs.

BibTeX citation:

@techreport{Gay:CSD-97-965,
    Author = {Gay, David E},
    Title = {Barrier Inference},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {1997},
    Month = {Jul},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/5238.html},
    Number = {UCB/CSD-97-965},
    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 system that verifies a program's synchronization pattern. We also propose language features to make the synchronization pattern more explicit and easily checked. We have implemented a prototype of our system for Split-C and successfully verified the synchronization structure of realistic programs.}
}

EndNote citation:

%0 Report
%A Gay, David E
%T Barrier Inference
%I EECS Department, University of California, Berkeley
%D 1997
%@ UCB/CSD-97-965
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1997/5238.html
%F Gay:CSD-97-965