메뉴 건너뛰기




Volumn 41, Issue 6, 1997, Pages 711-725

Improving the memory-system performance of sparse-matrix vector multiplication

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER STORAGE; COMPUTATIONAL METHODS; MATRIX ALGEBRA; PROGRAM PROCESSORS; REDUCED INSTRUCTION SET COMPUTING; RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER); VECTORS;

EID: 0031269220     PISSN: 00188646     EISSN: None     Source Type: Journal    
DOI: 10.1147/rd.416.0711     Document Type: Article
Times cited : (124)

References (22)
  • 2
    • 0028386843 scopus 로고
    • The Design and Implementation of a Parallel Unstructured Euler Solver Using Software Primitives
    • R. Das, D. J. Mavriplis, J. Saltz, S. Gupta, and R. Ponnusamy, "The Design and Implementation of a Parallel Unstructured Euler Solver Using Software Primitives," AIAA J. 32, 489-496 (1994).
    • (1994) AIAA J. , vol.32 , pp. 489-496
    • Das, R.1    Mavriplis, D.J.2    Saltz, J.3    Gupta, S.4    Ponnusamy, R.5
  • 3
    • 85031661900 scopus 로고
    • Characterizing the Behavior of Sparse Algorithms on Caches
    • IEEE Computer Society Press, Piscataway, NJ
    • O. Temam and W. Jalby, "Characterizing the Behavior of Sparse Algorithms on Caches," Proceedings of Supercomputing '92, IEEE Computer Society Press, Piscataway, NJ, 1992, pp. 578-587.
    • (1992) Proceedings of Supercomputing '92 , pp. 578-587
    • Temam, O.1    Jalby, W.2
  • 4
    • 0007426480 scopus 로고
    • Renumbering Unstructured Grids to Improve the Performance of Codes on Hierarchical Memory Machines
    • Numerical Analysis Group, Oxford University Computing Laboratory, Oxford, England, May
    • D. A. Burgess and M. B. Giles, "Renumbering Unstructured Grids to Improve the Performance of Codes on Hierarchical Memory Machines," Technical Report 95/06, Numerical Analysis Group, Oxford University Computing Laboratory, Oxford, England, May 1995.
    • (1995) Technical Report 95/06
    • Burgess, D.A.1    Giles, M.B.2
  • 5
    • 84983621818 scopus 로고
    • A High-Performance Algorithm Using Pre-Processing for Sparse Matrix-Vector Multiplication
    • IEEE Computer Society Press, Piscataway, NJ, November
    • R. C. Agarwal, F. G. Gustavson, and M. Zubair, "A High-Performance Algorithm Using Pre-Processing for Sparse Matrix-Vector Multiplication," Proceedings of Supercomputing '92, IEEE Computer Society Press, Piscataway, NJ, November 1992, pp. 32-41.
    • (1992) Proceedings of Supercomputing '92 , pp. 32-41
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 9
    • 0029292848 scopus 로고
    • Superscalar Instruction Execution in the 21164 Alpha Microprocessor
    • April
    • John H. Edmondson, Paul Rubinfeld, Ronald Preston, and Vidya Rajagopalan, "Superscalar Instruction Execution in the 21164 Alpha Microprocessor," IEEE Micro, pp. 33-43 (April 1995).
    • (1995) IEEE Micro , pp. 33-43
    • Edmondson, J.H.1    Rubinfeld, P.2    Preston, R.3    Rajagopalan, V.4
  • 10
    • 0030125973 scopus 로고    scopus 로고
    • UltraSparc I: A Four-Issue Processor Supporting Multimedia
    • April
    • Marc Tremblay and J. Michael O'Connor, "UltraSparc I: A Four-Issue Processor Supporting Multimedia," IEEE Micro, pp. 42-49 (April 1996).
    • (1996) IEEE Micro , pp. 42-49
    • Tremblay, M.1    O'Connor, J.M.2
  • 11
    • 0028427170 scopus 로고
    • Improving Performance of Linear Algebra Algorithms for Dense Matrices Using Algorithmic Prefetch
    • R. C. Agarwal, F. G. Gustavson, and M. Zubair, "Improving Performance of Linear Algebra Algorithms for Dense Matrices Using Algorithmic Prefetch," IBM J. Res. Develop. 38, 265-275 (1994).
    • (1994) IBM J. Res. Develop. , vol.38 , pp. 265-275
    • Agarwal, R.C.1    Gustavson, F.G.2    Zubair, M.3
  • 15
    • 0028511878 scopus 로고
    • POWER2: Next Generation of the RISC System/6000 Family
    • S. W. White and S. Dhawan, "POWER2: Next Generation of the RISC System/6000 Family," IBM J. Res. Develop. 38, 493-502 (1994).
    • (1994) IBM J. Res. Develop. , vol.38 , pp. 493-502
    • White, S.W.1    Dhawan, S.2
  • 17
    • 0030672717 scopus 로고    scopus 로고
    • Fast and Effective Algorithms for Graph Partitioning and Sparse-Matrix Ordering
    • A. Gupta, "Fast and Effective Algorithms for Graph Partitioning and Sparse-Matrix Ordering," IBM J. Res. Develop. 41, 171-184 (1997).
    • (1997) IBM J. Res. Develop. , vol.41 , pp. 171-184
    • Gupta, A.1
  • 18
    • 0040487002 scopus 로고    scopus 로고
    • WGPP: Watson Graph Partitioning (and Sparse Matrix Ordering) Package
    • IBM Thomas J. Watson Research Center, Yorktown Heights, NY, May
    • Anshul Gupta, "WGPP: Watson Graph Partitioning (and Sparse Matrix Ordering) Package," Technical Report RC-20453, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, May 1996.
    • (1996) Technical Report RC-20453
    • Gupta, A.1
  • 20
    • 0000602242 scopus 로고
    • The Effect of Ordering on Preconditioned Conjugate Gradient
    • Iain S. Duff and Gérard Meurant, "The Effect of Ordering on Preconditioned Conjugate Gradient," BIT 29, 635-657 (1989).
    • (1989) BIT , vol.29 , pp. 635-657
    • Duff, I.S.1    Meurant, G.2
  • 22
    • 0026267802 scopus 로고
    • An Effective On-Chip Preloading Scheme to Reduce Data Access Penalty
    • IEEE Computer Society Press, Piscataway, NJ
    • J.-L. Baer and T.-F. Chen, "An Effective On-Chip Preloading Scheme to Reduce Data Access Penalty," Proceedings of Supercomputing '91, IEEE Computer Society Press, Piscataway, NJ, 1991, pp. 176-186.
    • (1991) Proceedings of Supercomputing '91 , pp. 176-186
    • Baer, J.-L.1    Chen, T.-F.2


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