Skip to Main content Skip to Navigation
Conference papers

Which Metrics for Vertex-Cut Partitioning?

Hlib Mykhailenko 1 Giovanni Neglia 1 Fabrice Huet 2
1 MAESTRO - Models for the performance analysis and the control of networks
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 this paper we focus on vertex-cut graph partitioning and we investigate how it is possible to evaluate the quality of a partition before running the computation. To this purpose we scrutinize a set of metrics proposed in literature. We carry experiments with the widely-used framework for graph processing Apache GraphX and we perform an accurate statistical analysis. Our preliminary experimental results show that communication metrics like vertex-cut and communication cost are effective predictors on most of the cases.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Hlib Mykhailenko Connect in order to contact the contributor
Submitted on : Wednesday, November 23, 2016 - 10:27:59 AM
Last modification on : Tuesday, December 7, 2021 - 4:10:56 PM
Long-term archiving on: : Monday, March 27, 2017 - 8:59:46 AM


Files produced by the author(s)


  • HAL Id : hal-01401309, version 1



Hlib Mykhailenko, Giovanni Neglia, Fabrice Huet. Which Metrics for Vertex-Cut Partitioning?. ICITST 2016 - The 11th International Conference for Internet Technology and Secured Transactions, Dec 2016, Barcelona, Spain. ⟨hal-01401309⟩



Les métriques sont temporairement indisponibles