Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-Level Framework
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
dc.contributor.author | CHEVALIER, Cédric | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Algorithms and high performance computing for grand challenge applications [SCALAPPLIX] | |
dc.contributor.author | PELLEGRINI, François | |
dc.date.accessioned | 2024-04-15T09:51:21Z | |
dc.date.available | 2024-04-15T09:51:21Z | |
dc.date.created | 2006-08 | |
dc.date.issued | 2006-11-01 | |
dc.date.conference | 2006-08-30 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198424 | |
dc.description.abstractEn | Parallel graph partitioning is a difficult issue, because the best sequential graph partitioning methods known to date are based on iterative local optimization algorithms that do not parallelize nor scale well. On the other hand, evolutionary algorithms are highly parallel and scalable, but converge very slowly as problem size increases. This paper presents methods that can be used to reduce problem space in a dramatic way when using graph partitioning techniques in a multi-level framework, thus enabling the use of evolutionary algorithms as possible candidates, among others, for the realization of efficient scalable parallel graph partitioning tools. Results obtained on the recursive bipartitioning problem with a multi-threaded genetic algorithm are presented, which show that this approach outperforms existing state-of-the-art parallel partitioners. | |
dc.description.sponsorship | SOLveurs et SimulaTIons en Calculs Extrême - ANR-06-CIS6-0010 | |
dc.language.iso | en | |
dc.publisher | Springer | |
dc.source.title | Euro-Par 2006 Parallel Processing | |
dc.title.en | Improvement of the Efficiency of Genetic Algorithms for Scalable Parallel Graph Partitioning in a Multi-Level Framework | |
dc.type | Communication dans un congrès | |
dc.identifier.doi | 10.1007/11823285 | |
dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
bordeaux.page | 243-252 | |
bordeaux.volume | 4128 | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.conference.title | Euro-Par | |
bordeaux.country | DE | |
bordeaux.title.proceeding | Euro-Par 2006 Parallel Processing | |
bordeaux.conference.city | Dresden | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-00402946 | |
hal.version | 1 | |
hal.invited | non | |
hal.proceedings | oui | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00402946v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Euro-Par%202006%20Parallel%20Processing&rft.date=2006-11-01&rft.volume=4128&rft.spage=243-252&rft.epage=243-252&rft.au=CHEVALIER,%20C%C3%A9dric&PELLEGRINI,%20Fran%C3%A7ois&rft.genre=unknown |
Fichier(s) constituant ce document
Fichiers | Taille | Format | Vue |
---|---|---|---|
Il n'y a pas de fichiers associés à ce document. |