Comparison of Edge Partitioners for Graph Processing - Archive ouverte HAL Access content directly
Conference Papers Year :

Comparison of Edge Partitioners for Graph Processing

(1) , (2) , (1)
1
2

Abstract

Deploying graph on a cluster requires its partitioning into a number of subgraphs, and assigning them to different machines. Two partitioning approaches have been proposed: vertex partitioning and edge partitioning. In the edge partitioning approach edges are allocated to partitions. Recent studies show that, for power-law graphs, edge partitioning is more effective than vertex partitioning. In this paper we provide an overview of existing edge partitioning algorithms. However, based only on published work, we cannot draw a clear conclusion about the relative performances of these partitioners. For this reason, we compare all the edge partition-ers currently available for GraphX. Our preliminary results suggest that Hybrid-Cut partitioner provides the best performance.
Fichier principal
Vignette du fichier
surveyHAL.pdf (332.66 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01401338 , version 1 (23-11-2016)

Identifiers

  • HAL Id : hal-01401338 , version 1

Cite

Hlib Mykhailenko, Fabrice Huet, Giovanni Neglia. Comparison of Edge Partitioners for Graph Processing. CSCI 2016 - International Conference on Computational Science and Computational Intelligence, Dec 2016, Las Vegas, United States. ⟨hal-01401338⟩
162 View
406 Download

Share

Gmail Facebook Twitter LinkedIn More