Bit Summation on the Reconfigurable Mesh

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 ^* k + (\log n/\sqrt {k\log k} ))\).