We presents a new parallel sorting algorithm on the k-dimensional reconfigurable mesh which is a generalized version of the well-studied (two dimensional) reconfigurable mesh. We introduce a new mapping technique which combines the enlarged bandwidth of the multidimensional mesh and the feature of the reconfigurable mesh. Using our mapping technique, we show that N/sup k/ numbers can be sorted in O(4/sup k/) (constant time for small k) time on a k+1 dimensional reconfigurable mesh of size k+1 times N/spl times/N/spl times/.../spl times/N. In addition, it is shown that the number of 1's in a 0/1 array of k times size N/spl times/N/spl times/.../spl times/N can be computed in O(log* N+log k) time on reconfigurable k times mesh of size N/spl times/N/spl times/.../spl times/N.
展开▼
机译:我们在K维可重新配置网格上呈现了一种新的并行分选算法,其是所学习(二维)可重新配置网格的广义版本。我们介绍了一种新的映射技术,它结合了多维网格的放大带宽和可重新配置网格的特征。使用我们的映射技术,我们显示N / SUP k /数字可以在k + 1维可重新配置网格上以o(4 / sup k /)(恒定的小k)时间进行排序k + 1次n / SPL时间/ n / spl时间/ ..../ spl times / n。另外,显示在o(log * n + log)中计算0/1阵列的k倍尺寸为n / spl时间/ n / spl次/ n中的0/1阵列中的1的数量./ k)时间在可重新配置的K倍网上的时间尺寸为n / spl时间/ n / spl时间/ ...
展开▼