메뉴 건너뛰기




Volumn 37, Issue 9, 2011, Pages 610-632

MapReduce in MPI for Large-scale graph algorithms

Author keywords

Graph algorithms; MapReduce; Message passing; MPI; R MAT matrices

Indexed keywords

CONNECTED COMPONENT; DATA MOVEMENTS; DATA SETS; DISTRIBUTED MEMORY CLUSTERS; GRAPH ALGORITHMS; INDEPENDENT SET; MAPREDUCE; MPI; OPEN-SOURCE LIBRARIES; OUT-OF-CORE; PAGERANK; PARALLEL CODE; PARALLEL LIBRARY; PARALLEL MACHINE; PARALLEL PLATFORMS; R-MAT MATRICES; SCRIPTING LANGUAGES; SHORTEST-PATH; VERTEX-RANKING;

EID: 80052031568     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2011.02.004     Document Type: Article
Times cited : (175)

References (22)
  • 3
    • 0002515487 scopus 로고    scopus 로고
    • Efficient management of parallelism in object oriented numerical software libraries
    • E. Arge, A.M. Bruaset, H.P. Langtangen, Birkhäuser Press
    • S. Balay, W.D. Gropp, L.C. McInnes, and B.F. Smith Efficient management of parallelism in object oriented numerical software libraries E. Arge, A.M. Bruaset, H.P. Langtangen, Modern Software Tools in Scientific Computing 1997 Birkhäuser Press 163 202
    • (1997) Modern Software Tools in Scientific Computing , pp. 163-202
    • Balay, S.1    Gropp, W.D.2    McInnes, L.C.3    Smith, B.F.4
  • 4
    • 0002610737 scopus 로고
    • On a routing problem
    • R. Bellman On a routing problem Quart. Appl. Math. 16 1 1958 87 90
    • (1958) Quart. Appl. Math. , vol.16 , Issue.1 , pp. 87-90
    • Bellman, R.1
  • 8
    • 67651111624 scopus 로고    scopus 로고
    • Graph twiddling in a mapreduce world
    • J. Cohen Graph twiddling in a mapreduce world Comput. Sci. Eng. 11 2009 29 41
    • (2009) Comput. Sci. Eng. , vol.11 , pp. 29-41
    • Cohen, J.1
  • 10
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • J. Dean, and S. Ghemawat Mapreduce: simplified data processing on large clusters Commun. ACM 51 1 2008 107 113
    • (2008) Commun. ACM , vol.51 , Issue.1 , pp. 107-113
    • Dean, J.1    Ghemawat, S.2
  • 17
    • 17444429623 scopus 로고    scopus 로고
    • A survey of eigenvector methods for web information retrieval
    • DOI 10.1137/S0036144503424786
    • A.N. Langville, and C.D. Meyer A survey of eigenvector methods for web information retrieval SIAM Rev. 47 1 2005 135 161 (Pubitemid 40535974)
    • (2005) SIAM Review , vol.47 , Issue.1 , pp. 135-161
    • Langville, A.N.1    Meyer, C.D.2
  • 19
    • 0022807929 scopus 로고
    • A simple parallel algorithm for the maximal independent set problem
    • M. Luby A simple parallel algorithm for the maximal independent set problem SIAM J. Comput. 15 4 1986 1036 1055
    • (1986) SIAM J. Comput. , vol.15 , Issue.4 , pp. 1036-1055
    • Luby, M.1
  • 20
    • 80052028559 scopus 로고    scopus 로고
    • An experimental study of a parallel shortest path algorithm for solving large-scale graph instances
    • SIAM
    • K. Madduri, D.A. Bader, J.W. Berry, and J.R. Crobak An experimental study of a parallel shortest path algorithm for solving large-scale graph instances ALENEX 2007 SIAM
    • (2007) ALENEX
    • Madduri, K.1    Bader, D.A.2    Berry, J.W.3    Crobak, J.R.4
  • 21


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