Skip navigation
Skip navigation

An implementation of a general-purpose parallel sorting algorithm

Tridgell, Andrew; Brent, Richard P


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

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


File Description SizeFormat Image
TR-CS-93-01.pdf376.68 kBAdobe PDFThumbnail

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

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator