Abstract: In this study, we present parallel implementations of the Gauss-Jordan and Gauss-Huard algorithms with scaled partial pivoting strategy on a cluster of Linux workstations using MPI as a parallel programming environment. We present a comparative study of their performance. The obtained experimental results for the test problems and the analysis of the two algorithms show that the proposed parallel algorithms offer high speed, efficiency and numerical stability. The results also show that Gauss-Huard algorithm performs as good as Gaussian elimination and is more efficient than Gauss-Jordan.