Abstract
This paper discusses and compares several parallelization strategies for tree-structured computations. In particular, we focus on the parallelization of the eigenvector accumulation process in divide-and-conquer eigensolvers, such as the recently developed block divide-and-conquer (BD&C) eigensolver. We describe a model algorithm for evaluating the performance of several parallel variants of this accumulation process, and we develop a block parallel approach which is shown to achieve good speedup in experiments on PC clusters.
Chapter PDF
References
Tisseur, F., Dongarra, J.: A parallel divide and conquer algorithm for the symmetric eigenvalue problem on distributed memory architectures. SIAM J. Sci. Comput. 20, 2223–2236 (1999)
Gansterer, W.N., Ward, R.C., P.Muller, R., Goddard, III, W.A.: Computing approximate eigenpairs of symmetric block tridiagonal matrices. SIAM J. Sci. Comput. 25, 65–85 (2003)
Fox, G., Otto, S., Hey, A.: Matrix algorithms on a hypercube i: Matrix multiplication. Parallel Computing 4, 17–31 (1987)
Choi, J., Dongarra, J.J., Walker, D.: Pumma: Parallel universal matrix multiplication algorithms on distributed memory concurrent computers. Concurrency: Practice and Experience 6, 543–570 (1994)
van de Geijn, R.A., Watts, J.: Summa: Scalable universal matrix multiplication algorithm. Concurrency: Practice and Experience 9, 255–274 (1997)
Choi, J.: A fast scalable universal matrix multiplication algorithm on distributedmemory concurrent computers. In: Proceedings of the 11th International Parallel Processing Symposium, pp. 310–314. IEEE Press, Los Alamitos (1997)
Gu, M., Eisenstat, S.C.: A stable and efficient algorithm for the rank-one modification of the symmetric eigenproblem. SIAM J. Matrix Anal. Appl. 15, 1266–1276 (1994)
Gu, M., Eisenstat, S.C.: A divide-and-conquer algorithm for the symmetric tridiagonal eigenproblem. SIAM J. Matrix Anal. Appl. 16, 172–191 (1995)
Gansterer, W.N., Ward, R.C., Muller, R.P.: An extension of the divide-and-conquer method for a class of symmetric block-tridiagonal eigenproblems. ACM Trans. Math. Softw. 28, 45–58 (2002)
Gansterer, W.N., Zottl, J.: Message passing vs. virtual shared memory - a performance comparison. In: Juhász, Z., Kacsuk, P., Kranzlmüller, D. (eds.) Distributed and Parallel Systems: Cluster and Grid Computing. The Kluwer International Series in Engineering and Computer Science, vol. 777, pp. 39–46. Springer, Heidelberg (2005)
Blackford, L.S., Choi, J., Cleary, A., D’Azevedo, E., Demmel, J., Dhillon, I., Dongarra, J., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., Whaley, R.C.: ScaLAPACK Users’ Guide. Society for Industrial and Applied Mathematics (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gansterer, W.N., Zottl, J. (2005). Parallelization of Divide-and-Conquer Eigenvector Accumulation. In: Cunha, J.C., Medeiros, P.D. (eds) Euro-Par 2005 Parallel Processing. Euro-Par 2005. Lecture Notes in Computer Science, vol 3648. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11549468_92
Download citation
DOI: https://doi.org/10.1007/11549468_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28700-1
Online ISBN: 978-3-540-31925-2
eBook Packages: Computer ScienceComputer Science (R0)