System Maintenance Notice:
Single article purchases and IEEE account management are currently unavailable. We apologize for the inconvenience.
By Topic

Efficient implementation of sorting algorithms on asynchronous distributed-memory machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)
Zhou, B.B. ; Comput. Sci. Lab., Australian Nat. Univ., Canberra, ACT, Australia ; Brent, R.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

Published in:

Parallel and Distributed Systems, 1994. International Conference on

Date of Conference:

19-22 Dec 1994