Priority Based Messaging for Software Distributed Shared Memory

Authors:
Sven Karlsson;Mats Brorsson
Affiliations:
Department of Microelectronics and Information Technology, Royal Institute of Technology, Stockholm, Sweden;Department of Microelectronics and Information Technology, Royal Institute of Technology, Stockholm, Sweden
Venue:
Cluster Computing
Year:
2003

Citing 0
Cited 3

Design and Evaluation of Dynamic Key Message Algorithms for Cluster Computing

HPCASIA '05 Proceedings of the Eighth International Conference on High-Performance Computing in Asia-Pacific Region
A distributed Key Message algorithm to optimize the communication in clusters

Parallel Computing
An introduction to Balder: an OpenMP run-time library for clusters of SMPs

IWOMP'05/IWOMP'06 Proceedings of the 2005 and 2006 international conference on OpenMP shared memory parallel programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

Software Distributed Shared Memory (DSM) systems can be used to provide a coherent shared address space on multicomputers and other parallel systems without support for shared memory in hardware. The coherency software automatically translates shared memory accesses to explicit messages exchanged among the nodes in the system. Many applications exhibit a good performance on such systems but it has been shown that, for some applications, performance critical messages can be delayed behind less important messages because of the enqueuing behavior in the communication libraries used in current systems. We present in this paper a new portable communication library that supports priorities to remedy this situation. We describe an implementation of the communication library and a quantitative model that is used to estimate the performance impact of priorities for a typical situation. Using the model, we show that the use of high-priority communication reduces the latency of performance critical messages substantially over a wide range of network design parameters. The latency is reduced with up to 10–25% for each delaying low priority message in the queue ahead.