Optimal Partitioning and Redundancy Removal in Computing Partial Sums.
Final technical rept. Dec 85-Jan 87,
STATE UNIV OF NEW YORK AT BUFFALO AMHERST
Pagination or Media Count:
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 OD 1og 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. Keywords Partial Sums Optimal Partitioning Redundancy Removal Concurrent Computing.
- Computer Hardware