The Stanford Dash Multiprocessor
Computer
Compiler optimizations for eliminating barrier synchronization
PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
An integrated compile-time/run-time software distributed shared memory system
Proceedings of the seventh international conference on Architectural support for programming languages and operating systems
Barrier elimination based on access dependency analysis for OpenMP
ISPA'06 Proceedings of the 4th international conference on Parallel and Distributed Processing and Applications
Hi-index | 0.00 |
Since barrier synchronisation is a simple means to guarantee the order of data producing and data consuming, it is often used in parallel programmes. However, barrier synchronisation causes the processors' idle time to increase. To reduce the overhead of barrier synchronisation, we have proposed an algorithm which eliminates barrier synchronisations and evaluated its validity experimentally. In this paper, we model the behaviour of parallel programmes and stochastically analyse our algorithm. Using the behavioural model, we evaluated the execution time before eliminating barrier synchronisations as well as after eliminating barrier synchronisations. As a result, we confirmed the observations, which we have found experimentally, that is: 1) the ratio of improvement increases as the number of processors increases: 2) the balance of the load affects the improvement which is gained from eliminating barriers.