Which Metrics for Vertex-Cut Partitioning?

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.
Type de document :
Communication dans un congrès
The 11th International Conference for Internet Technology and Secured Transactions (ICITST), Dec 2016, Barcelona, Spain
Liste complète des métadonnées

Littérature citée [14 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-01401309
Contributeur : Hlib Mykhailenko <>
Soumis le : mercredi 23 novembre 2016 - 10:27:59
Dernière modification le : jeudi 11 janvier 2018 - 16:57:54
Document(s) archivé(s) le : lundi 27 mars 2017 - 08:59:46

Fichier

pelga2016forHAL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01401309, version 1

Collections

Citation

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

Partager

Métriques

Consultations de la notice

313

Téléchargements de fichiers

127