메뉴 건너뛰기




Volumn , Issue , 2013, Pages 222-231

Communication optimal parallel multiplication of sparse random matrices

Author keywords

Communication avoiding algorithms; Communication cost lower bounds; Random graphs; Sparse matrix multiplication

Indexed keywords

GRAPH THEORY; PARALLEL ALGORITHMS; PARALLEL PROCESSING SYSTEMS;

EID: 84883515454     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2486159.2486196     Document Type: Conference Paper
Times cited : (96)

References (32)
  • 5
    • 0004185470 scopus 로고    scopus 로고
    • Second Edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA
    • W. Briggs, V. Henson, and S. McCormick. A Multigrid Tutorial: Second Edition. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
    • (2000) A Multigrid Tutorial
    • Briggs, W.1    Henson, V.2    McCormick, S.3
  • 7
    • 55849139091 scopus 로고    scopus 로고
    • Challenges and advances in parallel sparse matrix-matrix multiplication
    • Portland, Oregon, USA, IEEE Computer Society.
    • A. Buluç and J. Gilbert. Challenges and advances in parallel sparse matrix-matrix multiplication. In ICPP '08: Proc. of the Intl. Conf. on Parallel Processing, pages 503-510, Portland, Oregon, USA, 2008. IEEE Computer Society.
    • (2008) ICPP '08: Proc. Of the Intl. Conf. On Parallel Processing , pp. 503-510
    • Buluç, A.1    Gilbert, J.2
  • 8
    • 82955164060 scopus 로고    scopus 로고
    • The combinatorial blas: Design, implementation, and applications
    • November
    • A. Buluç and J. Gilbert. The combinatorial blas: Design, implementation, and applications. Int. J. High Perform. Comput. Appl., 25(4):496-509, November 2011.
    • (2011) Int. J. High Perform. Comput. Appl. , vol.25 , Issue.4 , pp. 496-509
    • Buluç, A.1    Gilbert, J.2
  • 9
    • 84866380590 scopus 로고    scopus 로고
    • Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments
    • (SISC)
    • A. Buluç and J. Gilbert. Parallel sparse matrix-matrix multiplication and indexing: Implementation and experiments. SIAM Journal of Scientific Computing (SISC), 34(4):170 - 191, 2012.
    • (2012) SIAM Journal of Scientific Computing , vol.34 , Issue.4 , pp. 170-191
    • Buluç, A.1    Gilbert, J.2
  • 12
    • 0034625292 scopus 로고    scopus 로고
    • A general parallel sparse-blocked matrix multiply for linear scaling SCF theory
    • M. Challacombe. A general parallel sparse-blocked matrix multiply for linear scaling SCF theory. Computer physics communications, 128(l-2):93-107, 2000.
    • (2000) Computer Physics Communications , vol.128 , Issue.L-2 , pp. 93-107
    • Challacombe, M.1
  • 14
    • 0001540595 scopus 로고
    • Paul erdo′s and alfréd rényi. On random graphs
    • Paul erdo′s and alfréd rényi. on random graphs. Publicationes Mathematicae Debrecen, 6:290-297, 1959.
    • (1959) Publicationes Mathematicae Debrecen , vol.6 , pp. 290-297
  • 16
    • 39749144465 scopus 로고    scopus 로고
    • A unified framework for numerical and combinatorial computing
    • DOI 10.1109/MCSE.2008.45, 4454427
    • J. Gilbert, S. Reinhardt, and V. Shah. A unified framework for numerical and combinatorial computing. Computing in Science and Engineering, 10(2):20-25, 2008. (Pubitemid 351305834)
    • (2008) Computing in Science and Engineering , vol.10 , Issue.2 , pp. 20-25
    • Gilbert, J.R.1    Shah, V.B.2    Reinhardt, S.3
  • 21
    • 0024963731 scopus 로고
    • Techniques for parallel manipulation of sparse matrices
    • C. Kruskal, L. Rudolph, and M. Snir. Techniques for parallel manipulation of sparse matrices. Theor. Comput. Sci., 64(2): 135-157, 1989.
    • (1989) Theor. Comput. Sci. , vol.64 , Issue.2 , pp. 135-157
    • Kruskal, C.1    Rudolph, L.2    Snir, M.3
  • 22
    • 0001289565 scopus 로고
    • An inequality related to the isoperimetric inequality
    • L. Loomis and H. Whitney. An inequality related to the isoperimetric inequality. Bulletin of the AMS, 55:961-962, 1949.
    • (1949) Bulletin of the AMS , vol.55 , pp. 961-962
    • Loomis, L.1    Whitney, H.2
  • 23
    • 0000743020 scopus 로고    scopus 로고
    • Memory-efficient matrix multiplication in the BSP model
    • W. McColl and A. Tiskin. Memory-efficient matrix multiplication in the BSP model. Algorithmica, 24:287-297, 1999. (Pubitemid 129715337)
    • (1999) Algorithmica (New York) , vol.24 , Issue.3-4 , pp. 287-297
    • McColl, W.F.1    Tiskin, A.2
  • 24
    • 33644623158 scopus 로고    scopus 로고
    • Efficient transitive closure of sparse matrices over closed semirings
    • G. Penn. Efficient transitive closure of sparse matrices over closed semirings. Theoretical Computer Science, 354(1):72-81, 2006.
    • (2006) Theoretical Computer Science , vol.354 , Issue.1 , pp. 72-81
    • Penn, G.1
  • 26
    • 84883540517 scopus 로고    scopus 로고
    • Parallel matrix multiplication: 2d and 3d, flame working note #62
    • The University of Texas at Austin, Department of Computer Sciences, June
    • M. Schatz, J. Poulson, and R. van de Geijn. Parallel matrix multiplication: 2d and 3d, flame working note #62. Technical Report TR-12-13, The University of Texas at Austin, Department of Computer Sciences, June 2012.
    • (2012) Technical Report TR-12-13
    • Schatz, M.1    Poulson, J.2    Van De Geijn, R.3
  • 29
    • 0031123769 scopus 로고    scopus 로고
    • SUMMA: Scalable universal matrix multiplication algorithm
    • R. van de Geijn and J. Watts. SUMMA: Scalable universal matrix multiplication algorithm. Concurrency - Practice and Experience, 9(4):255-274, 1997. (Pubitemid 127679707)
    • (1997) Concurrency Practice and Experience , vol.9 , Issue.4 , pp. 255-274
    • Van De, G.R.A.1    Watts, J.2
  • 31
    • 84867384854 scopus 로고    scopus 로고
    • Linear scaling self-consistent field calculations with millions of atoms in the condensed phase
    • J. VandeVondele, U. Borštnik, and J. Flutter. Linear scaling self-consistent field calculations with millions of atoms in the condensed phase. Journal of Chemical Theory and Computation, 8(10):3565-3573, 2012.
    • (2012) Journal of Chemical Theory and Computation , vol.8 , Issue.10 , pp. 3565-3573
    • VandeVondele, J.1    Borštnik, U.2    Flutter, J.3


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