Solving System of Linear Equations in a Network of Workstations

In this article we propose an evaluation of the three common algorithms for solving linear system of equations: Gauss Elimination, Gauss-Jordan without pivoting and Jacobi with dominant rows. The parallel design of the chosen algorithms is a compromise between the easies and elegant way to implement in MPI and the performance. The result confirmed that for a small number of low cost computers the speedup is acceptable for the Gauss Elimination and Gauss-Jordan but for Jacobi with dominant rows if data is not already distributed it is better to implement the serial version.