Efficient implementation of sorting algorithms on asynchronous distributed-memory machines
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.
|Collections||ANU Research Publications|
|1641-01.2003-07-09T06:15:50Z.xsh||356 B||EPrints MD5 Hash XML|
|TR-CS-93-06.pdf||145.87 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.