Parallel sorting is a process which given n keys distributed
over p processors, migrates the keys so that all keys on
processor k are sorted locally and are smaller than or equal
to all keys on processor k+1.
Research Areas
Text Ref
Laxmikant Kale and Edgar Solomonik, Parallel Sorting, Encyclopedia of Parallel Computing, David Padua, Ed., 2011 (to appear)
BibTex
@incollection{SortingEncyEntry10,
author = "Laxmikant Kale and Edgar Solomonik",
title = "{Parallel Sorting}",
booktitle = "Encyclopedia of Parallel Computing",
publisher = "Springer Verlag",
year = "2011",
editor = "D. Padua",
}