Probabilistic analysis of time reduction by eliminating barriers in parallel programmes Online publication date: Thu, 26-Feb-2015
by Naoki Yonezawa, Issei Kino, Koichi Wada
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 6, No. 4, 2011
Abstract: 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.
Online publication date: Thu, 26-Feb-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org