Management of Deep Memory Hierarchies – Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Computations (original) (raw)

References

1. Andersen, B., Gustavson, F., Waśniewski, J.: A recursive formulation of Cholesky factorization of a matrix in packed storage. ACM Trans. Math. Software 27, 214–244 (2001)
   Article MATH Google Scholar
2. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. SIAM, Philadelphia (1999)
   Book Google Scholar
3. Elmroth, E., Gustavson, F.G.: Applying recursion to serial and parallel QR factorization leads to better performance. IBM J. Res. Develop. 44, 605–624 (2000)
   Article Google Scholar
4. Elmroth, E., Gustavson, F.G.: A faster and simpler recursive algorithm for the LAPACK routine DGELS. BIT 41, 936–949 (2001)
   Article MathSciNet Google Scholar
5. Elmroth, E., Gustavson, F.G.: High-performance library software for QR factorization. In: Sørevik, T., Manne, F., Moe, R., Gebremedhin, A.H. (eds.) PARA 2000. LNCS, vol. 1947, pp. 53–63. Springer, Heidelberg (2001)
   Chapter Google Scholar
6. Elmroth, E., Gustavson, F., Jonsson, I., Kågström, B.: Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software. SIAM Review 46(1), 3–45 (2004)
   Article MATH MathSciNet Google Scholar
7. Granat, R., Jonsson, I., Kågström, B.: 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. LNCS, vol. 3149, pp. 742–750. Springer, Heidelberg (2004)
   Chapter Google Scholar
8. Gustavson, F.G.: Recursion leads to automatic variable blocking for dense linear-algebra algorithms. IBM J. Res. Develop. 41, 737–755 (1997)
   Article Google Scholar
9. Gustavson, F.G., Henriksson, A., Jonsson, I., Kågström, B., Ling, P.: Recursive blocked data formats and BLAS’s for dense linear algebra algorithms. In: Kågström, B., et al. (eds.) PARA 1998. LNCS, vol. 1541, pp. 195–206. Springer, Heidelberg (1998)
   Chapter Google Scholar
10. Gustavson, F.G., Jonsson, I.: Minimal-storage high-performance Cholesky factorization via blocking and recursion. IBM J. Res. Develop. 44, 823–849 (2000)
    Article Google Scholar
11. IBM, Engineering and Scientific Subroutine Library, Guide and Reference, Ver. 3, Rel. 3 (2001)
    Google Scholar
12. Jonsson, I.: Analysis of Processor and Memory Utilization of Recursive Algorithms for Sylvester-Type Matrix Equations Using Performance Monitoring, Report UMINF-03.16, Dept. of Computing Science, Umeå University, Sweden (2003)
    Google Scholar
13. Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems— Part I: One-sided and coupled Sylvester-type matrix equations. ACM Trans. Math. Software 28, 392–415 (2002)
    Article MATH MathSciNet Google Scholar
14. Jonsson, I., Kågström, B.: Recursive blocked algorithms for solving triangular systems— Part II: Two-sided and generalized Sylvester and Lyapunov equations. ACM Trans. Math. Software 28, 416–435 (2002)
    Article MATH MathSciNet Google Scholar
15. Jonsson, I., Kågström, B.: RECSY—AHigh PerformanceLibrary for Sylvester-TypeMatrix Equations (2003), http://www.cs.umu.se/research/parallel/recsy
16. Kågström, B., Ling, P., Van Loan, C.: GEMM-based level 3 BLAS: High-performance model implementations and performance evaluation benchmark. ACM Trans. Math. Software 24(3), 268–302 (1998)
    Article MATH Google Scholar
17. Kågström, B., Ling, P., Van Loan, C.: Algorithm 784: GEMM-based level 3 BLAS: Portability and optimization issues. ACM Trans. Math. Software 24, 303–316 (1998)
    Article MATH Google Scholar
18. SLICOT, The SLICOT Library and the Numerics in Control Network (NICONET) website, http://www.win.tue.nl/niconet/

Download references