Scaling multiple addition and prefix sums on the reconfigurable mesh
Document Type
Article
Publication Date
6-30-2002
Abstract
Multiple addition is the problem of adding N b-bit integers. Prefix sums and multiple addition play fundamental roles in many algorithms, particularly on the reconfigurable mesh (R-Mesh). Scaling algorithms on the R-Mesh to run with the same or increased efficiency on fewer processors is a challenging and important proposition. In this paper, we present algorithms that scale with increasing efficiency for multiple addition, prefix sums, and matrix-vector multiplication. Along the way, we obtain an improved multiple addition algorithm. © 2001 Elsevier Science B.V. All rights reserved.
Publication Source (Journal or Book title)
Information Processing Letters
First Page
277
Last Page
282
Recommended Citation
Trahan, J., & Vaidyanathan, R. (2002). Scaling multiple addition and prefix sums on the reconfigurable mesh. Information Processing Letters, 82 (6), 277-282. https://doi.org/10.1016/S0020-0190(01)00299-X
