Pregel: a system for large-scale graph processing. Many practical computing problems concern large graphs. Standard examples include the Web graph and various social networks. The scale of these graphs - in some cases billions of vertices, trillions of edges - poses challenges to their efficient processing. 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 vertex-centric approach is flexible enough to express a broad set of algorithms. The model has been designed for efficient, scalable and fault-tolerant implementation on clusters of thousands of commodity computers, and its implied synchronicity makes reasoning about programs easier. Distribution-related details are hidden behind an abstract API. The result is a framework for processing large graphs that is expressive and easy to program.

This software is also peer reviewed by journal TOMS.

References in zbMATH (referenced in 41 articles )

Showing results 1 to 20 of 41.
Sorted by year (citations)

1 2 3 next

  1. Chen, Hailiang; Chen, Bin; Ai, Chuan; Zhu, Mengna; Qiu, Xiaogang: The evolving network model with community size and distance preferences (2022)
  2. Iwasaki, Hideya; Emoto, Kento; Morihata, Akimasa; Matsuzaki, Kiminori; Hu, Zhenjiang: Fregel: a functional domain-specific language for vertex-centric large-scale graph processing (2022)
  3. Yang, Carl; Buluç, Aydın; Owens, John D.: GraphBLAST: a high-performance linear algebra-based graph framework on the GPU (2022)
  4. Becker, Florent; Montealegre, Pedro; Rapaport, Ivan; Todinca, Ioan: The role of randomness in the broadcast congested clique model (2021)
  5. Luo, Qi; Yu, Dongxiao; Li, Feng; Cheng, Xiuzheng; Cai, Zhipeng; Yu, Jiguo: Distributed core decomposition in probabilistic graphs (2021)
  6. Ramon-Cortes, Cristian; Alvarez, Pol; Lordan, Francesc; Alvarez, Javier; Ejarque, Jorge; Badia, Rosa M.: A survey on the distributed computing stack (2021)
  7. Becchetti, Luca; Clementi, Andrea E.; Natale, Emanuele; Pasquale, Francesco; Trevisan, Luca: Find your place: simple distributed algorithms for community detection (2020)
  8. Li, Qi; Zhong, Jiang; Cao, Zehong; Li, Xue: Optimizing streaming graph partitioning via a heuristic greedy method and caching strategy (2020)
  9. Montealegre, P.; Perez-Salazar, S.; Rapaport, I.; Todinca, I.: Graph reconstruction in the congested clique (2020)
  10. Alsinet, Teresa; Argelich, Josep; Béjar, Ramón; Cemeli, Joel: A distributed argumentation algorithm for mining consistent opinions in weighted Twitter discussions (2019)
  11. Aydin, Kevin; Bateni, Mohammadhossein; Mirrokni, Vahab: Distributed balanced partitioning via linear embedding (2019)
  12. Brandt, Sebastian; Wattenhofer, Roger: Approximating small balanced vertex separators in almost linear time (2019)
  13. Das, Ariyam; Zaniolo, Carlo: A case for stale synchronous distributed model for declarative recursive computation (2019)
  14. Joana M. F. da Trindade, Konstantinos Karanasos, Carlo Curino, Samuel Madden, Julian Shun: Kaskade: Graph Views for Efficient Graph Analytics (2019) arXiv
  15. Marquer, Yoann; Gava, Frédéric: Axiomatization and characterization of BSP algorithms (2019)
  16. Arleo, Alessio; Didimo, Walter; Liotta, Giuseppe; Montecchiani, Fabrizio: GiVip: a visual profiler for distributed graph processing systems (2018)
  17. Fan, Wenfei; Yu, Wenyuan; Xu, Jingbo; Zhou, Jingren; Luo, Xiaojian; Yin, Qiang; Lu, Ping; Cao, Yang; Xu, Ruiqi: Parallelizing sequential graph computations (2018)
  18. Mallmann-Trenn, Frederik; Musco, Cameron; Musco, Christopher: Eigenvector computation and community detection in asynchronous gossip models (2018)
  19. R. Brisaboa, Nieves; Caro, Diego; Fariña, Antonio; Andrea Rodriguez, M.: Using compressed suffix-arrays for a compact representation of temporal-graphs (2018)
  20. Wang, Hongzhi; Li, Ning; Li, Jianzhong; Gao, Hong: Parallel algorithms for flexible pattern matching on big graphs (2018)

1 2 3 next