Accession Number:

ADA179474

Title:

Optimal Partitioning and Redundancy Removal in Computing Partial Sums.

Descriptive Note:

Final technical rept. Dec 85-Jan 87,

Corporate Author:

STATE UNIV OF NEW YORK AT BUFFALO AMHERST

Personal Author(s):

Report Date:

1987-03-01

Pagination or Media Count:

29.0

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

Subject Categories:

  • Computer Hardware

Distribution Statement:

APPROVED FOR PUBLIC RELEASE