A PVM Based Library for Sparse Matrix
Factorizations

Touriño, Juan; Doallo, Ramón

Use this link to cite:

http://hdl.handle.net/2183/22371

A PVM Based Library for Sparse Matrix Factorizations

Files

J.Touriño_A_PVM-based_library_for_sparse_matrix_factorizations_1998.pdf (221.19 KB)

Identifiers

URI: http://hdl.handle.net/2183/22371

DOI: 10.1007/BFb0056589

Publication date

1998

Authors

Touriño, Juan

Doallo, Ramón

Bibliographic citation

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

Abstract

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

Description

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