Distributed Graph Layout with Spark

Abstract : This paper presents a novel way to draw very large graphs, especially those too big to fit the memory of a single computer. This new method takes advantage of the recent progress in distributed computing, notably using the Apache MapReduce library called Spark. Our implementation of a force-directed graph drawing algorithm and the way to compute repulsive forces in MapReduce are exhibited. We demonstrate the horizontal scalability of this algorithm and show layouts computed on a Hadoop cluster with our method.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01187421
Contributor : Antoine Hinge <>
Submitted on : Wednesday, August 26, 2015 - 4:46:35 PM
Last modification on : Thursday, January 11, 2018 - 6:20:17 AM
Long-term archiving on : Friday, November 27, 2015 - 11:03:32 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01187421, version 1

Citation

Antoine Hinge, David Auber. Distributed Graph Layout with Spark. Information Visualisation (iV), 2015 19th International Conference on, Jul 2015, Barcelone, Spain. pp.271--276. ⟨hal-01187421⟩

Share

Metrics

Record views

354

Files downloads

1096