Abstract
We present a more efficient CREW PRAM algorithm for integer sorting. This algorithm sorts n integers in { 0, 1, 2, ..., n 1/2} in O((logn) 3/2/loglogn) time and O(n (logn/loglogn) 1/2) operations. It also sorts n integers in {0, 1, 2,..., n-1} in O((logn) 3/2/ loglogn) time and O(n (logn/loglogn) 1/2logloglogn) operations. Previous best algorithm [13] on both cases has time complexity O(logn) but operation complexity O(n(logn) 1/2). © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Han, Y., & He, X. (2012). More efficient parallel integer sorting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7285 LNCS, pp. 279–290). https://doi.org/10.1007/978-3-642-29700-7_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
