Author(s)

L. Fernandez and J.M. Garcia

Abstract

In this paper, issues related to implementing an MPI version of the fast Givens rotations problem are investigated. We have chosen this algorithm because it has the feature of having no predictable communication pattern. Message Passing Interface (MPI) is an attempt to standardise the communication library for distributed memory computing systems. The message-passing paradigm is attractive because of its wide portability and scalability. It is easily compatible with both distributed-memory multicomputers and shared-memory multiprocessors, with NOWs and also combinations of these elements. Currently, there are several commercial and free, public-domain, implementations of MPI. We have chose

Keywords