Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/48187
Title: Sparse LU factorization with partial pivoting overlapping communications and computations on the SP-2 multicomputer
Authors: Ojeda-Guerra, C. N. 
Macías, E. 
Suarez, A 
UNESCO Clasification: 3325 Tecnología de las telecomunicaciones
Keywords: sparse linear system
distributed memory
multicomputer
MPI
algorithm
Issue Date: 1998
Journal: Lecture Notes in Computer Science 
Conference: 5th European PVM/MPI Users Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface 
Abstract: 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
Source: 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
Appears in Collections:Artículos
Show full item record

Page view(s)

15
checked on Jul 17, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.