The design of MPI based distributed shared memory systems to support OpenMP on clusters

Authors:
H'sien J. Wong;A. P. Rendell
Affiliations:
Department of Computer Science, The Australian National University, Canberra ACT Australia;Department of Computer Science, The Australian National University, Canberra ACT Australia
Venue:
CLUSTER '07 Proceedings of the 2007 IEEE International Conference on Cluster Computing
Year:
2007

Citing 0
Cited 4

Micro-benchmarks for cluster OpenMP implementations: memory consistency costs

IWOMP'08 Proceedings of the 4th international conference on OpenMP in a new era of parallelism
Region-Based Prefetch Techniques for Software Distributed Shared Memory Systems

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Parallelization methods for implementation of discharge simulation along resin insulator surfaces

Computers and Electrical Engineering
An integrated, programming model-driven framework for NoC-QoS support in cluster-based embedded many-cores

Parallel Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

OpenMP can be supported in cluster environments by using distributed shared memory (DSM) systems. A portable approach for building DSM systems is to layer it on MPI. With these goals in mind, this paper makes two contributions. The first is a discussion about two software DSM systems that we have implemented using MPI. One uses background polling threads while the other uses processes that are driven only by incoming MPI messages. Comparisons of the two approaches show the latter to be a more scalable architecture that is better suited for the multi-core processors that are becoming commonplace. The second contribution recognizes that a common workaround for sub-team synchronizations in OpenMP is to use the flush directive on shared variables within busy-wait loops. In such a situation, only the flush in the last iteration of the busy-wait loop will result in the conditions necessary for exiting the loop. Thus transfer of the shared value need only be done if there were changes. We implement in our DSM a flush mechanism that eliminates the unnecessary data transfers entirely without any additional support or hints from the programmer.