Bitonic sort on a chained-cubic tree interconnection network
Journal of Parallel and Distributed Computing
| Hi-index | 0.03 |
In this paper, we propose an algorithm for parallel sorting on Recursive Dual-Net with an $\bm{m}$-cube ($\bm{Q_m}$) as its base network. The Recursive Dual-Net $\bm{RDN^k(Q_m)}$ for $\bm{k0}$ has $\bm{2^{2^km+2^k-1}}$ nodes and $\bm{m+k}$ links per node. The proposed sorting algorithm is based on the bitonic sorting. In an $\bm{RDN^k(Q_m)}$, assume that each node holds a single data item, the sorting algorithm runs in $\bm{O((m2^k)^2)}$ computation steps and $\bm{O((km2^k)^2)}$ communication steps.