文件名称：SIGMOD10_pregel Pregel a system for large sclae graph processing
文件大小：474KB
文件格式：PDF
更新时间：2014-03-24 11:01:10
google graph processing
google的大规模图形处理引擎 Pregel的论文 In this paper we present a computational model suitable for this task. Programs are expressed as a sequence of iterations, in each of which a vertex can receive messages sent in the previous iteration, send messages to other vertices, and modify its own state and that of its outgoing edges or mutate graph topology. This vertexcentric approach is exible enough to express a broad set of algorithms. The model has been designed for ecient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier. Distributionrelated details are hidden behind an abstract API. The result is a framework for processing large graphs that is expressive and easy to program.