Hypercube Sorting is a parallel sorting algorithm that organizes processing elements in a hypercube network topology, where each node performs comparisons and exchanges with its neighbors along the dimensions of the hypercube to achieve efficient, distributed sorting of data.
26
Publications
1.4K
Citations
48
Authors
27
Institutions
Publications per year
2017–2026
1
Parents
Publications
26
Chris Nyberg, Zarka Cvetanovic, Jim Gray et al. · 1994 · 130 citations
Load balancing, selection sorting on the hypercube
C. Gregory Plaxton · 1989 · 57 citations · Full text
A (fairly) simple circuit that (usually) sorts
T. Leighton, C. Gregory Plaxton · 2002 · 47 citations
1–5 of 26
Authors
48
- CG
4
h-index
- RC
3
h-index
- CG
3
h-index
- ZC
2
h-index
- DL
2
h-index
1–5 of 48
Institutions
27
IBM Research - Almaden
San Jose, United States
3 h-index
5 publications
211 citations
Stanford University
Stanford, United States
2 h-index
3 publications
97 citations
Digital Wave (United States)
Centennial, United States
2 h-index
10 publications
725 citations
University of North Texas
Denton, United States
2 h-index
2 publications
637 citations
The University of Texas at Austin
Austin, United States
2 h-index
2 publications
35 citations
Massachusetts Institute of Technology
Cambridge, United States
2 h-index
3 publications
231 citations
University of Maryland, College Park
College Park, United States
1 h-index
2 publications
40 citations
Chongqing University
Chongqing, China
1 h-index
4 publications
40 citations
1–8 of 27
Venues
- Journal of Parallel and Distributed Computing
3 publications · 60 citations
3
h-index
- IEEE Transactions on Parallel and Distributed Systems
TPDS · 3 publications · 77 citations
3
h-index
- Parallel Computing
2 publications · 30 citations
2
h-index
- Journal of Computer and System Sciences
1 publications · 23 citations
1
h-index
- IEEE Transactions on Computers
1 publications · 14 citations
1
h-index
1–5