Title
Document Type
Report
Date
12-1990
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.
Recommended Citation
Hansen, Per Brinch, "THE ALL-PAIRS PIPELINE" (1990). Electrical Engineering and Computer Science - Technical Reports. 77.
https://surface.syr.edu/eecs_techreports/77
Source
local
Additional Information
School of Computer and Information Science, Syracuse University, SU-CIS-90-40