Show simple item record

hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierParallel tools for Numerical Algorithms and Resolution of essentially Hyperbolic problems [BACCHUS]
dc.contributor.authorPELLEGRINI, François
dc.date.accessioned2024-04-15T09:47:50Z
dc.date.available2024-04-15T09:47:50Z
dc.date.issued2011-01-03
dc.identifier.issn1620-7742
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198130
dc.description.abstractEnGraph partitioning is a technique used for solving many problems in scientific computing, such as the decomposition of a mesh into domains so as to evenly balance the compute load on the processors of a parallel architecture. Because of the ever increasing size of the meshes to handle, partitioning tools themselves had to be parallelized. The parallel versions of these software provide good results for and on several thousands of processors, but the advent of architectures comprising more than a million processing elements raises new problems. Not only do the partitioning results produced by these software have to take into account the heterogeneity of these architectures, but also does the efficient execution of the partitioning software on these architectures require much more sophisticated algorithms. The purpose of this note is to present the challenges to overcome in order to reach these goals.
dc.language.isoen
dc.publisherElsevier
dc.subject.enComputer science
dc.subject.enParallel algorithms
dc.subject.enGraph partitioning
dc.subject.enParallel architecture
dc.titleCurrent challenges in parallel graph partitioning
dc.typeArticle de revue
dc.identifier.doi10.1016/j.crme.2010.11.004
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.journalComptes rendus de l’Académie des sciences. Série IIb, Mécanique
bordeaux.page90--95
bordeaux.volume339
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue2--3
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00564180
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00564180v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.title=Current%20challenges%20in%20parallel%20graph%20partitioning&rft.atitle=Current%20challenges%20in%20parallel%20graph%20partitioning&rft.jtitle=Comptes%20rendus%20de%20l%E2%80%99Acad%C3%A9mie%20des%20sciences.%20S%C3%A9rie%20IIb,%20M%C3%A9canique&rft.date=2011-01-03&rft.volume=339&rft.issue=2--3&rft.spage=90--95&rft.epage=90--95&rft.eissn=1620-7742&rft.issn=1620-7742&rft.au=PELLEGRINI,%20Fran%C3%A7ois&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record