메뉴 건너뛰기




Volumn , Issue , 2010, Pages 135-145

Pregel: A system for large-scale graph processing

Author keywords

distributed computing; graph algorigthms

Indexed keywords

COMPUTATIONAL MODEL; DISTRIBUTED COMPUTING; FAULT-TOLERANT; GRAPH PROCESSING; GRAPH TOPOLOGY; LARGE GRAPHS; PRACTICAL COMPUTING; SOCIAL NETWORKS; WEB GRAPHS;

EID: 77954723629     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807167.1807184     Document Type: Conference Paper
Times cited : (3168)

References (47)
  • 1
    • 0027694638 scopus 로고
    • High-Speed Switch Scheduling for Local-Area Networks
    • Thomas Anderson, Susan Owicki, James Saxe, and Charles Thacker, High-Speed Switch Scheduling for Local-Area Networks. ACM Trans. Comp. Syst. 11(4), 1993, 319-352.
    • (1993) ACM Trans. Comp. Syst. , vol.11 , Issue.4 , pp. 319-352
    • Anderson, T.1    Owicki, S.2    Saxe, J.3    Thacker, C.4
  • 3
    • 0037619265 scopus 로고    scopus 로고
    • Web search for a planet: The Google Cluster Architecture
    • Luiz Barroso, Jeffrey Dean, and Urs Hoelzle, Web search for a planet: The Google Cluster Architecture. IEEE Micro 23(2), 2003, 22-28.
    • (2003) IEEE Micro , vol.23 , Issue.2 , pp. 22-28
    • Barroso, L.1    Dean, J.2    Hoelzle, U.3
  • 8
    • 14744296887 scopus 로고    scopus 로고
    • CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines
    • Albert Chan and Frank Dehne, CGMGRAPH/CGMLIB: Implementing and Testing CGM Graph Algorithms on PC Clusters and Shared Memory Machines. Intl. J. of High Performance Computing Applications 19(1), 2005, 81-97.
    • (2005) Intl. J. of High Performance Computing Applications , vol.19 , Issue.1 , pp. 81-97
    • Chan, A.1    Dehne, F.2
  • 10
    • 0000371861 scopus 로고    scopus 로고
    • Shortest paths algorithms: Theory and experimental evaluation
    • Boris V. Cherkassky, Andrew V. Goldberg, and Tomasz Radzik, Shortest paths algorithms: Theory and experimental evaluation. Mathematical Programming 73, 1996, 129-174.
    • (1996) Mathematical Programming , vol.73 , pp. 129-174
    • Cherkassky, B.V.1    Goldberg, A.V.2    Radzik, T.3
  • 11
    • 67651111624 scopus 로고    scopus 로고
    • Graph Twiddling in a MapReduce World
    • July/August
    • Jonathan Cohen, Graph Twiddling in a MapReduce World. Comp. in Science & Engineering, July/August 2009, 29-41.
    • (2009) Comp. in Science & Engineering , pp. 29-41
    • Cohen, J.1
  • 13
    • 28044460018 scopus 로고    scopus 로고
    • A higher order estimate of the optimum checkpoint interval for restart dumps
    • John T. Daly, A higher order estimate of the optimum checkpoint interval for restart dumps. Future Generation Computer Systems 22, 2006, 303-312.
    • (2006) Future Generation Computer Systems , vol.22 , pp. 303-312
    • Daly, J.T.1
  • 15
    • 34147120474 scopus 로고
    • A Note on Two Problems in Connexion with Graphs
    • Edsger W. Dijkstra, A Note on Two Problems in Connexion with Graphs. Numerische Mathematik 1, 1959, 269-271.
    • (1959) Numerische Mathematik , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 16
    • 0035647171 scopus 로고    scopus 로고
    • Inductive Graphs and Functional Graph Algorithms
    • Martin Erwig, Inductive Graphs and Functional Graph Algorithms. J. Functional Programming 1(5), 2001, 467-492.
    • (2001) J. Functional Programming , vol.1 , Issue.5 , pp. 467-492
    • Erwig, M.1
  • 21
    • 0032592916 scopus 로고    scopus 로고
    • Portable and Efficient Parallel Computing Using the BSP Model
    • Mark W. Goudreau, Kevin Lang, Satish B. Rao, Torsten Suel, and Thanasis Tsantilas, Portable and Efficient Parallel Computing Using the BSP Model. IEEE Trans. Comp. 48(7), 1999, 670-689.
    • (1999) IEEE Trans. Comp. , vol.48 , Issue.7 , pp. 670-689
    • Goudreau, M.W.1    Lang, K.2    Rao, S.B.3    Suel, T.4    Tsantilas, T.5
  • 34
    • 24344488448 scopus 로고    scopus 로고
    • A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors
    • Grzegorz Malewicz, A Work-Optimal Deterministic Algorithm for the Certified Write-All Problem with a Nontrivial Number of Asynchronous Processors. SIAM J. Comput. 34(4), 2005, 993-1024.
    • (2005) SIAM J. Comput. , vol.34 , Issue.4 , pp. 993-1024
    • Malewicz, G.1
  • 37
    • 0242583646 scopus 로고    scopus 로고
    • Δ-stepping: A Parallelizable Shortest Path Algorithm
    • Ulrich Meyer and Peter Sanders, Δ-stepping: A Parallelizable Shortest Path Algorithm. J. Algorithms 49(1), 2003, 114-152.
    • (2003) J. Algorithms , vol.49 , Issue.1 , pp. 114-152
    • Meyer, U.1    Sanders, P.2
  • 41
    • 30344452311 scopus 로고    scopus 로고
    • Interpreting the Data: Parallel Analysis with Sawzall
    • Special Issue on Grids and Worldwide Computing Programming Models and Infrastructure
    • Rob Pike, Sean Dorward, Robert Griesemer, and Sean Quinlan, Interpreting the Data: Parallel Analysis with Sawzall. Scientific Programming Journal 13(4), Special Issue on Grids and Worldwide Computing Programming Models and Infrastructure, 2005, 227-298.
    • (2005) Scientific Programming Journal , vol.13 , Issue.4 , pp. 227-298
    • Pike, R.1    Dorward, S.2    Griesemer, R.3    Quinlan, S.4
  • 44
    • 0000778521 scopus 로고    scopus 로고
    • Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time
    • May
    • Mikkel Thorup, Undirected Single-Source Shortest Paths with Positive Integer Weights in Linear Time. J. ACM 46(3), May 1999, 362-394.
    • (1999) J. ACM , vol.46 , Issue.3 , pp. 362-394
    • Thorup, M.1
  • 45
    • 0025467711 scopus 로고
    • A Bridging Model for Parallel Computation
    • Leslie G. Valiant, A Bridging Model for Parallel Computation. Comm. ACM 33(8), 1990, 103-111.
    • (1990) Comm. ACM , vol.33 , Issue.8 , pp. 103-111
    • Valiant, L.G.1


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