Simulated Annealing for Edge Partitioning

Giovanni Neglia 1 Hlib Mykhailenko 1 Fabrice Huet 2
1 NEO - Network Engineering and Operations
CRISAM - Inria Sophia Antipolis - Méditerranée
2 SCALE - Safe Composition of Autonomous applications with Large-SCALE Execution environment
Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
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.
Liste complète des métadonnées

https://hal.inria.fr/hal-01668207
Contributor : Giovanni Neglia <>
Submitted on : Tuesday, December 19, 2017 - 8:23:44 PM
Last modification on : Thursday, March 7, 2019 - 4:11:07 PM

Identifiers

  • HAL Id : hal-01668207, version 1

Collections

Citation

Giovanni Neglia, Hlib Mykhailenko, Fabrice Huet. Simulated Annealing for Edge Partitioning. Computer Communications Workshops (INFOCOM WKSHPS), 2017 IEEE Conference on, May 2017, Atlanta, United States. 〈hal-01668207〉

Share

Metrics

Record views

156