Performance Prediction for Parallel Iterative Solvers

Authors:
Vicente Blanco Pérez;Patricia Gonzalez;José Carlos Cabaleiro;Dora Blanco Heras;Tomás F. Pena;J. J. Pombo;Francisco F. Rivera
Affiliations:
-;-;-;-;-;-;-
Venue:
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Year:
2002

Citing 4
Cited 3

Data distributions for sparse matrix vector multiplication

Parallel Computing
Vienna-Fortran/HPF Extensions for Sparse and Irregular Problems and Their Compilation

IEEE Transactions on Parallel and Distributed Systems
Modeling and improving locality for the sparse-matrix-vector product on cache memories

Future Generation Computer Systems - I. High Performance Numerical Methods and Applications. II. Performance Data Mining: Automated Diagnosis, Adaption, and Optimization
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems

A Performance Visualization Tool for HPF and MPI Iterative Solvers

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
AVISPA: visualizing the performance prediction of parallel iterative solvers

Future Generation Computer Systems - Tools for program development and analysis
Performance Prediction for Parallel Iterative Solvers

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, an exhaustive parallel library of sparse iterative methods and preconditioners in HPF and MPI was developed, and a model for predicting the performance of these codes is presented. This model can be used both by users and by library developers to optimize the efficiency of the codes, as well as to simplify their use. The information offered by this model combines theoretical features of the methods and preconditioners in addition to certain practical considerations and predictions about aspects of the performance of their execution in distributed memory multiprocessors.