.png){kind=icon}
返回
Bitonic sort on a chained-cubic tree interconnection network
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2013.09.008.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Bitonic sort is one of the fastest oblivious parallel sorting algorithms known so far. Due to its high modularity, bitonic sort can be mapped to different interconnection networks. In this paper, the bitonic sort algorithm is mapped to the chained-cubic tree (CCT) interconnection network. It is shown that the computation time of the bitonic sort on a CCT (BSCCT) algorithm is O((n/p) x log(np)) and that the communication cost is O(p log(2) p), assuming that n keys are evenly distributed among p processors that comprise a given CCT network. Simulation is implemented and used to assess the performance of the BSCCT algorithm in terms of computation time, communication cost, message delay, and key comparisons. Simulation results showed that the BSCCT algorithm achieves a speedup that is almost 12-fold relative to a bitonic sort on a single processor, when 1024 processors were used to sort 32M keys. (C) 2013 Elsevier Inc. All rights reserved.
Keyword:
Sorting and searching
Bitonic sort
Parallel algorithms
Performance evaluation
Interconnection networks
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
引用论文
.png){kind=icon}
PROPHYLACTIC OR POST-TRAUMATIC TREATMENT OF HYPOFIBRINOGENEMIA AND DYSFIBRINOGENEMIA WITH FIBRGYA IN EIGHT CLINICAL CASES使用Fibryga对8例临床病例进行预防性或创伤后低纤维蛋白原血症和异常纤维蛋白原血症的治疗
PREAI
分享收藏分享收藏分享收藏An optimal and processor efficient parallel sorting algorithm on a linear array with a reconfigurable pipelined bus system具有可重构流水线总线系统的线性阵列上的最优和处理器高效并行排序算法
PREAI
分享收藏
查看更多内容