Abstract
The paper discusses the implementation of a parallel algorithm to compute the eigenvalues and eigenvectors of a real symmetric matrix on a mesh multicomputer. The algorithm uses the one-sided Jacobi method and a two-dimensional organization of the nodes. It is aimed at reducing the communication cost incurred by one-dimensional algorithms found in the literature. The performance of the proposed algorithm on a squared 2D/3D mesh multicomputer is assessed through simple analytical models of execution time. The models show that the performance improvement over one-dimensional algorithms can be very noticeable, specially for a large number of nodes.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
