Show simple item record

dc.contributor.authorHelman, D.R.en_US
dc.contributor.authorBader, D.A.en_US
dc.contributor.authorJáJá, J.en_US
dc.date.accessioned2006-03-10T07:23:44Z
dc.date.available2006-03-10T07:23:44Z
dc.date.issued1998-11
dc.identifier.urihttp://hdl.handle.net/1928/69
dc.descriptionTechnical Reporten_US
dc.description.abstractWe 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.sponsorshipThis 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.extent388325 bytes
dc.format.extent1888 bytes
dc.format.extent60820 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.language.isoen_USen_US
dc.relation.ispartofseriesEECE-TR-98-008en_US
dc.subjectdeterministic parallel sorting algorithmen_US
dc.subjectdistributed memoryen_US
dc.subjectregular sampling approachen_US
dc.subjectregular all-to-all personalized communicationen_US
dc.subjectload balancingen_US
dc.subjectinput distributionsen_US
dc.titleA New Deterministic Parallel Sorting Algorithm With an Experimental Evaluationen_US
dc.typeTechnical Reporten_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record