Synchronization-free Sorting
Synchronization-Free Sorting is a parallel sorting algorithm that belongs to the class of distributed-memory sorting methods, distinguished by its explicit avoidance of inter-process synchronization barriers, thereby enabling asynchronous execution through the use of non-blocking communication and local progress guarantees.
4
Publications
139
Citations
11
Authors
5
Institutions
Publications per year
2017–2026
0
Parents
4
Merge Path - Parallel Merging Made Simple
Saher Odeh, Oded Green, Zahi Mwassi et al. · 2012 · 50 citations
1–4 of 4
11
2
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 11
5

University of Calgary
Calgary, Canada
1 h-index
2 publications
38 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
19 citations

Johns Hopkins University
Baltimore, United States
1 h-index
3 publications
180 citations
Technion – Israel Institute of Technology
Haifa, Israel
1 h-index
5 publications
250 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
50 citations
1–5 of 5
1 publications · 60 citations
1
h-index
Repository · 1 publications · 10 citations
1
h-index
1 publications · 19 citations
1
h-index
1–3