An Implementation of a General-Purpose Parallel Sorting Algorithm (1993) [19 citations — 5 self]
Download:
by Andrew Tridgell, Richard P. Brent Y
http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/../pd/rpb140tr.pdf
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Tridgell93animplementation,author = {Andrew Tridgell and Richard P. Brent Y},
title = {An Implementation of a General-Purpose Parallel Sorting Algorithm},
institution = {},
year = {1993}
}
Years of Citing Articles
Abstract:
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, them 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. Keywords: Batcher's merge-exchange sort, distributed memory, Fujitsu AP1000, parallel sorting,
