A PVM Based Library for Sparse Matrix Factorizations
Use este enlace para citar
http://hdl.handle.net/2183/22371Colecciones
- Investigación (FIC) [1679]
Metadatos
Mostrar el registro completo del ítemTítulo
A PVM Based Library for Sparse Matrix FactorizationsFecha
1998Cita bibliográfica
Touriño J., Doallo R. (1998) A PVM-based library for sparse matrix factorizations. In: Alexandrov V., Dongarra J. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 1998. Lecture Notes in Computer Science, vol 1497. Springer, Berlin, Heidelberg
Resumen
[Abstract] We present 3LM, a C Linked List Management Library for parallel sparse factorizations on a PVM environment which takes into account the fill-in, an important drawback of sparse computations. It is restricted to a mesh topology and is based on an SPMD paradigm. Our goal is to facilitate the programming in such environments by means of a set of list and vector-oriented operations. The result is a pseudo-sequential code, in which the interprocessor communications and the sparse data structures are hidden from the programmer.
Palabras clave
3LM
Parallel sparse factorizations
Parallel sparse factorizations
Descripción
This is a post-peer-review, pre-copyedit version of an article published in Lecture Notes in Computer Science. The final authenticated version is available online at: https://doi.org/10.1007/BFb0056589
Versión del editor
ISSN
0302-9743
1611-3349
1611-3349
ISBN
978-3-540-65041-6 978-3-540-49705-9
