A k-way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

A k-way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications

Abstract

Graph partitioning is used to solve the problem of distributing computations to a number of processors, in order to improve the performance of time consuming applications in parallel environments. A common approach to solve this problem is based on a multilevel framework, where the graph is firstly coarsened to a smaller instance and then it is partitioned in a number of parts using recursive bisection (RB) based methods. However, in applications where initial fixed vertices are used to model additional constraints of the problem, RB based methods often fail to produce partitions of good quality. In this paper, we propose a new direct k-way greedy graph growing algorithm, called KGGGP, that overcomes this issue and succeeds to produce partition with better quality than RB while respecting the constraint of fixed vertices. In the experimental section, we present results which compare KGGGP against state-of-the-art methods for graphs available from the popular DIMACS'10 collection.
Fichier principal
Vignette du fichier
conf15.pdf (258.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01277392 , version 1 (22-02-2016)

Identifiers

  • HAL Id : hal-01277392 , version 1

Cite

Maria Predari, Aurélien Esnard. A k-way Greedy Graph Partitioning with Initial Fixed Vertices for Parallel Applications. 24th Euromicro International Conference on Parallel, Distributed, and Network-Based Processing, Feb 2016, Heraklion, Greece. pp.8. ⟨hal-01277392⟩

Collections

CNRS INRIA INRIA2
373 View
1188 Download

Share

Gmail Facebook X LinkedIn More