【摘要】 在介绍带有宽总线网络的可重构计算模型(RAPWBN)的基本结构及其二进制值的前缀和操作的基础上,提出该模型上的一种并行归并排序算法,在具有Nα(1<α<2)个处理器和N条行总线的RAPWBN模型上,若总线带宽ω>logN字节,对长度为N的序列进行归并排序,可以在O((loglogN)2)时间完成.更多还原

【Abstract】 After introducing the basic structure and the binary prefix sum operation of the reconfigurable computational model with wide bus network(RAPWBN),an algorithm for parallel merge sorting on RAPWBN model is presented.The algorithm can sort N elements in O((loglogN)2)time on a RAPWBN with Nα(1<α<2) processors and N-row bus with bandwidth ω>logN,the algorithm runs in O((loglogN)2)time.更多还原