Mesh Sorting is a parallel sorting algorithm that organizes processing elements in a two-dimensional mesh topology and executes comparison-exchange operations along neighboring nodes to achieve global ordering through localized data movement.
39
Publications
1.4K
Citations
73
Authors
42
Institutions
Publications per year
2017–2026
0
Variants
Mesh Sort
Parents
Publications
39
An optimal sorting algorithm for mesh connected computers
C. P. Schnorr, Adi Shamir · 1986 · 199 citations · Full text
An optimal sorting algorithm on reconfigurable mesh
Ji-Woong Jang, Viktor K. Prasanna · 2003 · 86 citations
1–5 of 39
Authors
73
- SO
5
h-index
- SS
4
h-index
- DK
3
h-index
- CK
3
h-index
- MN
3
h-index
1–5 of 73
Institutions
42
University of Florida
Gainesville, United States
6 h-index
10 publications
420 citations
Old Dominion University
Norfolk, United States
5 h-index
16 publications
239 citations
Princeton University
Princeton, United States
3 h-index
3 publications
120 citations
University of Minnesota
Minneapolis, United States
2 h-index
1 publications
27 citations
University of Southern California
Los Angeles, United States
2 h-index
3 publications
192 citations
Elizabeth City State University
Elizabeth City, United States
2 h-index
2 publications
24 citations
University of Rochester
Rochester, United States
2 h-index
4 publications
140 citations
Harvard University
Cambridge, United States
2 h-index
3 publications
105 citations
1–8 of 42
Venues
- IEEE Transactions on Computers
5 publications · 156 citations
5
h-index
- Journal of Parallel and Distributed Computing
5 publications · 157 citations
5
h-index
- Algorithmica
2 publications · 70 citations
2
h-index
- Computer Graphics Forum
1 publications · 65 citations
1
h-index
- Parallel Computing
1 publications · 26 citations
1
h-index
1–5