PREFIX-SUMS ALGORITHMS ON RECONFIGURABLE MESHES
Koji Nakano · Parallel Processing Letters · 1995
This paper shows that the prefix-sums of n binary values can be computed in [Formula: see text] time on an n × m reconfigurable mesh of the word model. It also shows that prefix-sums of n binary values can be computed in [Formula: see text] time on an n × m reconfigurable mesh of the word model if the reconfigurable mesh has communication capability that allows simultaneous sending to the same bus.