### Abstract

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.

Original language | English |
---|---|

Pages (from-to) | 400-405 |

Number of pages | 6 |

Journal | Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN |

Publication status | Published - 1999 |

Externally published | Yes |

### Fingerprint

### ASJC Scopus subject areas

- Engineering(all)

### Cite this

**Summation algorithms on constrained reconfigurable meshes.** / Matsuura, Akihiro; Nagoya, Akira.

Research output: Contribution to journal › Article

}

TY - JOUR

T1 - Summation algorithms on constrained reconfigurable meshes

AU - Matsuura, Akihiro

AU - Nagoya, Akira

PY - 1999

Y1 - 1999

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033363537&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033363537&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033363537

SP - 400

EP - 405

JO - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

JF - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

SN - 1087-4089

ER -