Mostrar el registro sencillo del ítem

An Efficient OpenMP Runtime System for Hierarchical Architectures

hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorTHIBAULT, Samuel
hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorBROQUEDIS, François
hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorGOGLIN, Brice
hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorNAMYST, Raymond
hal.structure.identifierEfficient runtime systems for parallel architectures [RUNTIME]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorWACRENIER, Pierre-André
dc.date.accessioned2024-04-15T09:56:40Z
dc.date.available2024-04-15T09:56:40Z
dc.date.issued2007
dc.date.conference2007-06-04
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198855
dc.description.abstractEnExploiting the full computational power of always deeper hierarchical multiprocessor machines requires a very careful distribution of threads and data among the underlying non-uniform architecture. The emergence of multi-core chips and NUMA machines makes it important to minimize the number of remote memory accesses, to favor cache affinities, and to guarantee fast completion of synchronization steps. By using the BubbleSched platform as a threading backend for the GOMP OpenMP compiler, we are able to easily transpose affinities of thread teams into scheduling hints using abstractions called bubbles. We then propose a scheduling strategy suited to nested OpenMP parallelism. The resulting preliminary performance evaluations show an important improvement of the speedup on a typical NAS OpenMP benchmark application.
dc.language.isoen
dc.subject.enSMP
dc.subject.enOpenMP
dc.subject.enNested Parallelism
dc.subject.enHierarchical Thread Scheduling
dc.subject.enBubbles
dc.subject.enMulti-Core
dc.subject.enNUMA
dc.subject.enSMP.
dc.title.enAn Efficient OpenMP Runtime System for Hierarchical Architectures
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-540-69303-1_19
dc.subject.halInformatique [cs]/Architectures Matérielles [cs.AR]
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
dc.identifier.arxiv0706.2073
bordeaux.page148--159
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleInternational Workshop on OpenMP (IWOMP)
bordeaux.countryCN
bordeaux.conference.cityBeijing
bordeaux.peerReviewedoui
hal.identifierinria-00154502
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00154502v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.date=2007&rft.spage=148--159&rft.epage=148--159&rft.au=THIBAULT,%20Samuel&BROQUEDIS,%20Fran%C3%A7ois&GOGLIN,%20Brice&NAMYST,%20Raymond&WACRENIER,%20Pierre-Andr%C3%A9&rft.genre=unknown


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