Skip to main navigation Skip to search Skip to main content

Optimal partitioning and redundancy removal in computing partial sums

  • Adly T. Fam

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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. Direct computation of D operations are replaced by 0(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.

Original languageEnglish
Title of host publicationConference Record - 19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
EditorsDonald E. Kirk
PublisherIEEE Computer Society
Pages288-293
Number of pages6
ISBN (Electronic)0818607297
DOIs
StatePublished - 1985
Event19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985 - Pacific Grove, United States
Duration: Nov 6 1985 → Nov 8 1985

Publication series

NameConference Record - Asilomar Conference on Signals, Systems and Computers
ISSN (Print)1058-6393

Conference

Conference19th Asilomar Conference on Circuits, Systems and Computers, ACSSC 1985
Country/TerritoryUnited States
CityPacific Grove
Period11/6/85 → 11/8/85

Fingerprint

Dive into the research topics of 'Optimal partitioning and redundancy removal in computing partial sums'. Together they form a unique fingerprint.

Cite this