摘要: Two novel algorithms for simultaneous computation of a large number partial sums are introduced, their performance assessed, and architectures implementation suggested. The direct D operations replaced by O(D/log D). new approach is based on concept optimal partitioning redundancy removal in arithmetic intensive, high throughput computing that expected to be the basis class which represent a, departure from brute force parallel where inherent not detected or removed.