Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Efficient implementation of sorting algorithms on asynchronous distributed-memory machines

Simple item page
dc.contributor.authorZhou, B. B.en_US
dc.contributor.authorBrent, Richard P.en_US
dc.contributor.authorTridgell, A.en_US
dc.date.accessioned2003-07-10en_US
dc.date.accessioned2004-05-19T12:56:39Zen_US
dc.date.accessioned2011-01-05T08:43:47Z
dc.date.available2004-05-19T12:56:39Zen_US
dc.date.available2011-01-05T08:43:47Z
dc.date.created1993en_US
dc.date.issued1993en_US
dc.description.abstractThe problem of merging two sequences of elements which are stored separately in two processing elements (PEs) occurs in the implementation of many existing sorting algorithms. We describe efficient algorithms for the merging problem on asynchronous distributed-memory machines. The algorithms reduce the cost of the merge operation and of communication, as well as partly solving the problem of load balancing. Experimental results on a Fujitsu AP1000 are reported.en_US
dc.format.extent149367 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/40789en_US
dc.identifier.urihttp://digitalcollections.anu.edu.au/handle/1885/40789
dc.language.isoen_AUen_US
dc.subjectparallel sorting algorithmsen_US
dc.subjectasynchronous distributed-memory machinesen_US
dc.subjectalgorithms,en_US
dc.titleEfficient implementation of sorting algorithms on asynchronous distributed-memory machinesen_US
dc.typeWorking/Technical Paperen_US
local.citationTR-CS-93-06en_US
local.contributor.affiliationANUen_US
local.contributor.affiliationDepartment of Computer Science, FEITen_US
local.description.refereednoen_US
local.identifier.citationmonthmayen_US
local.identifier.citationyear1993en_US
local.identifier.eprintid1641en_US
local.rights.ispublishedyesen_US

Downloads

Original bundle

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

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS