메뉴 건너뛰기




Volumn 18, Issue 2 SPEC. ISS., 2004, Pages 225-236

Optimizing sparse matrix-vector product computations using unroll and jam

Author keywords

Data structures; Matrix vector product; Microfactors; Performance optimization; Sparse matrices; Sparse matrix format

Indexed keywords

BANDWIDTH; BUFFER STORAGE; COMPUTER ARCHITECTURE; COMPUTER SYSTEMS; DATA STRUCTURES; OPTIMIZATION; VECTORS;

EID: 2942628343     PISSN: 10943420     EISSN: None     Source Type: Journal    
DOI: 10.1177/1094342004038951     Document Type: Article
Times cited : (85)

References (18)
  • 5
    • 0028549474 scopus 로고
    • Improving the ratio of memory operations to floating-point operations in loops
    • Carr, S., and Kennedy, K., 1994 Improving the ratio of memory operations to floating-point operations in loops. ACM Transactions on Programming Languages and Systems 16(6):1768-1810.
    • (1994) ACM Transactions on Programming Languages and Systems , vol.16 , Issue.6 , pp. 1768-1810
    • Carr, S.1    Kennedy, K.2
  • 8
    • 2942615888 scopus 로고    scopus 로고
    • Improving the performance of sparse matrix-vector multiplication by blocking
    • July
    • Gropp, W., Kaushik, D., Keyes, D., and Smith, B. July 2000. Improving the performance of sparse matrix-vector multiplication by blocking. Talk presented at SIAM Annual Meeting, San Juan, Puerto Rico. Available as http://www.icase.edu/~keyes/multivec.pdf.
    • (2000) SIAM Annual Meeting, San Juan, Puerto Rico
    • Gropp, W.1    Kaushik, D.2    Keyes, D.3    Smith, B.4
  • 9
    • 0004972603 scopus 로고    scopus 로고
    • Optimizing the performance of sparse matrix-vector multiplication
    • PhD thesis, University of California Berkeley
    • Im, E.-J., 2000. Optimizing the performance of sparse matrix-vector multiplication. PhD thesis, University of California Berkeley.
    • (2000)
    • Im, E.-J.1
  • 10
    • 84949647432 scopus 로고    scopus 로고
    • Optimizing sparse matrix computations for register reuse in SPARSITY
    • In V. N. Alexandrov, J. Dongarra, B. A. Juliano, R. S. Renner, and C. J. K. Tan, editors; Springer, Berlin
    • Im, E.-J., and Yelick, K.A., 2001. Optimizing sparse matrix computations for register reuse in SPARSITY. In V. N. Alexandrov, J. Dongarra, B. A. Juliano, R. S. Renner, and C. J. K. Tan, editors, Proceedings of International Conference on Computational Science, Lecture Notes in Computer Science Vol. 2073, Springer, Berlin, pp. 127-136.
    • (2001) Proceedings of International Conference on Computational Science, Lecture Notes in Computer Science , vol.2073 , pp. 127-136
    • Im, E.-J.1    Yelick, K.A.2
  • 12
    • 2942626618 scopus 로고    scopus 로고
    • National Institute of Standards and Technology (NIST), 2003. Matrix market. http:.//math.nist.gov/MatrixMarket
    • (2001)
  • 13
    • 0003635989 scopus 로고
    • NSPCG user's guide
    • December; Center for Numerical Analysis, The University of Texas at Austin
    • Oppe, T., Joubert, W., and Kinkaid, D., December 1988. NSPCG user's guide. Technical Report, Center for Numerical Analysis, The University of Texas at Austin.
    • (1988) Technical Report
    • Oppe, T.1    Joubert, W.2    Kinkaid, D.3
  • 14
    • 0039771978 scopus 로고    scopus 로고
    • RSIM: An execution-driven simulator for ILP-based shared-memory multiprocessors and uniprocessors
    • February; Also appears in IEEE TCCA Newsletter (October)
    • Pai, V.S., Ranganathan, P., and Adve, S.V., February 1997. RSIM: an execution-driven simulator for ILP-based shared-memory multiprocessors and uniprocessors. In Proceedings of the Third Workshop on Computer Architecture Education. Also appears in IEEE TCCA Newsletter (October).
    • (1997) Proceedings of the Third Workshop on Computer Architecture Education
    • Pai, V.S.1    Ranganathan, P.2    Adve, S.V.3
  • 15
    • 0345871024 scopus 로고
    • Data structures to vectorize CG algorithms for general sparsity patterns
    • Paolini, G., and di Brozolo, G.R., 1989. Data structures to vectorize CG algorithms for general sparsity patterns. BIT 29:703:718.
    • (1989) BIT , vol.29 , pp. 703-718
    • Paolini, G.1    Di Brozolo, G.R.2
  • 16
    • 0342773466 scopus 로고
    • Krylov subspace methods on supercomputers
    • Research Institute for Advanced Computer Science, NASA Research Center
    • Saad, Y., 1988. Krylov subspace methods on supercomputers. Technical Report 88.40, Research Institute for Advanced Computer Science, NASA Research Center.
    • (1988) Technical Report 88.40
    • Saad, Y.1
  • 17
    • 0031269220 scopus 로고    scopus 로고
    • Improving the memory-system performance of sparse-matrix vector multiplication
    • Toledo, S., 1997. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development 41(6):711-725.
    • (1997) IBM Journal of Research and Development , vol.41 , Issue.6 , pp. 711-725
    • Toledo, S.1


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