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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Information and computation Ročník 161; číslo 2; s. 172 - 210
Hlavní autor:	Santos, Eunice E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	San Diego, CA Elsevier Inc 2000 Elsevier
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!