Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06) Solving System of Linear Equations in a Network of Workstations Timisoara, Romania July 06-July 09 ISBN: 0-7695-2638-1
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISPDC.2006.45
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.
Citation:
Gabriel Dimitriu, Felicia Ionescu, "Solving System of Linear Equations in a Network of Workstations," ispdc, pp.323-328, Proceedings of The Fifth International Symposium on Parallel and Distributed Computing (ISPDC'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb