Show simple item record

Empirical Studies in Parallel Sorting

dc.contributor.authorGolub, Evanen_US
dc.date.accessioned2004-05-31T21:08:31Z
dc.date.available2004-05-31T21:08:31Z
dc.date.created1998-05en_US
dc.date.issued1999-08-25en_US
dc.identifier.urihttp://hdl.handle.net/1903/507
dc.description.abstractI examine different parallel algorithms for sorting in rounds. Most of these algorithms use a graph to indicate the comparisons to be made. The primary difference between the algorithms is how these graphs are chosen. One uses graphs that are shown to exist using non-constructive techniques, several yield constructions of the required graphs, and one uses a randomized algorithm. The constructive algorithms would traditionally be preferred even though the processor requirements are higher. It is shown that the non- constructive algorithms can actually be used by generating the needed graphs using random number generators skewed appropriately.en_US
dc.format.extent2443308 bytes
dc.format.mimetypeapplication/postscript
dc.language.isoen_US
dc.relation.ispartofseriesUM Computer Science Department; CS-TR-4038en_US
dc.titleEmpirical Studies in Parallel Sortingen_US
dc.typeTechnical Reporten_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.isAvailableAtComputer Science Department Technical Reportsen_US


Files in this item

Thumbnail
Thumbnail

This item appears in the following Collection(s)

Show simple item record