A New Message Passing Algorithm for Solving Linear Recurrence Systems

  • Authors:
  • Przemyslaw Stpiczynski

  • Affiliations:
  • -

  • Venue:
  • PPAM '01 Proceedings of the th International Conference on Parallel Processing and Applied Mathematics-Revised Papers
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we present a new efficient algorithm for solving linear recurrence systems with constant coefficients on distributed memory machines and clusters of workstations. The algorithm is based on level 3 and level 1 BLAS (Basic Linear Algebra Subprograms) routines _GEMM and _AXPY. We also discuss its platform-independent implementation with BLACS (Basic Linear Algebra Communication Subprograms) and finally present the results of experiments performed on a cluster of Pentium II computers running under Linux with operating system with MPI (Message-Passing Interface) and compare the results with the performance of a simple divide-and-conquer algorithm proposed in our earlier work.