Sorting on clusters of SMPs

Author

Helman, D.R.

Author_Institution

Dept. of Electr. Eng., Maryland Univ., College Park, MD

fYear

1998

fDate

30 Mar-3 Apr 1998

Firstpage

561

Lastpage

567

Abstract

We introduce an efficient algorithm for sorting on clusters of symmetric multiprocessors (SMPs). This algorithm relies on a novel scheme for stably sorting on a single SMP coupled with balanced regular communication on the cluster. Our SMP algorithm seems to be asymptotically faster than any of the published algorithms. The algorithms were implemented in C using POSIX threads and the SIMPLE library of communication primitives and run on a cluster of DEC AlphaServer 2100A systems. Our experimental results verify the scalability and efficiency of our proposed solution and illustrate the importance of considering both memory hierarchy and the overhead of shifting to multiple nodes

Keywords

DEC computers; Unix; multiprocessing systems; parallel algorithms; software libraries; software performance evaluation; sorting; C language; DEC AlphaServer 2100A systems; POSIX threads; SIMPLE library; SMP algorithm; balanced regular communication; communication primitives; memory hierarchy; multiple nodes; parallel algorithm; scalability; sorting; symmetric multiprocessor clusters; Algorithm design and analysis; Clustering algorithms; Computational modeling; Educational institutions; Large-scale systems; Sampling methods; Scalability; Sorting; Switched-mode power supply; Yarn;

fLanguage

English

Publisher

ieee

Conference_Titel

Parallel Processing Symposium, 1998. IPPS/SPDP 1998. Proceedings of the First Merged International ... and Symposium on Parallel and Distributed Processing 1998

Conference_Location

Orlando, FL

ISSN

1063-7133

Print_ISBN

0-8186-8404-6

Type

conf

DOI

10.1109/IPPS.1998.669981

Filename

669981