.png){kind=icon}
返回
An efficient sorting algorithm on the multi-mesh network
.png){kind=icon}
PRE
AI
DOI：10.1109/12.628397.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
2D mesh
multidimensional mesh
wrap-around connection
SIMD
MIMD
sorting
shear-sort
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Vicenin-2 and scolymoside inhibit high-glucose-induced vascular inflammation in vitro and in vivo
PREAI
分享收藏
查看更多内容