Optimal Partitioning and Redundancy Removal in Computing Partial Sums.

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

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Mar 01, 1987
Accession Number
ADA179474

Entities

People

  • Adly T. Fam

Organizations

  • University at Buffalo

Tags

Communities of Interest

  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Algorithms
  • Beam Forming
  • Classification
  • Coding
  • Computations
  • Computer Science
  • Computers
  • Contracts
  • Decoding
  • Education
  • Electrical Engineering
  • Engineering
  • New York
  • Notation
  • Parallel Computing
  • Security
  • Signal Processing

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Parallel and Distributed Computing.