BigGraphs: distributed graph computing

Luc Hogie 1, 2, 3 Michel Syska 2 Nicolas Chleq 4
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, CRISAM - Inria Sophia Antipolis - Méditerranée
3 AOSTE - Models and methods of analysis and optimization for systems with real-time and embedding constraints
CRISAM - Inria Sophia Antipolis - Méditerranée , COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués, Inria de Paris
Abstract : The objective of BigGraphs is to provide a distributed middleware for very large graphs processing. The first phase of the project consists in the evaluation of the existing middlewares such as GraphX/Spark or Giraph/Hadoop with respect to the following criteria: ease of deployment, maintenance and use, variety of programming models (Map/Reduce, BSP, (a)synchronous message passing, centralized programming, mobile agent-based, etc.), overall efficiency and memory footprint, etc. One of the chosen use cases is a subgraph of the Twitter graph with 3 millions of nodes and 200 millions of edges. The experiments are run on the NEF cluster at Inria. We have implemented and tested the classic algorithms (using the BSP model): page rank, BFS, connected components as well as the iFUB algorithm for computing the diameter of large graphs.
Type de document :
France, Patent n° : IDDN.FR.001.410005.000.S.P.2015.000.31235. 2016
Contributeur : Luc Hogie <>
Soumis le : mardi 6 septembre 2016 - 11:12:26
Dernière modification le : mardi 17 janvier 2017 - 10:24:43


  • HAL Id : hal-01360649, version 1



Luc Hogie, Michel Syska, Nicolas Chleq. BigGraphs: distributed graph computing. France, Patent n° : IDDN.FR.001.410005.000.S.P.2015.000.31235. 2016. <hal-01360649>



Consultations de la notice