Identificador persistente para citar o vincular este elemento: http://hdl.handle.net/10553/48187
Título: Sparse LU factorization with partial pivoting overlapping communications and computations on the SP-2 multicomputer
Autores/as: Ojeda-Guerra, C. N. 
Macías, E. 
Suarez, A 
Clasificación UNESCO: 3325 Tecnología de las telecomunicaciones
Palabras clave: sparse linear system
distributed memory
multicomputer
MPI
algorithm
Fecha de publicación: 1998
Publicación seriada: Lecture Notes in Computer Science 
Conferencia: 5th European PVM/MPI Users Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface 
Resumen: The problem of solving a sparse linear system of equation (A x x = b) is very important in scientific applications and is still an open problem to develop on multicomputer with distributed memory. This paper presents an algorithm for parallelizing the sparse LU on a SP-2 multicomputer using MPI and standard sparse matrices. Our goal is to implement the parallel algorithm studying the dependence graph of the sequential algorithm which drives us to overlap computations and communications. So, this analysis can be performed by an automatic tool that helps us to choose the best data distribution. The paper analyses the effect of several block sizes in the performance results in order to overlap efficiently.
URI: http://hdl.handle.net/10553/48187
ISBN: 3-540-65041-5
ISSN: 0302-9743
DOI: 10.1007/BFb0056597
Fuente: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)[ISSN 0302-9743],v. 1497, p. 371-378
Colección:Artículos
Vista completa

Visitas

69
actualizado el 06-jul-2024

Google ScholarTM

Verifica

Altmetric


Comparte



Exporta metadatos



Los elementos en ULPGC accedaCRIS están protegidos por derechos de autor con todos los derechos reservados, a menos que se indique lo contrario.