A runtime approach to dynamic resource allocation for sparse direct solvers
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| dc.contributor.author | HUGO, A.-E | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| hal.structure.identifier | High-End Parallel Algorithms for Challenging Numerical Simulations [HiePACS] | |
| dc.contributor.author | GUERMOUCHE, A | |
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | WACRENIER, P.-A | |
| hal.structure.identifier | Efficient runtime systems for parallel architectures [RUNTIME] | |
| hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
| dc.contributor.author | NAMYST, R | |
| dc.date.accessioned | 2024-04-15T09:57:32Z | |
| dc.date.available | 2024-04-15T09:57:32Z | |
| dc.date.issued | 2014-09-09 | |
| dc.date.conference | 2014-09-09 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198920 | |
| dc.description.abstractEn | —To face the advent of multicore processors and the ever increasing complexity of hardware architectures, pro-gramming models based on DAG-of-tasks parallelism regained popularity in the high performance, scientific computing com-munity. In this context, enabling HPC applications to perform efficiently when dealing with graphs of parallel tasks that could potentially run simultaneously is a great challenge. Even if a uniform runtime system is used underneath, scheduling multiple parallel tasks over the same set of hardware resources introduces many issues, such as undesirable cache flushes or memory bus contention. In this paper, we show how runtime system-based scheduling contexts can be used to dynamically enforce locality of parallel tasks on multicore machines. We extend an existing generic sparse direct solver to use our mechanism and introduce a new decomposition method based on proportional mapping that is used to build the scheduling contexts. We propose a runtime-level dynamic context management policy to cope with the very irregular behavior of the application. A detailed performance analysis shows significant performance improvements of the solver over various multicore hardware. | |
| dc.language.iso | en | |
| dc.source.title | International Conference on Parallel Processing (ICPP 2014) | |
| dc.title.en | A runtime approach to dynamic resource allocation for sparse direct solvers | |
| dc.type | Communication dans un congrès | |
| dc.identifier.doi | 10.1109/ICPP.2014.57 | |
| dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
| 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 | 43rd International Conference on Parallel Processing | |
| bordeaux.country | US | |
| bordeaux.title.proceeding | International Conference on Parallel Processing (ICPP 2014) | |
| bordeaux.conference.city | Minneapolis | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01101054 | |
| hal.version | 1 | |
| hal.invited | non | |
| hal.proceedings | oui | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01101054v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=International%20Conference%20on%20Parallel%20Processing%20(ICPP%202014)&rft.date=2014-09-09&rft.au=HUGO,%20A.-E&GUERMOUCHE,%20A&WACRENIER,%20P.-A&NAMYST,%20R&rft.genre=unknown |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
|
There are no files associated with this item. |
|||