Load-balanced Sorting
Load-Balanced Sorting is a parallel sorting methodology that distributes data and computational work evenly across processing units to minimize idle time and maximize throughput, distinguished from other parallel sorting techniques by its explicit optimization of workload partitioning to achieve uniform processor utilization.
14
Publications
413
Citations
39
Authors
19
Institutions
Publications per year
2017–2026
2
Parents
14
Load balancing, selection sorting on the hypercube
C. Gregory Plaxton · 1989 · 57 citations · Full text
Load balanced parallel radix sort
Andrew Sohn, Yuetsu Kodama · 1998 · 47 citations · Full text
Hari Sundar, Dhairya Malhotra, George Biros · 2013 · 46 citations
1–5 of 14
39
1
h-index
1
h-index
National Institute of Advanced Industrial Science and Technology, Japan
1 publications · 47 citations
1
h-index
Pontifícia Universidade Católica do Rio de Janeiro, Brazil
1 publications · 36 citations
1
h-index
1
h-index
1–5 of 39
19
The University of Texas at Austin
Austin, United States
1 h-index
3 publications
138 citations
Johannes Gutenberg University Mainz
Mainz, Germany
1 h-index
2 publications
32 citations
Google (United States)
Mountain View, United States
1 h-index
1 publications
19 citations
New Jersey Institute of Technology
Newark, United States
1 h-index
1 publications
47 citations

University of Calgary
Calgary, Canada
1 h-index
2 publications
38 citations

University of Hong Kong
Pok Fu Lam, Hong Kong
1 h-index
1 publications
26 citations
Stanford University
Stanford, United States
1 h-index
1 publications
57 citations
Queen's University
Kingston, Canada
1 h-index
2 publications
20 citations
1–8 of 19
Conference · 1 publications · 37 citations
1
h-index
TPDS · 1 publications · 26 citations
1
h-index
IJAST · 1 publications · 17 citations
1
h-index
1 publications · 10 citations
1
h-index
1 publications · 17 citations
1
h-index
1–5