A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers
To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG-of-tasks parallelism regained popularity in the high performance, scientific computing community. In this context, enabling HPC applications to perform efficiently...
Uložené v:
| Vydané v: | Proceedings of the International Conference on Parallel Processing s. 481 - 490 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.09.2014
|
| Predmet: | |
| ISSN: | 0190-3918 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG-of-tasks parallelism regained popularity in the high performance, scientific computing community. 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 behaviour of the application. A detailed performance analysis shows significant performance improvements of the solver over various multicore hardware. |
|---|---|
| AbstractList | To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG-of-tasks parallelism regained popularity in the high performance, scientific computing community. 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 behaviour of the application. A detailed performance analysis shows significant performance improvements of the solver over various multicore hardware. |
| Author | Hugo, Andra-Ecaterina Wacrenier, Pierre-Andre Namyst, Raymond Guermouche, Abdou |
| Author_xml | – sequence: 1 givenname: Andra-Ecaterina surname: Hugo fullname: Hugo, Andra-Ecaterina organization: INRIA, Univ. of Bordeaux, Bordeaux, France – sequence: 2 givenname: Abdou surname: Guermouche fullname: Guermouche, Abdou organization: INRIA, Univ. of Bordeaux, Bordeaux, France – sequence: 3 givenname: Pierre-Andre surname: Wacrenier fullname: Wacrenier, Pierre-Andre organization: INRIA, Univ. of Bordeaux, Bordeaux, France – sequence: 4 givenname: Raymond surname: Namyst fullname: Namyst, Raymond organization: INRIA, Univ. of Bordeaux, Bordeaux, France |
| BookMark | eNotjMtKw0AAAFeoYFt78-ZlfyBxX9nHMaQ-igVLq-eyr9CVJBt2U6F_b0EPwxwGZgFmQxw8AA8YlRgj9bRpdruSIMzKStyAlRISM6FUxbFEMzBHWKGCKizvwCLnb4QIohWbg_ca7s_DFHoP63FMUdsTnCJcXwbdBwv3PsdzstfYddHqKcQBtjHBw6hT9nAdkrcTPMTux6d8D25b3WW_-vcSfL08fzZvxfbjddPU2-JEmJgKRUxrsOHaC0daJzUn0hInjcaEUU6RtEIbh4UiqnXUMmYcV04Y1lJqrizB4983eO-PYwq9TpcjV5UglaC_Ss9OjA |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICPP.2014.57 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISBN | 9781479956180 147995618X |
| EndPage | 490 |
| ExternalDocumentID | 6957257 |
| Genre | orig-research |
| GroupedDBID | -~X 23M 29P 6IE 6IF 6IH 6IK 6IL 6IN AAJGR AAWTH ABDPE ADZIZ AFFNX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL RNS XOL |
| ID | FETCH-LOGICAL-h247t-92bfb1b6ae7d2fd8a628c2d8ba12436308c7abd17929fd3c44bd69d7b4f33bf33 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000393410400049&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0190-3918 |
| IngestDate | Wed Aug 27 04:46:14 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-h247t-92bfb1b6ae7d2fd8a628c2d8ba12436308c7abd17929fd3c44bd69d7b4f33bf33 |
| OpenAccessLink | https://inria.hal.science/hal-01101054 |
| PageCount | 10 |
| ParticipantIDs | ieee_primary_6957257 |
| PublicationCentury | 2000 |
| PublicationDate | 2014-Sept. |
| PublicationDateYYYYMMDD | 2014-09-01 |
| PublicationDate_xml | – month: 09 year: 2014 text: 2014-Sept. |
| PublicationDecade | 2010 |
| PublicationTitle | Proceedings of the International Conference on Parallel Processing |
| PublicationTitleAbbrev | ICPP |
| PublicationYear | 2014 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0020354 ssib026764432 ssib026764358 |
| Score | 1.9278483 |
| Snippet | To face the advent of multicore processors and the ever increasing complexity of hardware architectures, programming models based on DAG-of-tasks parallelism... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 481 |
| SubjectTerms | Composability Context Dynamic scheduling Processor scheduling Program processors Ressource allocation Runtime Sparse direct solver Sparse matrices Virtual machine monitors |
| Title | A Runtime Approach to Dynamic Resource Allocation for Sparse Direct Solvers |
| URI | https://ieeexplore.ieee.org/document/6957257 |
| WOSCitedRecordID | wos000393410400049&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LSgMxFL3U4sJV1VZ8k4VLp49k8lqWalGUMliF7koySVDQTmmnfr_JPFoENy4GZrIabh4nNznnHoAbiqmWTJuIG86imGoRKeN81qp4yhnzG1hXFHF95pOJmM1k0oDbrRbGWluQz2w3vBZ3-SZLN-GorMck5X6I7cEe57zUatVjBzPusXV3w1d8F5rJKvnqExrX0mkiB2JLgpe9x1GSBJJX3KW_TVYKjBm3_vd3h9DZifVQsoWhI2jYxTG0arcGVE3eNjwN0UvwhfiyaFgVEkd5hu5KS3pUn-Oj4WfAt9BfyG9o0XTpU1-LyqURTbPApF534G18_zp6iCorhegdxzyPJNZODzRTlhvsjFAMixQboZXHd8JIX6RcaeNnJ5bOkDSOtWHScB07QrR_TqC5yBb2FJB0A2LogLng2uMXVOVSLYgVTlEfEq3PoB1iM1-W1TLmVVjO_26-gIMQ-ZK1dQnNfLWxV7Cffucf69V10cU_I9SkiA |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEG4QTfSECsa3PXh0we27R4ISCEg2ggk3st220USBwOLvt90HxMSLhybbnjYzbb9OO998ANxTRJVkSgdccxYQqkQQa-ui1pgnnDF3gLVZEdchH43EdCqjCnjYcmGMMVnymWn6z-wtXy-Sjb8qazFJuZtie2CfEoLCnK1Vzh7EuEPX3Rtf1s9Yk0X49YgpKcnTWIZimwYvW_1OFPk0L9Kkv2VWMpTp1v73f8egsaPrwWgLRCegYuanoFbqNcBi-dbBoA1fvTLEl4HtopQ4TBfwKRelh-VNPmx_eoTzHoPuSAvHSxf8GphvjnC88LnU6wZ46z5POr2gEFMI3hHhaSCRsipULDZcI6tFzJBIkBYqdgiPGX4UCY-VdusTSatxQojSTGquiMVYuXYGqvPF3JwDKG2INQ2Z9bo9bkuNbaIENsLG1JlEqQtQ97aZLfN6GbPCLJd_D9-Bw97kZTgb9keDK3DkvZDncF2DarramBtwkHynH-vVbebuH-QHp88 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+International+Conference+on+Parallel+Processing&rft.atitle=A+Runtime+Approach+to+Dynamic+Resource+Allocation+for+Sparse+Direct+Solvers&rft.au=Hugo%2C+Andra-Ecaterina&rft.au=Guermouche%2C+Abdou&rft.au=Wacrenier%2C+Pierre-Andre&rft.au=Namyst%2C+Raymond&rft.date=2014-09-01&rft.pub=IEEE&rft.issn=0190-3918&rft.spage=481&rft.epage=490&rft_id=info:doi/10.1109%2FICPP.2014.57&rft.externalDocID=6957257 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0190-3918&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0190-3918&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0190-3918&client=summon |