Abstract
Parallel ScaLAPACK-style hybrid algorithms for solving the triangular continuous-time Sylvester (SYCT) equation AX–XB=C using recursive blocked node solvers from the novel high-performance library RECSY are presented. We compare our new hybrid algorithms with parallel implementations based on the SYCT solver DTRSYL from LAPACK. Experiments show that the RECSY solvers can significantly improve on the serial as well as on the parallel performance if the problem data is partitioned and distributed in an appropriate way. Examples include cutting down the execution time by 47% and 34% when solving large-scale problems using two different communication schemes in the parallel algorithm and distributing the matrices with blocking factors four times larger than normally. The recursive blocking is automatic for solving subsystems of the global explicit blocked algorithm on the nodes.
Chapter PDF
Similar content being viewed by others
Keywords
References
Bartels, R.H., Stewart Algorithm, G.W.: 432: Solution of the Equation AX + XB = C. Comm. ACM 15(9), 820–826 (1972)
Anderson, E., Bai, Z., Bischof, C., Demmel, J., Dongarra, J., DuCroz, J., Greenbaum, A., Hammarling, S., McKenny, A., Ostrouchov, S., Sorensen, D.: LAPACK User’s Guide, 3rd edn. SIAM Publications, Philadelphia (1999)
Blackford, S., Choi, J., Clearly, 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. SIAM Publications, Philadelphia (1997)
Dongarra, J.J., Du Croz, J., Duff, I.S., Hammarling, S.: A set of Level 3 Basic Linear Algebra Subprograms. ACM Trans. Math. Soft. 16(1), 1–17 (1990)
Elmroth, E., Johansson, P., Kågström, B., Kressner, D.: A Web Computing Environment for the SLICOT Library. In: Van Dooren, P., Van Huffel, S. (eds.) The Third NICONET Workshop on Numerical Control Software, pp. 53–61 (2001)
Granat, R.: A Parallel ScaLAPACK-style Sylvester Solver, Master Thesis, UMNAD 435/03, Dept. Computing Science, Umeå University, Sweden (January 2003)
Granat, R., Kågström, B., Poromaa, P.: Parallel ScaLAPACK-style Algorithms for Solving Continous-Time Sylvester Matrix Equations. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 800–809. Springer, Heidelberg (2003)
Henry, G., Van de Geijn, R.: Parallelizing the QR Algorithm for the Unsymmetric Algebraic Eigenvalue Problem: Myths and Reality. SIAM J. Sci. Comput. 17, 870–883 (1997)
Henry, G., Watkins, D., Dongarra, J.: A Parallel Implementation of the Nonsymmetric QR Algorithm for Distributed Memory Architectures. Technical Report CS-97-352 and Lapack Working Note 121, University of Tennessee (1997)
Higham, N.J.: Perturbation Theory and Backward Error for AX −XB = C. BIT 33, 124–136 (1993)
Jonsson, I., Kågström, B.: Recursive Blocked Algorithms for Solving Triangular Matrix Equations – Part I: One-Sided and Coupled Sylvester-Type Equations. ACM Trans. Math. Software 28(4), 393–415 (2002)
Jonsson, I., Kågström, B.: Recursive Blocked Algorithms for Solving Triangular Matrix Equations – Part II: Two-Sided and Generalized Sylvester and Lyapunov Equations. ACM Trans. Math. Software 28(4), 416–435 (2002)
Jonsson, I., Kågström, B.: RECSY - A High Performance Library for Solving Sylvester-Type Matrix Equations. In: Kosch, H., Böszörményi, L., Hellwagner, H. (eds.) Euro-Par 2003. LNCS, vol. 2790, pp. 810–819. Springer, Heidelberg (2003)
Jonsson, I., Kågström, B.: RECSY – A High Performance Library for Sylvester-Type Matrix Equations (2003), www.cs.umu.se/research/parallel/recsy
Kågström, B., Ling, P., Van Loan, C.: GEMM-based level 3 BLAS: Highperformance model implementations and performance evaluation benchmark. ACM Trans. Math. Software 24(3), 268–302 (1998)
Kågström, B., Ling, P., Van Loan, C.: GEMM-based level 3 BLAS: Portability and optimization issues. ACM Trans. Math. Software 24(3), 303–316 (1998)
Kågström, B., Poromaa, P.: Distributed and shared memory block algorithms for the triangular Sylvester equation with Sep−1 estimators. SIAM J. Matrix Anal. Appl. 13, 99–101 (1992)
NICONET Task II: Model Reduction, website http://www.win.tue.nl/niconet/NIC2/NICtask2.html
Poromaa, P.: Parallel Algorithms for Triangular Sylvester Equations: Design, Scheduling and Scalability Issues. In: Kågström, B., Elmroth, E., Waśniewski, J., Dongarra, J. (eds.) PARA 1998. LNCS, vol. 1541, pp. 438–446. Springer, Heidelberg (1998)
SLICOT library in the Numerics in Control Network (NICONET), website http://www.win.tue.nl/niconet/index.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Granat, R., Jonsson, I., Kågström, B. (2004). Combining Explicit and Recursive Blocking for Solving Triangular Sylvester-Type Matrix Equations on Distributed Memory Platforms. In: Danelutto, M., Vanneschi, M., Laforenza, D. (eds) Euro-Par 2004 Parallel Processing. Euro-Par 2004. Lecture Notes in Computer Science, vol 3149. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27866-5_97
Download citation
DOI: https://doi.org/10.1007/978-3-540-27866-5_97
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22924-7
Online ISBN: 978-3-540-27866-5
eBook Packages: Springer Book Archive