An implementation of a general-purpose parallel sorting algorithm

Simple item page
dc.contributor.authorTridgell, Andrewen_US
dc.contributor.authorBrent, Richard Pen_US
dc.date.accessioned2003-07-10en_US
dc.date.accessioned2004-05-19T12:56:50Zen_US
dc.date.accessioned2011-01-05T08:43:43Z
dc.date.available2004-05-19T12:56:50Zen_US
dc.date.available2011-01-05T08:43:43Z
dc.date.created1993en_US
dc.date.issued1993en_US
dc.description.abstractA parallel sorting algorithm is presented for general purpose internal sorting on MIMD machines. The algorithm initially sorts the elements within each node using a serial sorting algorithm, then proceeds with a two phase parallel merge. The algorithm is comparison-based and requires additional storage of order the square root of the number of elements in each node. Performance of the algorithm is examined on two MIMD machines, the Fujitsu AP1000 and the Thinking Machines CM5.en_US
dc.format.extent385722 bytesen_US
dc.format.extent356 bytesen_US
dc.format.mimetypeapplication/pdfen_US
dc.format.mimetypeapplication/octet-streamen_US
dc.identifier.urihttp://hdl.handle.net/1885/40793en_US
dc.identifier.urihttp://digitalcollections.anu.edu.au/handle/1885/40793
dc.language.isoen_AUen_US
dc.subjectparallel sorting algorithmen_US
dc.subjectMIMD machinesen_US
dc.subjectthinking machinesen_US
dc.titleAn implementation of a general-purpose parallel sorting algorithmen_US
dc.typeWorking/Technical Paperen_US
local.citationTR-CS-93-01en_US
local.contributor.affiliationANUen_US
local.contributor.affiliationDepartment of Computer Science, FEITen_US
local.description.refereednoen_US
local.identifier.citationmonthfeben_US
local.identifier.citationyear1993en_US
local.identifier.eprintid1645en_US
local.rights.ispublishedyesen_US

Downloads

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR-CS-93-01.pdf
Size:
376.68 KB
Format:
Adobe Portable Document Format
Download

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS