메뉴 건너뛰기




Volumn 4967 LNCS, Issue , 2008, Pages 618-621

The relevance of new data structure approaches for dense linear algebra in the new multi-core / many core environments

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS; BOOLEAN ALGEBRA; CHEMICAL MODIFICATION; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; COMPUTER SCIENCE; COMPUTER SYSTEMS; COMPUTERS; DATA STRUCTURES; EIGENVALUES AND EIGENFUNCTIONS; EVOLUTIONARY ALGORITHMS; FACTORIZATION; FILE ORGANIZATION; MATRIX ALGEBRA; MULTITASKING; SEMICONDUCTOR COUNTERS; STATISTICS;

EID: 45449099073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-68111-3_64     Document Type: Conference Paper
Times cited : (2)

References (17)
  • 1
    • 0028513316 scopus 로고
    • Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms
    • Agarwal, R.C., Gustavson, F.G., Zubair, M.: Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms. IBM Journal of Research and Development 38(5), 563-576 (1994)
    • (1994) IBM Journal of Research and Development , vol.38 , Issue.5 , pp. 563-576
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 2
    • 18044400448 scopus 로고    scopus 로고
    • A Recursive Formulation of Cholesky Factorization of a Matrix in Packed Storage
    • Andersen, B.S., Gustavson, F.G., Wásniewski, J.: A Recursive Formulation of Cholesky Factorization of a Matrix in Packed Storage. ACM TOMS 27(2), 214-244 (2001)
    • (2001) ACM TOMS , vol.27 , Issue.2 , pp. 214-244
    • Andersen, B.S.1    Gustavson, F.G.2    Wásniewski, J.3
  • 3
    • 30544437857 scopus 로고    scopus 로고
    • A Fully Portable High Performance Minimal Storage Hybrid Cholesky Algorithm
    • Andersen, B.S., Gunnels, J.A., Gustavson, F.G., Reid, J.K., Waśniewski, J.: A Fully Portable High Performance Minimal Storage Hybrid Cholesky Algorithm. ACM TOMS 31(2), 201-227 (2005)
    • (2005) ACM TOMS , vol.31 , Issue.2 , pp. 201-227
    • Andersen, B.S.1    Gunnels, J.A.2    Gustavson, F.G.3    Reid, J.K.4    Waśniewski, J.5
  • 5
    • 21044454029 scopus 로고    scopus 로고
    • Design and Exploitation of a High-performance SIMD Floating-point Unit for Blue Gene/L
    • Chatterjee, S., et al.: Design and Exploitation of a High-performance SIMD Floating-point Unit for Blue Gene/L. IBM Journal of Research and Development 49(2-3), 377-391 (2005)
    • (2005) IBM Journal of Research and Development , vol.49 , Issue.2-3 , pp. 377-391
    • Chatterjee, S.1
  • 6
    • 0025402476 scopus 로고
    • A Set of Level 3 Basic Linear Algebra Subprograms
    • Dongarra, J.J., Du Croz, J., Hammarling, S., Duff, I.: A Set of Level 3 Basic Linear Algebra Subprograms. TOMS 16(1), 1-17 (1990)
    • (1990) TOMS , vol.16 , Issue.1 , pp. 1-17
    • Dongarra, J.J.1    Du Croz, J.2    Hammarling, S.3    Duff, I.4
  • 7
    • 1842832833 scopus 로고    scopus 로고
    • Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
    • Elmroth, E., Gustavson, F.G., 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)
    • (2004) SIAM Review , vol.46 , Issue.1 , pp. 3-45
    • Elmroth, E.1    Gustavson, F.G.2    Jonsson, I.3    Kågström, B.4
  • 8
    • 0004236492 scopus 로고    scopus 로고
    • 3rd edn. John Hopkins Press, Baltimore and London
    • Golub, G., Van Loan, C: Matrix Computations, 3rd edn. John Hopkins Press, Baltimore and London (1996)
    • (1996) Matrix Computations
    • Golub, G.1    Van Loan, C.2
  • 9
    • 0031273280 scopus 로고    scopus 로고
    • Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms
    • Gustavson, F.G.: Recursion Leads to Automatic Variable Blocking for Dense Linear-Algebra Algorithms. IBM Journal of Research and Development 41(6), 737-755 (1997)
    • (1997) IBM Journal of Research and Development , vol.41 , Issue.6 , pp. 737-755
    • Gustavson, F.G.1
  • 10
    • 0034312453 scopus 로고    scopus 로고
    • Minimal Storage High Performance Cholesky via Blocking and Recursion
    • Gustavson, F.G., Jonsson, I.: Minimal Storage High Performance Cholesky via Blocking and Recursion. IBM Journal of Research and Development 44(6), 823-849 (2000)
    • (2000) IBM Journal of Research and Development , vol.44 , Issue.6 , pp. 823-849
    • Gustavson, F.G.1    Jonsson, I.2
  • 11
    • 84947583789 scopus 로고    scopus 로고
    • Gustavson, F.G.: New Generalized Data Structures for Matrices Lead to a Variety of High Performance Linear Algebra Algorithms. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, 2328, pp. 418-436. Springer, Heidelberg (2002)
    • Gustavson, F.G.: New Generalized Data Structures for Matrices Lead to a Variety of High Performance Linear Algebra Algorithms. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds.) PPAM 2001. LNCS, vol. 2328, pp. 418-436. Springer, Heidelberg (2002)
  • 12
    • 0037230301 scopus 로고    scopus 로고
    • High Performance Linear Algebra Algorithms using New Generalized Data Structures for Matrices
    • Gustavson, F.G.: High Performance Linear Algebra Algorithms using New Generalized Data Structures for Matrices. IBM Journal of Research and Development 47(1), 31-55 (2003)
    • (2003) IBM Journal of Research and Development , vol.47 , Issue.1 , pp. 31-55
    • Gustavson, F.G.1
  • 13
    • 33745312312 scopus 로고    scopus 로고
    • Gustavson, F.G.: New Generalized Data Structures for Matrices Lead to a Variety of High performance Dense Linear Algorithms. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds.) PARA 2004. LNCS, 3732, pp. 11-20. Springer, Heidelberg (2006)
    • Gustavson, F.G.: New Generalized Data Structures for Matrices Lead to a Variety of High performance Dense Linear Algorithms. In: Dongarra, J., Madsen, K., Waśniewski, J. (eds.) PARA 2004. LNCS, vol. 3732, pp. 11-20. Springer, Heidelberg (2006)
  • 14
    • 38049054439 scopus 로고    scopus 로고
    • Gustavson, F.G., Gunnels, J., Sexton, J.: Minimal Data Copy For Dense Linear Algebra Factorization. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, 4699, pp. 540-549. Springer, Heidelberg (2007)
    • Gustavson, F.G., Gunnels, J., Sexton, J.: Minimal Data Copy For Dense Linear Algebra Factorization. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 540-549. Springer, Heidelberg (2007)
  • 15
    • 38049016587 scopus 로고    scopus 로고
    • Gustavson, F.G., Waśniewski, J.: LAPACK Cholesky routines in rectangular full packed format. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, 4699, pp. 570-579. Springer, Heidelberg (2007)
    • Gustavson, F.G., Waśniewski, J.: LAPACK Cholesky routines in rectangular full packed format. In: Kågström, B., Elmroth, E., Dongarra, J., Waśniewski, J. (eds.) PARA 2006. LNCS, vol. 4699, pp. 570-579. Springer, Heidelberg (2007)
  • 16
    • 45449106315 scopus 로고    scopus 로고
    • IBM. IBM Engineering and Scientific Subroutine Library for AIX Version 3, Release 3. IBM Pub. No. SA22-7272-00 February 1986
    • IBM. IBM Engineering and Scientific Subroutine Library for AIX Version 3, Release 3. IBM Pub. No. SA22-7272-00 (February 1986)


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.