Constrained reconfigurable meshes are one type of parallel computing model which takes the reconfigurability of hardware into account. With these meshes, a practical assumption is given on the communication power such that a signal is propagated through a constant number of processing elements (PEs), say k PEs, at one unit of time. In this paper, we present algorithms for the fundamental problem of computing the sum of multiple integers. For the problem of summing n binary values, we show an optimal O(n/k)-time algorithm on a constrained reconfigurable mesh of size m × n, where m = Θ (log 2 k/log log k). For the problem of summing n d-bit integers, we present an O((d + √dmm)/k)-time algorithm on a constrained reconfigurable mesh of size √ dmn × √ dmn.
|Number of pages||6|
|Journal||Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN|
|Publication status||Published - Dec 1 1999|
|Event||Proceedings of the 1999 4th International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) - Perth/Fremantle, Aust|
Duration: Jun 23 1999 → Jun 25 1999
ASJC Scopus subject areas
- Computer Science(all)