Redundant synchronization elimination for DOACROSS loops

1999 ◽  
Vol 10 (5) ◽  
pp. 459-470 ◽  
Author(s):  
Ding-Kai Chen ◽  
Pen-Chung Yew
Keyword(s):  
Redundant Synchronization

Static Analysis to Reduce Synchronization Costs Data-Parallel Programs with Remote Memory Copy

1997 ◽  
Vol 07 (02) ◽  
pp. 145-156
Author(s):  
Manish Gupta ◽  
Edith Schonberg
Keyword(s):  
Cache Coherence ◽  
Remote Memory ◽  
Communication Analysis ◽  
Data Parallel ◽  
Multiple Data ◽  
Production And Consumption ◽  
Cache Coherence Protocol ◽  
Data Transfers ◽  
Redundant Synchronization ◽  
Important Objective

For a program with sufficient parallelism, reducing synchronization costs is an important objective for achieving efficient execution. This paper presents a novel methodology for reducing synchronization costs of programs compiled for SPMD execution. This methodology combines data flow analyisis with communication analysis to determine the ordering between production and consumption of data on different processors, which helps in identifying redundant synchronization. The resulting framework is more powerful than any that have been previously presented, as it provides the first algorithm that can eliminate synchronization messages even from computations that need communication. We show that several commonly occuring computation patterns such as reductions and stencil computations with reciprocal producer-consumer relationship between processors lend themselves well to this optimization, an observation that is confirmed by an examination of some HPE benchmark programs. Our framework also recognizes situations where the synchronization needs for multiple data transfers can be satisfied by a single synchronization message. This analysis, while applicable to all shared memory machines as well, is especially useful for those with a flexible cache-coherence protocol, as it identifies efficient ways of moving data directly from producers to consumers, often without any extra synchronization.

scholarly journals An OpenMP Compiler Benchmark

2003 ◽  
Vol 11 (2) ◽  
pp. 125-131 ◽  
Author(s):  
Matthias S. Müller
Keyword(s):  
Optimization Techniques ◽  
Alternative Code ◽  
Redundant Synchronization

The purpose of this benchmark is to propose several optimization techniques and to test their existence in current OpenMP compilers. Examples are the removal of redundant synchronization constructs, effective constructs for alternative code and orphaned directives. The effectiveness of the compiler generated code is measured by comparing different OpenMP constructs and compilers. If possible, we also compare with the hand coded "equivalent" solution. Six out of seven proposed optimization techniques are already implemented in different compilers. However, most compilers implement only one or two of them.

Sign in / Sign up

Export Citation Format

Share Document