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.
Complete list of metadatas

Cited literature [9 references]  Display  Hide  Download

https://hal.inria.fr/hal-01446677
Contributor : Hlib Mykhailenko <>
Submitted on : Wednesday, February 1, 2017 - 4:43:53 PM
Last modification on : Thursday, November 14, 2019 - 5:38:06 PM

File

RR-9019.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01446677, version 2

Collections

Citation

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

Share

Metrics

Record views

239

Files downloads

533