Mostrar el registro sencillo del ítem

PT-Scotch: A tool for efficient parallel graph ordering

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithms and high performance computing for grand challenge applications [SCALAPPLIX]
dc.contributor.authorCHEVALIER, Cédric
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithms and high performance computing for grand challenge applications [SCALAPPLIX]
dc.contributor.authorPELLEGRINI, François
dc.date.accessioned2024-04-15T09:51:22Z
dc.date.available2024-04-15T09:51:22Z
dc.date.created2007-01-16
dc.date.issued2008-07-01
dc.identifier.issn0167-8191
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198425
dc.description.abstractEnThe parallel ordering of large graphs is a difficult problem, because on the one hand minimum degree algorithms do not parallelize well, and on the other hand the obtainment of high quality orderings with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations of which are also hard to parallelize. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is only slightly worse than the one of state-of-the-art sequential algorithms. Our implementation uses the classical nested dissection approach but relies on several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements, PT-Scotch produces consistently better orderings than ParMeTiS on large numbers of processors.
dc.description.sponsorshipSOLveurs et SimulaTIons en Calculs Extrême - ANR-06-CIS6-0010
dc.language.isoen
dc.publisherElsevier
dc.subject.enParallel graph ordering
dc.subject.enNested dissection
dc.subject.enDistributed memory computer
dc.subject.enMulti-threading
dc.title.enPT-Scotch: A tool for efficient parallel graph ordering
dc.typeArticle de revue
dc.identifier.doi10.1016/j.parco.2007.12.001
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
dc.identifier.arxiv0907.1375
bordeaux.journalParallel Computing
bordeaux.page318-331
bordeaux.volume34
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue6-8
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00402893
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00402893v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Parallel%20Computing&rft.date=2008-07-01&rft.volume=34&rft.issue=6-8&rft.spage=318-331&rft.epage=318-331&rft.eissn=0167-8191&rft.issn=0167-8191&rft.au=CHEVALIER,%20C%C3%A9dric&PELLEGRINI,%20Fran%C3%A7ois&rft.genre=article


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem