BLADYG: A Graph Processing Framework for Large Dynamic Graphs

Sabeur Aridhi 1 Alberto Montresor 2 Yannis Velegrakis 2
1 CAPSID - Computational Algorithms for Protein Structures and Interactions
Inria Nancy - Grand Est, LORIA - AIS - Department of Complex Systems, Artificial Intelligence & Robotics
Abstract : Recently, distributed processing of large dynamic graphs has become very popular , especially in certain domains such as social network analysis, Web graph analysis and spatial network analysis. In this context, many distributed/parallel graph processing systems have been proposed, such as Pregel, PowerGraph, GraphLab, and Trinity. However, these systems deal only with static graphs and do not consider the issue of processing evolving and dynamic graphs. In this paper, we are considering the issues of scale and dynamism in the case of graph processing systems. We present BLADYG, a graph processing framework that addresses the issue of dynamism in large-scale graphs. We present an implementation of BLADYG on top of akka framework. We experimentally evaluate the performance of the proposed framework by applying it to problems such as distributed k-core decomposition and partitioning of large dynamic graphs. The experimental results show that the performance and scalability of BLADYG are satisfying for large-scale dynamic graphs.
Complete list of metadatas

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-01577882
Contributor : Sabeur Aridhi <>
Submitted on : Monday, August 28, 2017 - 12:40:20 PM
Last modification on : Tuesday, December 18, 2018 - 4:40:22 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Sabeur Aridhi, Alberto Montresor, Yannis Velegrakis. BLADYG: A Graph Processing Framework for Large Dynamic Graphs. Big Data Research, Elsevier, 2017, ⟨10.1016/j.bdr.2017.05.003⟩. ⟨hal-01577882⟩

Share

Metrics

Record views

248

Files downloads

385