))
Pregel: A System for Large-Scale Graph Processing
Manage episode 487366642 series 3670304
A tartalmat a The Binary Breakdown biztosítja. Az összes podcast-tartalmat, beleértve az epizódokat, grafikákat és podcast-leírásokat, közvetlenül a The Binary Breakdown vagy a podcast platform partnere tölti fel és biztosítja. Ha úgy gondolja, hogy valaki az Ön engedélye nélkül használja fel a szerzői joggal védett művét, kövesse az itt leírt folyamatot https://hu.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 epizódok
Megosztás
