Abstract
In order to reduce the overhead of barrier synchronization, we have proposed an algorithm which eliminates barrier synchronizations and evaluated its validity experimentally in our previous study. As a result, we have found that the algorithm is more effective to the load-imbalanced program than load-balanced program. However, the degree of the load balance has not been discussed quantitatively. In this paper, we model the behavior of parallel programs. In our model, the execution time of a phase contained in a parallel program is represented as a random variable. To investigate how the degree of the load balance influences the performance of our algorithm, we varied the coefficient of variation of probability distribution which the random variable follows. Using the model, we evaluated the execution time of parallel programs and found that theoretical results are consistent with experimental ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
The term of \(phase\) which is used in the context of probability theory is unrelated to a phase which is included in parallel program.
References
Dwarkadas, S., Cox, A.L., Zwaenepoel, W.: An integrated compile-time/run-time software distributed shared memory system. In: Proceedings of International Conference on Architectural Support for Programming Languages and Operating Systems, pp. 186–197 (1996)
Tseng, C.W.: Compiler optimizations for eliminating barrier synchronization. In: Proceedings of the Fifth ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, July 2005, pp. 144–155 (1995)
Yonezawa, N., Wada, K.: Reducing idle times on matrix programs by eliminating barrier synchronization. IEICE J. J91-D(4), 907–921 (2008)
Yonezawa, N., Wada, K., Aida, T.: Barrier elimination based on access dependency analysis for OpenMP. In: Guo, M., Yang, L.T., Di Martino, B., Zima, H.P., Dongarra, J., Tang, F. (eds.) ISPA 2006. LNCS, vol. 4330, pp. 362–373. Springer, Heidelberg (2006)
Yonezawa, N., Kino, I., Wada, K.: Probabilistic analysis of time reduction by eliminating barriers in parallel programmes. Int. J. Commun. Netw. Distrib. Syst. 6(4), 404–419 (2011)
Sun, J., Peterson, G.D.: An effective execution time approximation method for parallel computing. IEEE Trans. Parallel Distrib. Syst. 23(11), 2024–2032 (2012)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yonezawa, N., Katou, K., Kino, I., Wada, K. (2014). Probabilistic Analysis of Barrier Eliminating Method Applied to Load-Imbalanced Parallel Application. In: Wyrzykowski, R., Dongarra, J., Karczewski, K., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2013. Lecture Notes in Computer Science(), vol 8385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-55195-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-55195-6_18
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-55194-9
Online ISBN: 978-3-642-55195-6
eBook Packages: Computer ScienceComputer Science (R0)