The bit summation problem on reconfigurable meshes is studied for the case where the number of bits is as large as the number of processors. It is shown that kn binary values can be computed on a reconfigurable mesh of size k*n in time O(log sup * k+(log n/k log k sup 1/2)).
展开▼
机译：对于位数与处理器数量一样大的情况，研究了可重构网格上的位数求和问题。结果表明，可以在时间为O（log sup * k +（log n / k log k sup 1/2））的大小为k * n的可重构网格上计算kn个二进制值。
展开▼
