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 requ
ires additional storage of order the square root of the number of elem
ents in each node. Performance of the algorithm on the Fujitsu AP1000
MIMD supercomputer is discussed.