Parallel Sort Algorithms
Parallel Sort Algorithms is a computational method that belongs to the class of sorting algorithms and is distinguished by its ability to exploit concurrent processing across multiple processors or nodes to efficiently sort large datasets in parallel database systems.
352
Publications
19.5K
Citations
671
Authors
273
Institutions
Publications per year
2017–2026
26
Parents
352
C. A. R. Hoare · The Computer Journal · 1962 · 755 citations · Full text
Richard Cole · SIAM Journal on Computing · 1988 · 734 citations
Sorting inc logn parallel steps
Miklós Ajtai, János Komlós, Endre Szemerédi · COMBINATORICA · 1983 · 513 citations
Scan Primitives for GPU Computing
eScholarship (California Digital Library) · 2007 · 513 citations · Full text
1–5 of 352
671
10
h-index
8
h-index
6
h-index
6
h-index
5
h-index
1–5 of 671
273
University of California, Berkeley
Berkeley, United States
9 h-index
29 publications
2.1K citations
Duke University
Durham, United States
8 h-index
14 publications
760 citations
Princeton University
Princeton, United States
8 h-index
13 publications
758 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
13 publications
1.7K citations
University of Maryland, College Park
College Park, United States
7 h-index
15 publications
760 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
7 h-index
15 publications
784 citations
University of Illinois Urbana-Champaign
Urbana, United States
7 h-index
11 publications
671 citations
Queen's University
Kingston, Canada
5 h-index
8 publications
218 citations
1–8 of 273
24 publications · 1.9K citations
20
h-index
TPDS · 13 publications · 394 citations
13
h-index
9 publications · 1.6K citations
9
h-index
7 publications · 172 citations
7
h-index
7 publications · 954 citations
7
h-index
1–5