Abstract
OpenMP is a shared memory programming API (see [2] or http://www.openmp.org ), brought on UMA and CC-NUMA architectures, which supports multithreaded applications.
The present study deals with the management and arrangement of memory, which may cause useless memory blocks reloading from the shared memory to the processors caches. This occurs for some memory access sensible applications, when programming with OpenMP: cache faults may congest the system and induce a communication over-cost between the processors. A new memory allocation model is presented, enabling us to solve the memory contention phenomenon in the specific case of shared memory programming with OpenMP.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adve, S., Adve, V., Hill, M., Vernon, M.: Comparison of Hardware and Software Cache Coherence Schemes. In: Proceedings of ISCA 1991, pp. 298–308. ACM, New York (1991)
Chandra, R., Dagum, L., Kohr, D., Maydan, D., McDonald, J., Menon, R.: Parallel Programming in OpenMP. Morgan Kaufmann, San Francisco (2000)
Habbas, Z., Krajecki, M., Singer, D.: Parallel Resolution of CSP with OpenMP. In: Proceedings of EWOMP 2000, pp. 1–8 (2000)
Itzkowitz, M., Wylie, B.J.N., Aoki, C., Kosche, N.: Memory Profiling using Hardware Counters. In: Proceedings of HPNC 2003, p. 17. ACM, New York (2003)
Jaillet, C., Krajecki, M.: Solving the Langford Problem in Parallel. In: Proceedings of ISPDC 2004, pp. 83–90. IEEE Computer Society, Los Alamitos (2004)
Krajecki, M., Jaillet, C., Bui, A.: Parallel Tree Search for Combinatorial Problems: a Comparative Study between OpenMP and MPI. Studia Informatica Universalis 4(2), 151–190 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jaillet, C., Krajecki, M. (2008). A New Memory Allocation Model for Parallel Search Space Data Structures with OpenMP. In: Chapman, B., Zheng, W., Gao, G.R., Sato, M., Ayguadé, E., Wang, D. (eds) A Practical Programming Model for the Multi-Core Era. IWOMP 2007. Lecture Notes in Computer Science, vol 4935. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69303-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-69303-1_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69302-4
Online ISBN: 978-3-540-69303-1
eBook Packages: Computer ScienceComputer Science (R0)