.png){kind=icon}
Return
An efficient sorting algorithm on the multi-mesh network
.png){kind=icon}
PRE
AI
DOI：10.1109/12.628397.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The shear-sort algorithm [19] on an SIMD mesh model requires 4 root N + o(root N) time for sorting N elements arranged on a root N x root N mesh. In this paper, we present an algorithm for sorting N elements in time O(N-1/4) On an SIMD Multi-Mesh architecture, thereby significantly improving the order of the time complexity. The Multi-Mesh architecture [23], [24] is built around n(2) blocks, where each block is an n x n mesh with n = N-1/4, SO that each processor will uniformly have four neighbors in the final topology.
Keywords:
2D mesh
multidimensional mesh
wrap-around connection
SIMD
MIMD
sorting
shear-sort
Journal
IF:
3.8
Papers:
5.4K
Citations:
9.8K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveVicenin-2 and scolymoside inhibit high-glucose-induced vascular inflammation in vitro and in vivo
PREAI
ShareSave
View more