Mapping Tridiagonal System Algorithms onto Mesh Connected Computers

Abstract

In this work we apply a methodology for the parallelization of algorithms for tridiagonal solvers. We classify tridiagonal solvers as a function of their data flows and present a unified version of the projection of these algorithms onto computers with mesh topology and distributed memory. Finally, we evaluate the algorithms and compare them through specific tests on the Fujitsu AP1000.