Sorting On Shared-memory Multiprocessors
Sorting On Shared-Memory Multiprocessors is a parallel sorting paradigm that organizes the arrangement of data elements through concurrent processes executing on multiple processors sharing a common memory space, distinguished by its reliance on fine-grained synchronization and load balancing to exploit memory coherence and reduce communication overhead in comparison to distributed-memory approaches.
28
Publications
1.9K
Citations
55
Authors
31
Institutions
Publications per year
2017–2026
0
Parents
28
A Survey of Parallel Algorithms for Shared-Memory Machines
Richard M. Karp · UC Berkeley · 1988 · 322 citations
Searching, Merging, and Sorting in Parallel Computation
Kruskal · IEEE Transactions on Computers · 1983 · 166 citations
Chris Nyberg, Zarka Cvetanovic, Jim Gray et al. · 1994 · 130 citations
1–5 of 28
55
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 55
31
IBM Research - Almaden
San Jose, United States
2 h-index
2 publications
160 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
3 publications
305 citations
IBM Research - Tokyo
Tokyo, Japan
2 h-index
8 publications
648 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
2 publications
190 citations

Mathematical Sciences Research Institute
Berkeley, United States
2 h-index
2 publications
48 citations
University of Illinois Urbana-Champaign
Urbana, United States
2 h-index
1 publications
166 citations
Digital Wave (United States)
Centennial, United States
2 h-index
10 publications
725 citations
Goethe University Frankfurt
Frankfurt am Main, Germany
2 h-index
2 publications
48 citations
1–8 of 31
2 publications · 212 citations
2
h-index
2 publications · 149 citations
2
h-index
1 publications · 19 citations
1
h-index
1 publications · 15 citations
1
h-index
Repository · 1 publications · 322 citations
1
h-index
1–5