Experimental Analysis of Distributed Graph Systems

06/21/2018
by   Khaled Ammar, et al.
0

This paper evaluates eight parallel graph processing systems: Hadoop, HaLoop, Vertica, Giraph, GraphLab (PowerGraph), Blogel, Flink Gelly, and GraphX (SPARK) over four very large datasets (Twitter, World Road Network, UK 200705, and ClueWeb) using four workloads (PageRank, WCC, SSSP and K-hop). The main objective is to perform an independent scale-out study by experimentally analyzing the performance, usability, and scalability (using up to 128 machines) of these systems. In addition to performance results, we discuss our experiences in using these systems and suggest some system tuning heuristics that lead to better performance.

READ FULL TEXT

page 9

page 10

page 11

research
04/06/2017

A Comparison of Parallel Graph Processing Implementations

The rapidly growing number of large network analysis problems has led to...
research
11/17/2020

TurboGraph++: A Scalable and Fast Graph Analytics System

Existing distributed graph analytics systems are categorized into two ma...
research
08/12/2016

Measuring the State of the Art of Automated Pathway Curation Using Graph Algorithms - A Case Study of the mTOR Pathway

This paper evaluates the difference between human pathway curation and c...
research
01/04/2023

COST of Graph Processing Using Actors

Graph processing is an increasingly important domain of computer science...
research
03/02/2020

Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System

Graph is a ubiquitous structure in many domains. The rapidly increasing ...
research
05/08/2021

Kudu: An Efficient and Scalable Distributed Graph Pattern Mining Engine

This paper proposes Kudu, a general distributed execution engine with a ...
research
04/11/2021

GraphGuess: Approximate Graph Processing System with Adaptive Correction

Graph-based data structures have drawn great attention in recent years. ...

Please sign up or login with your details

Forgot password? Click here to reset