An Implementation Of A General-Purpose Parallel Sorting Algorithm
Andrew Tridgell, Richard P. Brent · ANU Open Research (Australian National University) · 1993
: 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. Table of Contents 1 THE PARALLEL SORTING TASK 1 1.1 Introduction 1 1.2 Nomenclature 1 1.3 Aims of the Algorithm 1 1.4 Hardware 2 2 OVERVIEW OF THE ALGORITHM 3 2.1 Pre-Balancing 3 2.2 Serial Sorting 3 2.3 Primary Merging 4 2.4 Cleanup 4 2.5 Merge-Exchange 4 3 IMPLEMENTATION DETAILS 5 3.1 Infinity Padding 5 3.2 Balancing 6 3.3 Serial Sorting 7 3.4 Primary Merge 8 3.5 Merge-Exchange Operation 9 3.5.1 Find-Exact Algorithm 10 3.5.2 Transferring Elements 11 3.5.3 Unbalanced Merging 11 3.5.4 Blockwise Merging 12 3...