Simulated Annealing for Edge Partitioning - Archive ouverte HAL Access content directly
Conference Papers Year :

Simulated Annealing for Edge Partitioning

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

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.
Not file

Dates and versions

hal-01668207 , version 1 (19-12-2017)

Identifiers

  • HAL Id : hal-01668207 , version 1

Cite

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⟩
110 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More