AVISPA: visualizing the performance prediction of parallel iterative solvers

  • Authors:
  • V. Blanco;P. González;J. C. Cabaleiro;D. B. Heras;T. F. Pena;J. J. Pombo;F. F. Rivera

  • Affiliations:
  • Department of Statistics and Computer Science, University of La Laguna, 38071 Tenerife, Spain;Department of Electronic and Systems, University of A Coruña, 15071 A Coruña, Spain;Department of Electronics and Computer Science, University of Santiago de Compostela, 15782 Santiago, Spain;Department of Electronics and Computer Science, University of Santiago de Compostela, 15782 Santiago, Spain;Department of Electronics and Computer Science, University of Santiago de Compostela, 15782 Santiago, Spain;Department of Electronics and Computer Science, University of Santiago de Compostela, 15782 Santiago, Spain;Department of Electronics and Computer Science, University of Santiago de Compostela, 15782 Santiago, Spain

  • Venue:
  • Future Generation Computer Systems - Tools for program development and analysis
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

The selection of the best method and preconditioner for solving a sparse linear system is as determinant as the efficient parallelization of the selected method. We propose a tool for helping to solve both problems on distributed memory multiprocessors using iterative methods. Based on a previously developed library of HPF and message-passing interface (MPI) codes, a performance prediction is developed and a visualization tool (AVISP A) is proposed. The tool combines theoretical features of the methods and preconditioners with practical considerations and predictions about aspects of the execution performance (computational cost, communications overhead, etc.). It offers detailed information about all the topics that can be useful for selecting the most suitable method and preconditioner. Another capability is to offer information on different parallel implementations of the code (HPF and MPI) varying the number of available processors.