Simulated Annealing for Edge Partitioning

Abstract : In distributed graph computation, graph partitioning is an important preliminary step, because the computation time can significantly depend on how the graph has been split among the different executors. In this paper, we propose a framework for distributed edge partitioning based on simulated annealing. The framework can be used to optimize a large family of partitioning metrics. We provide sufficient conditions for convergence to the optimum as well as discuss which metrics can be efficiently optimized in a distributed way. We implemented our partitioners in Apache GraphX and performed a preliminary comparison with JA-BE-JA-VC , a state-of-the-art partitioner that inspired our approach. We show that our approach can provide improvements, but further research is required to identify suitable metrics to optimize as well as to design a more efficient exploration phase for our algorithm without sacrificing convergence properties.
Type de document :
[Research Report] RR-9019, Inria Sophia Antipolis. 2017
Liste complète des métadonnées

Littérature citée [9 références]  Voir  Masquer  Télécharger
Contributeur : Hlib Mykhailenko <>
Soumis le : mercredi 1 février 2017 - 16:43:53
Dernière modification le : lundi 30 avril 2018 - 14:30:10


Fichiers produits par l'(les) auteur(s)


  • HAL Id : hal-01446677, version 2


Hlib Mykhailenko, Giovanni Neglia, Fabrice Huet. Simulated Annealing for Edge Partitioning. [Research Report] RR-9019, Inria Sophia Antipolis. 2017. 〈hal-01446677v2〉



Consultations de la notice


Téléchargements de fichiers