Which Metrics for Vertex-Cut Partitioning? - Archive ouverte HAL Access content directly
Conference Papers Year :

Which Metrics for Vertex-Cut Partitioning?

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

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.
Fichier principal
Vignette du fichier
pelga2016forHAL.pdf (325.86 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01401309 , version 1 (23-11-2016)

Identifiers

  • HAL Id : hal-01401309 , version 1

Cite

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⟩
222 View
529 Download

Share

Gmail Facebook Twitter LinkedIn More