Skip navigation
Skip navigation

Efficient implementation of sorting algorithms on asynchronous distributed-memory machines

Zhou, B.B; Brent, Richard P; Tridgell, A


The 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.

CollectionsANU Research Publications
Date published: 1993
Type: Working/Technical Paper


File Description SizeFormat Image
1641-01.2003-07-09T06:15:50Z.xsh356 BEPrints MD5 Hash XML
TR-CS-93-06.pdf145.87 kBAdobe PDFThumbnail

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator