))
Pregel: A System for Large-Scale Graph Processing
Manage episode 487366642 series 3670304
The Binary Breakdown에서 제공하는 콘텐츠입니다. 에피소드, 그래픽, 팟캐스트 설명을 포함한 모든 팟캐스트 콘텐츠는 The Binary Breakdown 또는 해당 팟캐스트 플랫폼 파트너가 직접 업로드하고 제공합니다. 누군가가 귀하의 허락 없이 귀하의 저작물을 사용하고 있다고 생각되는 경우 여기에 설명된 절차를 따르실 수 있습니다 https://ko.player.fm/legal.
The article is a paper published in 2010 by researchers at Google that introduces Pregel, a large-scale graph processing system. Pregel is designed for processing graphs with billions of vertices and trillions of edges, and it uses a vertex-centric approach where vertices are assigned to individual machines and communicate with each other through message passing. The paper details the model of computation, the C++ API, and the implementation of Pregel, including fault-tolerance mechanisms for dealing with machine failures. It also explores applications of Pregel to various graph algorithms, including PageRank, shortest paths, bipartite matching, and semi-clustering, providing experimental results for shortest paths on graphs ranging in size from 10 million to 1 billion vertices. Finally, the paper discusses related work and future directions for Pregel, highlighting its strengths and potential areas for improvement.
https://15799.courses.cs.cmu.edu/fall2013/static/papers/p135-malewicz.pdf
44 에피소드
공유
