A Distributed Multilevel Force-directed Algorithm

TL;DR

This paper introduces the first distributed multilevel force-directed graph layout algorithm implemented on Giraph, demonstrating scalability and efficiency for large graphs using cloud computing.

Contribution

It presents a novel distributed multilevel force-directed algorithm based on a vertex-centric paradigm, addressing scalability for very large graphs.

Findings

Successfully drew graphs with ten million edges in about 60 minutes

Demonstrated effectiveness and scalability on Amazon cloud services

First implementation of its kind on Giraph platform

Abstract

The wide availability of powerful and inexpensive cloud computing services naturally motivates the study of distributed graph layout algorithms, able to scale to very large graphs. Nowadays, to process Big Data, companies are increasingly relying on PaaS infrastructures rather than buying and maintaining complex and expensive hardware. So far, only a few examples of basic force-directed algorithms that work in a distributed environment have been described. Instead, the design of a distributed multilevel force-directed algorithm is a much more challenging task, not yet addressed. We present the first multilevel force-directed algorithm based on a distributed vertex-centric paradigm, and its implementation on Giraph, a popular platform for distributed graph algorithms. Experiments show the effectiveness and the scalability of the approach. Using an inexpensive cloud computing service of Amazon, we draw graphs with ten million edges in about 60 minutes.