메뉴 건너뛰기




Volumn 1, Issue , 2009, Pages 247-256

A comparative study of blocking storage methods for sparse matrices on multicore architectures

Author keywords

Blocking; Performance evaluation; Sparse matrix vector multiplication

Indexed keywords

BLOCKING PERFORMANCE; COMPARATIVE STUDIES; COMPUTATIONAL KERNELS; HIGH DEMAND; INDEXING STRUCTURES; INPUT MATRICES; MEMORY BANDWIDTHS; MEMORY SUBSYSTEMS; MICRO ARCHITECTURES; MULTICORE ARCHITECTURES; OPTIMIZATION TECHNIQUES; SPARSE MATRICES; SPARSE MATRIX-VECTOR MULTIPLICATION; STORAGE FORMATS;

EID: 70749149210     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSE.2009.223     Document Type: Conference Paper
Times cited : (32)

References (16)
  • 1
    • 84983621818 scopus 로고
    • A high performance algorithm using pre-processing for the sparse matrix-vector multiplication
    • Minneapolis, MN, United States, IEEE Computer Society
    • R. C. Agarwal, F. G. Gustavson, and M. Zubair. A high performance algorithm using pre-processing for the sparse matrix-vector multiplication. In Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pages 32-41, Minneapolis, MN, United States, 1992. IEEE Computer Society.
    • (1992) Proceedings of the 1992 ACM/IEEE Conference on Supercomputing , pp. 32-41
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 3
    • 0003197949 scopus 로고    scopus 로고
    • The university of florida sparse matrix collection
    • June
    • T. Davis. The University of Florida sparse matrix collection. NA Digest, vol. 97, no. 23, June 1997. http://www.cise.ufl.edu/research/sparse/matrices.
    • (1997) NA Digest , vol.97 , Issue.23
    • Davis, T.1
  • 8
    • 55849145179 scopus 로고    scopus 로고
    • Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression
    • Portland, Oregon, United States, IEEE Computer Society
    • K. Kourtis, G. Goumas, and N. Koziris. Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression. In Proceedings of the 2008 37th International Conference on Parallel Processing, Portland, Oregon, United States, 2008. IEEE Computer Society.
    • (2008) Proceedings of the 2008 37th International Conference on Parallel Processing
    • Kourtis, K.1    Goumas, G.2    Koziris, N.3
  • 12
    • 85031661900 scopus 로고
    • Characterizing the behavior of sparse algorithms on caches
    • Minneapolis, MN, United States, IEEE Computer Society
    • O. Temam and W. Jalby. Characterizing the behavior of sparse algorithms on caches. In Proceedings of the 1992 ACM/IEEE conference on Supercomputing, pages 578-587, Minneapolis, MN, United States, 1992. IEEE Computer Society.
    • (1992) Proceedings of the 1992 ACM/IEEE Conference on Supercomputing , pp. 578-587
    • Temam, O.1    Jalby, W.2


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