@inproceedings{f28c71a38a4541f0b13920dbf18d5a1c,
title = "A comparison based parallel sorting algorithm",
abstract = "We present a fast comparison based parallel sorting algorithm that can handle arbitrary key types. Data movement is the major portion of sorting time for most algorithms in the literature. Our algorithm is parameterized so that is can be tuned to control data movement time, especially for large data sets. Parallel histograms are used to partition the key set exactly. The algorithm is architecture independent, and has been implemented in the CHARM portable parallel programming system, allowing it to be efficiently run on virtually any MIMD computer. Performance results for sorting different data sets are presented.",
author = "Kale, {Laxmikant V.} and Sanjeev Krishnan",
note = "Publisher Copyright: {\textcopyright} 1993 IEEE.; 1993 International Conference on Parallel Processing, ICPP 1993 ; Conference date: 16-08-1993 Through 20-08-1993",
year = "1993",
doi = "10.1109/ICPP.1993.17",
language = "English (US)",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "196--200",
booktitle = "Algorithms and Applications",
address = "United States",
}