DMCA
Sorting on the SGI Origin 2000: Comparing MPI and Shared Memory Implementations
BibTeX
@MISC{Jiménez-gonzález_sortingon,
author = {D. Jiménez-gonzález and E. Guinovart and J. -l. Larriba-pey and J. J. Navarro},
title = {Sorting on the SGI Origin 2000: Comparing MPI and Shared Memory Implementations},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we analyse the Communication and Cache Conscious Radix sort algorithm, C 3-Radix, using the distributed and the shared memory parallel programming models. C 3-Radix was originally proposed based on the idea of the classic Radix sort to exploit the memory hierarchy locality and reduce the amount of communication for distributed memory computers. Here, we implement C 3-Radix on the SGI Origin 2000 NUMA multiprocessor and make use of the Message Passing Interface (MPI) and the native shared memory directives of that computer to implement the two programming models that we want to analyse. We give results for up to 16 processors and 64M 32bit keys. The results show that for data sets that are small compared to the number of processors, the MPI implementation is faster while for data sets that are large, the shared memory implementation is faster. In the paper, we explain the reasons for the different behaviours depending on the size of the data sets. 1.
Keyphrases
shared memory implementation sgi origin data set different behaviour mpi implementation programming model cache conscious radix sort algorithm shared memory parallel programming model classic radix sort distributed memory computer memory hierarchy locality native shared memory directive numa multiprocessor message passing interface
