Integer summing algorithms on reconfigurable meshes

This paper presents the following algorithms to compute the sum of n d-bit integers on reconfigurable parallel machine models: i) a constant-time algorithm on a reconfigurable mesh of the bit model of size d√n log^(O(1)) n×√n, ii) an O(log* n)-time algorithm on a reconfigurable mesh of the bit model of size d√(n/log* n)×√(n/log* n), iii) an O(log d+log* n)-time algorithm on a reconfigurable mesh of the word model of size √(n/(log d+log* n))×√(n/(log d+log* n)), and iv) an O(log* n)-time algorithm on a VLSI reconfigurable circuit of area O(dn/log* n)