메뉴 건너뛰기




Volumn , Issue , 2008, Pages 511-519

Improving the performance of multithreaded sparse matrix-vector multiplication using index and value compression

Author keywords

[No Author keywords available]

Indexed keywords

COARSE GRAINS; COMPRESSION SCHEMES; DELTA ENCODING; MEMORY BANDWIDTH REQUIREMENTS; MULTITHREADED; NUMERICAL VALUES; SHARED MEMORIES; SPARSE MATRIXES; STRUCTURAL DATUMS; VECTOR MULTIPLICATIONS;

EID: 55849145179     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2008.62     Document Type: Conference Paper
Times cited : (35)

References (28)
  • 2
    • 55849138680 scopus 로고    scopus 로고
    • K. Asanovic et al. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, December 18 2006.
    • K. Asanovic et al. The landscape of parallel computing research: A view from berkeley. Technical Report UCB/EECS-2006-183, EECS Department, University of California, Berkeley, December 18 2006.
  • 4
    • 34547626759 scopus 로고    scopus 로고
    • High throughput compression of double-precision floating-point data
    • Washington, DC, USA, IEEE Computer Society
    • M. Burtscher and P. Ratanaworabhan. High throughput compression of double-precision floating-point data. In DCC '07: Proceedings of the 2007 Data Compression Conference, pages 293-302, Washington, DC, USA, 2007. IEEE Computer Society.
    • (2007) DCC '07: Proceedings of the 2007 Data Compression Conference , pp. 293-302
    • Burtscher, M.1    Ratanaworabhan, P.2
  • 5
    • 84947911090 scopus 로고    scopus 로고
    • Decomposing irregularly sparse matrices for parallel matrix-vector multiplication
    • U. V. Catalyuerek and C. Aykanat. Decomposing irregularly sparse matrices for parallel matrix-vector multiplication. Lecture Notes In Computer Science, 1117:75-86, 1996.
    • (1996) Lecture Notes In Computer Science , vol.1117 , pp. 75-86
    • Catalyuerek, U.V.1    Aykanat, C.2
  • 7
    • 0003197949 scopus 로고    scopus 로고
    • University of Florida sparse matrix collection
    • T. Davis. University of Florida sparse matrix collection. NA Digest, 97(23):7, 1997.
    • (1997) NA Digest , vol.97 , Issue.23 , pp. 7
    • Davis, T.1
  • 8
    • 20344401552 scopus 로고    scopus 로고
    • Chip makers turn to multicore processors
    • D. Geer. Chip makers turn to multicore processors. IEEE Computer, 38(5):11-13, 2005.
    • (2005) IEEE Computer , vol.38 , Issue.5 , pp. 11-13
    • Geer, D.1
  • 14
    • 84949647432 scopus 로고    scopus 로고
    • Optimizing sparse matrix computations for register reuse in SPARSITY
    • E. Im and K. Yelick. Optimizing sparse matrix computations for register reuse in SPARSITY. Lecture Notes in Computer Science, 2073:127-136, 2001.
    • (2001) Lecture Notes in Computer Science , vol.2073 , pp. 127-136
    • Im, E.1    Yelick, K.2
  • 17
    • 34548206782 scopus 로고    scopus 로고
    • Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems)
    • New York, NY, USA, ACM
    • J. Langou, J. Langou, P. Luszczek, J. Kurzak, A. Buttari, and J. Dongarra. Exploiting the performance of 32 bit floating point arithmetic in obtaining 64 bit accuracy (revisiting iterative refinement for linear systems). In SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing, page 113, New York, NY, USA, 2006. ACM.
    • (2006) SC '06: Proceedings of the 2006 ACM/IEEE conference on Supercomputing , pp. 113
    • Langou, J.1    Langou, J.2    Luszczek, P.3    Kurzak, J.4    Buttari, A.5    Dongarra, J.6
  • 20
    • 3042618790 scopus 로고    scopus 로고
    • J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera. Improving the locality of the sparse matrix-vector product on shared memory multiprocessors. In PDP, pages 66-71. IEEE Computer Society, 2004.
    • J. C. Pichel, D. B. Heras, J. C. Cabaleiro, and F. F. Rivera. Improving the locality of the sparse matrix-vector product on shared memory multiprocessors. In PDP, pages 66-71. IEEE Computer Society, 2004.
  • 21
    • 85031264203 scopus 로고    scopus 로고
    • Improving performance of sparse matrix-vector multiplication. In Supercomputing'99, Portland, OR
    • Nov
    • A. Pinar and M. T. Heath. Improving performance of sparse matrix-vector multiplication. In Supercomputing'99, Portland, OR, Nov. 1999. ACM SIGARCH and IEEE.
    • (1999) ACM SIGARCH and IEEE
    • Pinar, A.1    Heath, M.T.2
  • 22
    • 55849126609 scopus 로고    scopus 로고
    • Y Saad. SPARSKIT: A basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, Minneapolis, MN 55455, June 1994. Version 2
    • Y Saad. SPARSKIT: A basic tool kit for sparse matrix computations. Technical report, Computer Science Department, University of Minnesota, Minneapolis, MN 55455, June 1994. Version 2.
  • 24
    • 0031269220 scopus 로고    scopus 로고
    • Improving the memory-system performance of sparse-matrix vector multiplication
    • S. Toledo. Improving the memory-system performance of sparse-matrix vector multiplication. IBM Journal of Research and Development, 41(6):711-725, 1997.
    • (1997) IBM Journal of Research and Development , vol.41 , Issue.6 , pp. 711-725
    • Toledo, S.1
  • 25
    • 84990830919 scopus 로고    scopus 로고
    • Performance optimizations and bounds for sparse matrix-vector multiply
    • Baltimore, MD, Nov
    • R. Vuduc, J. Demmel, K. Yelick, S. Kamil, R. Nishtala, and B. Lee. Performance optimizations and bounds for sparse matrix-vector multiply. In Supercomputing, Baltimore, MD, Nov. 2002.
    • (2002) Supercomputing
    • Vuduc, R.1    Demmel, J.2    Yelick, K.3    Kamil, S.4    Nishtala, R.5    Lee, B.6


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