A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh
Visualitza/Obre
Cita com:
hdl:2117/102603
Tipus de documentText en actes de congrés
Data publicació1998
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
The paper proposes an algorithm for computing symmetric eigenvalues and eigenvectors that uses a one-sided Jacobi approach and is targeted to a multicomputer in which nodes can be arranged as a two-dimensional mesh with an arbitrary number of rows and columns. The algorithm is analysed through simple analytical models of execution time, which show that an adequate choice of the mesh configuration (number of rows and columns) can improve performance significantly, with respect to a one-dimensional configuration, which is the most frequently considered scenario in current proposals. This improvement is especially noticeable in large systems.
CitacióRoyo, M.D., Valero-García, M, González, A. A Jacobi-based algorithm for computing symmetric eigenvalues and eigenvectors in a two-dimensional mesh. A: Euromicro International Conference on Parallel, Distributed, and Network-Based Processing. "Proceedings of the 6th EUROMICRO Workshop on Parallel and Distributed Processing, PDP'98: University of Madrid: January 21-23, 1998, Madrid, Spain". Madrid: Institute of Electrical and Electronics Engineers (IEEE), 1998, p. 463-469.
ISBN0-8186-8332-5
Versió de l'editorhttp://ieeexplore.ieee.org/xpl/articleDetails.jsp?arnumber=647234
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
00647234.pdf | 699,3Kb | Visualitza/Obre |