Fast and scalable parallel matrix computations with reconfigurable pipelined optical buses

We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the powers, the inverse, the characteristic polynomial, the determinant, the rank a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel algorithms and applications Jg. 19; H. 4; S. 195 - 209
1. Verfasser: Li, Keqin
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Taylor & Francis GroupAbingdon, UK 01.12.2004
Schlagworte:
Cost optimality
Linear speedup
Matrix computation
Optical bus
Processor array
Scalability
Time complexity
ISSN:1063-7192
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present fast and highly scalable parallel computations for a number of important and fundamental matrix problems on linear arrays with reconfigurable pipelined optical bus systems. These problems include computing the powers, the inverse, the characteristic polynomial, the determinant, the rank and an LU- and a QR-factorization of a matrix; multiplying a chain of matrices; and solving linear systems of equations. These computations are based on efficient implementation of the fastest sequential matrix multiplication algorithm, and are highly scalable over a wide range of system size. Such fast and scalable parallel matrix computations were not seen before on distributed memory parallel computing systems.
ISSN:1063-7192
DOI:10.1080/10637190410001700604