메뉴 건너뛰기




Volumn 8, Issue 4, 2014, Pages 437-448

Fast failure recovery in distributed graph processing systems

Author keywords

[No Author keywords available]

Indexed keywords

BIG DATA; GRAPH THEORY; GRAPHIC METHODS;

EID: 84938782665     PISSN: None     EISSN: 21508097     Source Type: Journal    
DOI: 10.14778/2735496.2735506     Document Type: Conference Paper
Times cited : (38)

References (26)
  • 1
    • 85199303965 scopus 로고    scopus 로고
    • http://giraph.apache.org/.
  • 2
    • 85199255580 scopus 로고    scopus 로고
    • https://hama.apache.org/.
  • 3
    • 33847103633 scopus 로고    scopus 로고
    • Multilevel algorithms for partitioningpower-law graphs
    • A. Abou-Rjeili and G. Karypis. Multilevel algorithms for partitioningpower-law graphs. In IPDPS, pages 124-124, 2006.
    • (2006) IPDPS , pp. 124-124
    • Abou-Rjeili, A.1    Karypis, G.2
  • 4
    • 84901777009 scopus 로고    scopus 로고
    • Blazes:Coordination analysis for distributed programs
    • P. Alvaro, N. Conway, J. M. Hellerstein, and D. Maier. Blazes:Coordination analysis for distributed programs. In ICDE, pages52-63, 2014.
    • (2014) ICDE , pp. 52-63
    • Alvaro, P.1    Conway, N.2    Hellerstein, J.M.3    Maier, D.4
  • 5
    • 2442596811 scopus 로고
    • A nonstop kernel
    • J. F. Bartlett. A nonstop kernel. In SOSP, pages 22-19, 1981.
    • (1981) SOSP , pp. 19-22
    • Bartlett, J.F.1
  • 6
    • 84976683217 scopus 로고
    • A message system supportingfault tolerance
    • A. Borg, J. Baumbach, and S. Glazer. A message system supportingfault tolerance. In SOSP, pages 90-99, 1983.
    • (1983) SOSP , pp. 90-99
    • Borg, A.1    Baumbach, J.2    Glazer, S.3
  • 8
    • 84938769469 scopus 로고    scopus 로고
    • Location andreplication independent recovery in a highly available database
    • S. E. Bratsberg, S.-O. Hvasshovd, and O. Torbjørnsen. Location andreplication independent recovery in a highly available database. In BNCOD, pages 23-37, 1997.
    • (1997) BNCOD , pp. 23-37
    • Bratsberg, S.E.1    Hvasshovd, S.-O.2    Torbjørnsen, O.3
  • 10
    • 85072980230 scopus 로고    scopus 로고
    • Powergraph: Distributed graph-parallel computation on naturalgraphs
    • J. E. Gonzalez, Y. Low, H. Gu, D. Bickson, and C. Guestrin.Powergraph: Distributed graph-parallel computation on naturalgraphs. In OSDI, pages 17-30, 2012.
    • (2012) OSDI , pp. 17-30
    • Gonzalez, J.E.1    Low, Y.2    Gu, H.3    Bickson, D.4    Guestrin, C.5
  • 11
    • 0028401457 scopus 로고
    • The communication challenge for mpp: Intelparagon and meiko cs-2
    • R. W. Hockney. The communication challenge for mpp: Intelparagon and meiko cs-2. In Parallel Computing, pages 389-398,1994.
    • (1994) Parallel Computing , pp. 389-398
    • Hockney, R.W.1
  • 12
    • 84896835469 scopus 로고    scopus 로고
    • epic: anextensible and scalable system for processing big data
    • D. Jiang, G. Chen, B. C. Ooi, K.-L. Tan, and S. Wu. epic: anextensible and scalable system for processing big data. In PVLDB, pages 541-552, 2014.
    • (2014) PVLDB , pp. 541-552
    • Jiang, D.1    Chen, G.2    Ooi, B.C.3    Tan, K.-L.4    Wu, S.5
  • 14
    • 84877705020 scopus 로고    scopus 로고
    • Mizan: a system for dynamic load balancing in large-scalegraph processing
    • Z. Khayyat, K. Awara, A. Alonazi, H. Jamjoom, D. Williams, andP. Kalnis. Mizan: a system for dynamic load balancing in large-scalegraph processing. In EuroSys, pages 169-182, 2013.
    • (2013) EuroSys , pp. 169-182
    • Khayyat, Z.1    Awara, K.2    Alonazi, A.3    Jamjoom, H.4    Williams, D.5    Kalnis, P.6
  • 15
    • 84884896252 scopus 로고    scopus 로고
    • Multi-threaded graph partitioning
    • D. LaSalle and G. Karypis. Multi-threaded graph partitioning. InIPDPS, pages 225-236, 2013.
    • (2013) IPDPS , pp. 225-236
    • LaSalle, D.1    Karypis, G.2
  • 16
    • 84887530145 scopus 로고    scopus 로고
    • Distributed datamanagement using mapreduce
    • F. Li, B. C. Ooi, M. T. Özsu, and S. Wu. Distributed datamanagement using mapreduce. ACM Comput. Surv.,46(3):31:1-31:42, 2014.
    • (2014) ACM Comput. Surv , vol.46 , Issue.3 , pp. 31.1-31.42
    • Li, F.1    Ooi, B.C.2    Özsu, T.M.3    Wu, S.4
  • 19
    • 84873205384 scopus 로고    scopus 로고
    • Efficient processing of knearest neighbor joins using mapreduce
    • W. Lu, Y. Shen, S. Chen, and B. C. Ooi. Efficient processing of knearest neighbor joins using mapreduce. In PVLDB, pages1016-1027, 2012.
    • (2012) PVLDB , pp. 1016-1027
    • Lu, W.1    Shen, Y.2    Chen, S.3    Ooi, B.C.4
  • 22
    • 84904290510 scopus 로고    scopus 로고
    • Gps: a graph processing system
    • S. Salihoglu and J. Widom. Gps: a graph processing system. InSSDBM, pages 22:1-22:12, 2013.
    • (2013) SSDBM , pp. 22.1-22.12
    • Salihoglu, S.1    Widom, J.2
  • 23
    • 0036505103 scopus 로고    scopus 로고
    • Parallel static and dynamicmulti-constraint graph partitioning
    • K. Schloegel, G. Karypis, and V. Kumar. Parallel static and dynamicmulti-constraint graph partitioning. In CCPE, pages 219-240, 2002.
    • (2002) CCPE , pp. 219-240
    • Schloegel, K.1    Karypis, G.2    Kumar, V.3
  • 24
    • 84880550300 scopus 로고    scopus 로고
    • Trinity: A distributed graph engine on amemory cloud
    • B. Shao, H. Wang, and Y. Li. Trinity: A distributed graph engine on amemory cloud. In SIGMOD, pages 505-516, 2013.
    • (2013) SIGMOD , pp. 505-516
    • Shao, B.1    Wang, H.2    Li, Y.3
  • 25
    • 0025467711 scopus 로고
    • A bridging model for parallel computation
    • L. G. Valiant. A bridging model for parallel computation. InCommun. ACM, pages 103-111, 1990.
    • (1990) Commun. ACM , pp. 103-111
    • Valiant, L.G.1
  • 26
    • 84880566945 scopus 로고    scopus 로고
    • Graphx: aresilient distributed graph system on spark
    • R. S. Xin, J. E. Gonzalez, M. J. Franklin, and I. Stoica. Graphx: aresilient distributed graph system on spark. In GRADES, pages2:1-2:6, 2013.
    • (2013) GRADES , pp. 2.1-2.6
    • Xin, R.S.1    Gonzalez, J.E.2    Franklin, M.J.3    Stoica, I.4


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