摘要： 在介绍带有宽总线网络的可重构计算模型(RAPWBN)的基本结构及其二进制值的前缀和操作的基础上,提出了 RAPWBN 模型上的抽取压缩操作算法,并由此得到了 RAPWBN 模型上的两种快速高效并行排序算法,对长度为 N 的序列进行排序,在具有 N2个处理器和N 条行总线的 RAPWBN 模型上,若总线带宽ω>logN 字节,可以在 O(1)时间完成排序。在具有 N 个处理器和 N 条行总线的 RAPWBN 模型上,最好情况下以 O(logN)时间、最坏情况下以 O(N)时间完成排序。

关键词: RAPWBN模型, 排序, 并行算法

Abstract: After introducing the basic structure and the binary prefix sum operation of the reconfigurable computational model with wide bus network (RAPWBN), algorithm for the operation of compressing and hence two fast and efficient parallel sorting algorithm on RAPWBN model are presented. One of the algorithm of sorting runs in O(1) time on a RAPWBN model of N2 processors and N-row bus with bandwidth ω>logN. The other algorithm, using N processors and N-row bus, can sort N elements in O(logN) time at best, in O(N) time at the very worst.

中图分类号: 

• TP301.6