Sorting on Clusters of SMPs

dc.contributor.authorHelman, David R.en_US
dc.contributor.authorJaJa, Josephen_US
dc.date.accessioned2004-05-31T22:47:49Z
dc.date.available2004-05-31T22:47:49Z
dc.date.created1997-11en_US
dc.date.issued1998-10-15en_US
dc.description.abstractClusters of symmetric multiprocessors (SMPs) have emerged as the primary candidates for large scale multiprocessor systems. In this paper, we introduce an efficient sorting algorithm for clusters of 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 we are aware of. 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. (Also cross-reference as UMIACS-TR-97-69en_US
dc.format.extent3917308 bytes
dc.format.mimetypeapplication/postscript
dc.identifier.urihttp://hdl.handle.net/1903/916
dc.language.isoen_US
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_US
dc.relation.isAvailableAtUniversity of Maryland (College Park, Md.)en_US
dc.relation.isAvailableAtTech Reports in Computer Science and Engineeringen_US
dc.relation.isAvailableAtUMIACS Technical Reportsen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-3833en_US
dc.relation.ispartofseriesUMIACS; UMIACS-TR-97-69en_US
dc.titleSorting on Clusters of SMPsen_US
dc.typeTechnical Reporten_US
Files
Original bundle
Now showing 1 - 2 of 2
Loading...
Thumbnail Image
Name:
CS-TR-3833.ps
Size:
3.74 MB
Format:
Postscript Files
Description:
Loading...
Thumbnail Image
Name:
CS-TR-3833.pdf
Size:
274.2 KB
Format:
Adobe Portable Document Format
Description:
Auto-generated copy of CS-TR-3833.ps