Abstract   This paper presents the following algorithms to compute the sum of  n  d -bit integers on reconfigurable parallel computation models:   1.   (1) a constant-time algorithm on a reconfigurable mesh of the bit model of size √ n   log  ( O ( l ))   n  ×  d √ n    2.   (2) an   O(log     ∗    n)-  time   algorithm on a reconfigurable mesh of the bit model of size   √n/log     ∗    n × d √n/log     ∗    n     3.   (3) 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)     4.   (4) an   O(log     ∗    n)-  time   algorithm on a VLSI reconfigurable circuit of area   O(dn/log     ∗    n)  .
['Koji Nakano', 'Roichi Wada']
Integer summing algorithms on reconfigurable meshes