Document Type

Report

Date

12-1990

Embargo Period

5-1-2012

Keywords

All-pairs paradigm, Householder reduction, Precedence matrices, Pipelined computers

Language

English

Disciplines

Computer Sciences

Description/Abstract

An all-pairs problem is a computation on every possible subset consisting of two elements chosen from a set of n elements. N-body simulation and Householder reduction are all-pairs problems. The paper defines the all-pairs problem concisely by means of precedence matrices and derives a parallel algorithm. The algorithm is presented in both coarse-grain and medium-grain form. The all-pairs paradigm is illustrated by a pipeline for Householder reduction of a matrix to triangular form.

Additional Information

School of Computer and Information Science, Syracuse University, SU-CIS-90-40

Source

local

Share

COinS
 
 

To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.