The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (1987 vol.36)
pp: 1137-1143
A.T. Fam , Department of Electrical and Computer Engineering, University at Buffalo, State University of New York
ABSTRACT
Two novel algorithms for simultaneous computation of a large number of partial sums are introduced, their performance assessed, and architectures for their implementation suggested. The direct computation of D operations are replaced by O(D/log D). The new approach is based on a new concept of optimal partitioning and redundancy removal in arithmetic intensive, high throughput computing that is expected to be the basis of a new class of algorithms which represent a, departure from brute force parallel computation where inherent redundancy is not detected or removed.
INDEX TERMS
redundancy removal, Arithmetic intensive computation, concurrent computing, high throughput computation, optimal partitioning, partial sums
CITATION
A.T. Fam, "Optimal Partitioning and Redundancy Removal in Computing Partial Sums", IEEE Transactions on Computers, vol.36, no. 10, pp. 1137-1143, October 1987, doi:10.1109/TC.1987.1676854
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool