BSP linear solvers for dense matrices

摘要

This paper presents a study of four parallel linear system solvers, implemented using the Bulk Synchronous Parallel programming model. We show that better performances are achieved by the Implicit methods due both to higher exploitation of hardware capabilities and to the lower Communication costs. A BSP performance model for all the algorithms has been built and the Predictions obtained have been compared with the results of measurements on two different Parallel systems: a cluster of workstations and a shared memory multiproccesor machine.