A New Memory Allocation Model for Parallel Search Space Data Structures with OpenMP

Authors:
Christophe Jaillet;Michaël Krajecki
Affiliations:
CReSTIC SysCom, Université de Reims Champagne-Ardenne, Reims cedex 2, 51687;CReSTIC SysCom, Université de Reims Champagne-Ardenne, Reims cedex 2, 51687
Venue:
IWOMP '07 Proceedings of the 3rd international workshop on OpenMP: A Practical Programming Model for the Multi-Core Era
Year:
2007

Citing 4
Cited 0

Comparison of hardware and software cache coherence schemes

ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Parallel programming in OpenMP

Parallel programming in OpenMP
Solving the Langford Problem in Parallel

ISPDC '04 Proceedings of the Third International Symposium on Parallel and Distributed Computing/Third International Workshop on Algorithms, Models and Tools for Parallel Computing on Heterogeneous Networks
Memory Profiling using Hardware Counters

Proceedings of the 2003 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

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.