2010年12月
Parallel Sorting on Recursive Dual-Nets
Proceedings of the 11th International Conference on Computer and Information Technology
- ,
- ,
- 開始ページ
- 110
- 終了ページ
- 117
- 記述言語
- 英語
- 掲載種別
- 会議報告等
- DOI
- 10.1109/PDCAT.2010.56
In this paper, we propose an algorithm for parallel sorting on Recursive Dual-Net with an m-cube (Qm) as its base network. The Recursive Dual-Net RDNκ(Qm) for k >
0 has 2 2κm+2κ-1 nodes and m+ κ links per node. The proposed sorting algorithm is based on the bitonic sorting. In an RDN κ(Qm), assume that each node holds a single data item, the sorting algorithm runs in O((m2κ)2) computation steps and O((km2κ)2) communication steps. © 2010 IEEE.
0 has 2 2κm+2κ-1 nodes and m+ κ links per node. The proposed sorting algorithm is based on the bitonic sorting. In an RDN κ(Qm), assume that each node holds a single data item, the sorting algorithm runs in O((m2κ)2) computation steps and O((km2κ)2) communication steps. © 2010 IEEE.
- ID情報
-
- DOI : 10.1109/PDCAT.2010.56
- SCOPUS ID : 79951805685