LoboVault Home
 

A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation

LoboVault

Please use this identifier to cite or link to this item: http://hdl.handle.net/1928/69

A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation

Show simple item record

dc.contributor.author Helman, D.R. en_US
dc.contributor.author Bader, D.A. en_US
dc.contributor.author JáJá, J. en_US
dc.date.accessioned 2006-03-10T07:23:44Z
dc.date.available 2006-03-10T07:23:44Z
dc.date.issued 1998-11
dc.identifier.uri http://hdl.handle.net/1928/69
dc.description Technical Report en_US
dc.description.abstract We introduce a new deterministic parallel sorting algorithm for distributed memory machines based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communication in a scheme that yields very good load balancing with virtually no overhead. Moreover, unlike previous variations, our algorithm efficiently handles the presence of duplicate values without the overhead of tagging each element with a unique identifier. This algorithm was implemented in SPLIT-C and run on a variety of platforms, including the Thinking Machines CM-5, the IBM SP-2-WN, and the Cray Research T3D. We ran our code using widely different benchmarks to examine the dependence of our algorithm on the input distribution. Our experimental results illustrate the efficiency and scalability of our algorithm across different platforms. In fact, the performance compares closely to that of our random sample sort algorithm, which seems to outperform all similar algorithms known to the authors on these platforms. Together, their performance is nearly invariant over the set of input distributions, unlike previous efficient algorithms. However, unlike our randomized sorting algorithm, the performance and memory requirements of our regular sorting algorithm can be deterministically guaranteed. en_US
dc.description.sponsorship This work was supported by NSF Grants No. CCR-9627210 and No. BIR-9318183. Supported by NSF CISE Postdoctoral Research Associate in Experimental Computer Science No. 96-25668 and NASA Graduate Student Researcher Fellowship No. NGT-50951. en_US
dc.format.extent 388325 bytes
dc.format.extent 1888 bytes
dc.format.extent 60820 bytes
dc.format.mimetype application/pdf
dc.format.mimetype text/plain
dc.format.mimetype text/plain
dc.language.iso en_US en_US
dc.relation.ispartofseries EECE-TR-98-008 en_US
dc.subject deterministic parallel sorting algorithm en_US
dc.subject distributed memory en_US
dc.subject regular sampling approach en_US
dc.subject regular all-to-all personalized communication en_US
dc.subject load balancing en_US
dc.subject input distributions en_US
dc.title A New Deterministic Parallel Sorting Algorithm With an Experimental Evaluation en_US
dc.type Technical Report en_US


Files in this item

Files Size Format View
EECE-TR-98-008.pdf 379.2Kb PDF View/Open

This item appears in the following Collection(s)

Show simple item record

UNM Libraries

Search LoboVault


Advanced Search

Browse

My Account