메뉴 건너뛰기




Volumn , Issue , 2000, Pages 224-229

Efficient parallel algorithms for multi-dimensional matrix operations

Author keywords

Compiler; Matrix operation; Multi dimensionalmatrix. Data Structure; Parallel algorithm

Indexed keywords

COMPUTATIONAL CHEMISTRY; COMPUTATIONAL FLUID DYNAMICS; LINEAR SYSTEMS; MOLECULAR DYNAMICS; PARALLEL ALGORITHMS;

EID: 84907042187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISPAN.2000.900289     Document Type: Conference Paper
Times cited : (8)

References (18)
  • 1
    • 0027750576 scopus 로고
    • Compilation techniques for sparse matrix computations
    • [l] Aart J.C. Bik and Harry A.G Wijshoff, “Compilation Techniques for Sparse Matrix Computations,” In Proceedings of Supercomputing,pages 430-439, 1993.
    • (1993) Proceedings of Supercomputing , pp. 430-439
    • Bik, A.J.C.1    Wijshoff, H.A.G.2
  • 3
    • 85117722888 scopus 로고
    • Automatic data structure selection and transformation for sparse matrix computations
    • Aart J.C. Bik and Harry A.G Wijshoff, “Automatic Data Structure Selection and Transformation for Sparse Matrix Computations,”TechnicalReport, 1992.
    • (1992) TechnicalReport
    • Bik, A.J.C.1    Wijshoff, H.A.G.2
  • 7
    • 0011916940 scopus 로고    scopus 로고
    • Cache probabilistic modeling for basic sparse algebra kernels involving matrices with a non-uniform distribution
    • 24 August
    • B. B. Fraguela, R. Doallo, E. L. Zapata, “Cache Probabilistic Modeling for Basic Sparse Algebra Kernels Involving Matrices with a Non-Uniform Distribution,” 24”’ IEEE Euromicro Conference, pp.345-348, August,1998.
    • (1998) IEEE Euromicro Conference , pp. 345-348
    • Fraguela, B.B.1    Doallo, R.2    Zapata, E.L.3
  • 10
    • 0033075413 scopus 로고    scopus 로고
    • Improvingcache locality by a combinationof loop and datatransformations
    • February1999
    • Mahmut Kandemir, J. Ramanujam, Alok Choudhary, “ImprovingCache Locality by a Combinationof Loop and DataTransformations,” IEEETrans.onComputers,vol48, no. 2,February1999.
    • IEEETrans.onComputers , vol.vol48 , Issue.2
    • Kandemir, M.1    Ramanujam, J.2    Choudhary, A.3
  • 12
    • 10844257146 scopus 로고    scopus 로고
    • A relation approach to the compilation of sparse matrix programs
    • August
    • Vladimir Kotlyar, Keshav Pingali, and Paul Stodghill, “A Relation Approach to the Compilation of Sparse Matrix Programs,” In Euro Par, August 1997.
    • (1997) Euro Par
    • Kotlyar, V.1    Pingali, K.2    Stodghill, P.3
  • 18
    • 85117729793 scopus 로고    scopus 로고
    • On improving the performance of sparse matrix-matrix vector multiplication
    • James B. White, and P Sadayappan, “On Improving the Performance of Sparse Matrix-Matrix Vector Multiplication,” IEEE Conference, 1997.
    • (1997) IEEE Conference
    • White, J.B.1    Sadayappan, P.2


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