Title
Concurrency Analysis for Shared Memory Programs with Textually Unaligned Barriers
Abstract
Concurrency analysis is a static analysis technique that determines whether two statements or operations in a shared memory program may be executed by different threads concurrently. Concurrency relationships can be derived from the partial ordering among statements imposed by synchronization constructs. Thus, analyzing barrier synchronization is at the core of concurrency analyses for many parallel programming models. Previous concurrency analyses for programs with barriers commonly assumed that barriers are named or textually aligned. This assumption may not hold for popular parallel programming models, such as OpenMP, where barriers are unnamed and can be placed anywhere in a parallel region, i.e., they may be textually unaligned. We present in this paper the first interprocedural concurrency analysis that can handle OpenMP, and, in general, programs with unnamed and textually unaligned barriers.We have implemented our analysis for OpenMP programs written in C and have evaluated the analysis on programs from the NPB and SpecOMP2001 benchmark suites.
Year
DOI
Venue
2007
10.1007/978-3-540-85261-2_7
LCPC
Keywords
Field
DocType
concurrency analysis,textually unaligned barriers,concurrency relationship,parallel region,previous concurrency analysis,popular parallel programming model,shared memory programs,parallel programming model,static analysis technique,interprocedural concurrency analysis,textually unaligned barrier,openmp program,generic programming,static analysis,shared memory,partial order
Synchronization,Programming language,Shared memory,Concurrency,Computer science,Static analysis,Parallel computing,Multiversion concurrency control,Thread (computing),Concurrent object-oriented programming,Non-lock concurrency control
Conference
Volume
ISSN
Citations 
5234
0302-9743
8
PageRank 
References 
Authors
0.54
13
3
Name
Order
Citations
PageRank
Yuan Zhang1463.18
Evelyn Duesterwald2112188.40
Guang R. Gao32661265.87