An Efficient OpenMP Runtime System for Hierarchical Arch
| dc.creator | Thibault, Samuel | |
| dc.creator | Broquedis, François | |
| dc.creator | Goglin, Brice | |
| dc.creator | Namyst, Raymond | |
| dc.creator | Wacrenier, Pierre-André | |
| dc.date | 2007-06-14 | |
| dc.date.accessioned | 2026-07-07T08:10:05Z | |
| dc.date.available | 2026-07-07T08:10:05Z | |
| dc.description | Exploiting 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.identifier | https://arxiv.org/abs/0706.2073 | |
| dc.identifier | http://arxiv.org/abs/0706.2073 | |
| dc.identifier | Dans International Workshop on OpenMP (IWOMP) (2007) | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/131734 | |
| dc.subject | Programming Languages | |
| dc.title | An Efficient OpenMP Runtime System for Hierarchical Arch | |
| dc.type | text |