Abstract

This paper presents a method of performing LU-Decomposition on a hypercube. The algorithm is constructed similar to the way a pipeline would be used in hardware or on a systolic array processor. Using this method eliminates the need to broadcast data to all the processors at each iteration of the algorithm. Communication takes place at each iteration but since we are using a pipeline model, the communication is between each processor and the next processor in the pipeline. On the hypercube this communication can be done in parallel by using the Gray code ordering to embed a ld mesh (pipeline) onto a hypercube.

Department(s)

Computer Science

Comments

The first Author is a Graduate Student.

Report Number

CSc-94-03

Document Type

Technical Report

Document Version

Final Version

File Type

text

Language(s)

English

Rights

© 1994 University of Missouri - Rolla, All rights reserved

Publication Date

24 January, 1994

Share

 
COinS