On designing optimal parallel triangular solvers

This paper explores the problem of solving triangular linear systems on parallel distributed-memory machines. Working within the LogP model, tight asymptotic bounds for solving these systems using forward/backward substitution are presented. Specifically, lower bounds on execution time independent o...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Information and computation Jg. 161; H. 2; S. 172 - 210
1. Verfasser:	Santos, Eunice E.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	San Diego, CA Elsevier Inc 2000 Elsevier
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Computer science; control theory; systems distributed-memory Exact sciences and technology LogP model Mathematics matrix computation Nonlinear algebraic and transcendental equations Numerical analysis Numerical analysis. Scientific computation Numerical linear algebra numerical methods parallel algorithmsand complexity Sciences and techniques of general use Theoretical computing triangular solvers matrix computation distributed-memory LogP model numerical methods triangular solvers parallel algorithmsand complexity Triangular matrix Parallel algorithm Triangular linear system Numerical method Forward substitution scheme Complexity Latency Equation system Distributed memory Distributed memory multiprocessor system Linear system Computer program Matrix calculus Backward substitution scheme Time complexity Message transmission
ISSN:	0890-5401, 1090-2651
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!