Abstract
The purpose of this benchmark is to test the existence of certain optimization techniques in current OpenMP compilers. Examples are the removal of redundant synchronization constructs and effective constructs for alternative code. 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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. M. Bull. Measuring synchronization and scheduling overheads in OpenMP. In First European Workshop on OpenMP, 1999.
Kazuhiro Kusano, Shigehisa Satoh, and Mitsuhisa Sato. Performance evaluation of the Omni OpenMP compiler. In WOMPEI 2000, Tokyo, Japan, Oct. 2000.
Omni OpenMP compiler, http://www.pdplab.trc.rwcp.or.jp/Omni.
RWCP. OpenMP version of nas parallel benchmarks. http://www.pdplab.trc.rwcp.or.jp/Omni/benchmarks/NPB/index.html.
SPEC. SPEComp 2001. http://www.spec.org.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Müller, M. (2001). Some Simple OpenMP Optimization Techniques. In: Eigenmann, R., Voss, M.J. (eds) OpenMP Shared Memory Parallel Programming. WOMPAT 2001. Lecture Notes in Computer Science, vol 2104. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44587-0_4
Download citation
DOI: https://doi.org/10.1007/3-540-44587-0_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42346-1
Online ISBN: 978-3-540-44587-6
eBook Packages: Springer Book Archive