Increasing the degree of parallelism using speculative execution in task-based runtime systems
Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and th...
Saved in:
| Published in: | PeerJ. Computer science Vol. 5; p. e183 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
United States
PeerJ. Ltd
18.03.2019
PeerJ, Inc PeerJ PeerJ Inc |
| Subjects: | |
| ISSN: | 2376-5992, 2376-5992 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations. |
|---|---|
| AbstractList | Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations. Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations.Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations. Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow delegation of the management of parallelization to the runtime system (RS), which is in charge of the data coherency, the scheduling, and the assignment of the work to the computational units. However, some applications have a limited degree of parallelism such that no matter how efficient the RS implementation, they may not scale on modern multicore CPUs. In this paper, we propose using speculation to unleash the parallelism when it is uncertain if some tasks will modify data, and we formalize a new methodology to enable speculative execution in a graph of tasks. This description is partially implemented in our new C++ RS called SPETABARU, which is capable of executing tasks in advance if some others are not certain to modify the data. We study the behavior of our approach to compute Monte Carlo and replica exchange Monte Carlo simulations. Subjects Distributed and Parallel Computing |
| ArticleNumber | e183 |
| Audience | Academic |
| Author | Bramas, Bérenger |
| Author_xml | – sequence: 1 givenname: Bérenger surname: Bramas fullname: Bramas, Bérenger organization: CAMUS Team, Inria Nancy—Grand Est, Illkirch-Graffenstaden, France |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/33816836$$D View this record in MEDLINE/PubMed https://inria.hal.science/hal-02070576$$DView record in HAL |
| BookMark | eNptkt1r2zAUxc3oWLuub3sehr2sMGeWZMvSyyCUbQ0EBvt4nZClq0SZLWeSHNr_fnLSbk2p9WBxdc5PV5fzMjtxg4Mse43KWdOg5sMWwG8KFWaIkWfZGSYNLWrO8cmD_Wl2EcKmLEtUo_TxF9kpIQxRRuhZ9mvhlAcZrFvlcQ25hpUHyAeTb6WXXQedDX0-7s_DFtTYyWh3kMNN2kc7uNy6PMrwu2hlAJ370UXbQx5uQ4Q-vMqeG9kFuLj7n2c_P3_6cXVdLL9-WVzNl4WiiMSCYKMRIdIYzYxiqT3S1NzIqm1lWmXbQtk2oEuMk4BJJDlTWhKsMW8pcHKeLQ5cPciN2HrbS38rBmnFvjD4lZA-WtWBIC1XwDUGWukKUc5IomPJKqpJbUyTWB8PrO3Y9qAVuJgmcQQ9PnF2LVbDTjQcV1XFEuDyAFg_sl3Pl2KqlbhsyrqhO5S07-4u88OfEUIUvQ0Kuk46GMYgcF0yxinHE_btI-lmGL1LYxUYcVJRikn9X7WS6bHWmSH1qCaomNcN4ziRpjfOnlClpaG3KmXM2FQ_MlweGZImwk1cyTEEsfj-7Vj75uEA_43gPnVJgA8C5YcQPBihbJRTmlIXthOoFFO6xT7dQgWR0p1M7x-Z7rlPyv8CJkr9MQ |
| CitedBy_id | crossref_primary_10_7717_peerj_cs_247 crossref_primary_10_7717_peerj_cs_2966 crossref_primary_10_1038_s41598_024_61647_6 crossref_primary_10_3390_app13010174 crossref_primary_10_1007_s11227_021_04158_9 crossref_primary_10_1109_ACCESS_2022_3231449 crossref_primary_10_1016_j_parco_2022_102936 |
| Cites_doi | 10.1002/cpe.1631 10.1016/j.jmb.2007.11.063 10.1109/HPCA.1998.650541 10.1142/S0129626411000151 10.1093/bioinformatics/btg427 10.1006/jpdc.1996.0107 10.1002/cpe.3723 10.1109/IPDPS.2013.66 10.1109/TPDS.2008.105 10.12785/amis/071L30 10.1109/HICSS.1995.375471 10.1109/TPDS.2017.2697857 10.1002/cpe.4192 10.1007/978-3-319-92040-5_20 10.1145/2830772.2830777 10.1109/WOLFHPC.2014.8 10.1109/CLUSTR.2008.4663765 10.1109/TPDS.2018.2814602 10.1016/j.phpro.2011.05.055 10.1186/1471-2105-8-342 10.1145/2898348 10.1137/140989716 10.1109/ICPP.2016.78 10.1007/s11227-018-2238-4 |
| ContentType | Journal Article |
| Copyright | 2019 Bramas. COPYRIGHT 2019 PeerJ. Ltd. 2019 Bramas. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. Distributed under a Creative Commons Attribution 4.0 International License 2019 Bramas 2019 Bramas |
| Copyright_xml | – notice: 2019 Bramas. – notice: COPYRIGHT 2019 PeerJ. Ltd. – notice: 2019 Bramas. This is an open access article distributed under the terms of the Creative Commons Attribution License: http://creativecommons.org/licenses/by/4.0/ (the “License”), which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. – notice: Distributed under a Creative Commons Attribution 4.0 International License – notice: 2019 Bramas 2019 Bramas |
| DBID | AAYXX CITATION NPM ISR 3V. 7XB 8AL 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- M0N P5Z P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U 7X8 1XC VOOES 5PM DOA |
| DOI | 10.7717/peerj-cs.183 |
| DatabaseName | CrossRef PubMed Science (Gale in Context) ProQuest Central (Corporate) ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials AUTh Library subscriptions: ProQuest Central Technology Collection ProQuest One Community College ProQuest Central Korea ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic MEDLINE - Academic Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access) PubMed Central (Full Participant titles) Open Access: DOAJ - Directory of Open Access Journals |
| DatabaseTitle | CrossRef PubMed Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) MEDLINE - Academic |
| DatabaseTitleList | Publicly Available Content Database MEDLINE - Academic CrossRef PubMed |
| Database_xml | – sequence: 1 dbid: DOA name: Directory of Open Access Journals - DOAJ (NTUSG) url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 3 dbid: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 2376-5992 |
| ExternalDocumentID | oai_doaj_org_article_3b9ce9d2e64d416983bbe2a846d35ff7 PMC7924448 oai:HAL:hal-02070576v1 A578922837 33816836 10_7717_peerj_cs_183 |
| Genre | Journal Article |
| GroupedDBID | 53G 5VS 8FE 8FG AAFWJ AAYXX ABUWG ADBBV AFFHD AFKRA AFPKN ALMA_UNASSIGNED_HOLDINGS ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO FRP GNUQQ GROUPED_DOAJ H13 HCIFZ IAO ICD IEA ISR ITC K6V K7- M~E OK1 P62 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC RPM 3V. ARCSS M0N NPM 7XB 8AL 8FK JQ2 PKEHL PQEST PQUKI PRINS Q9U 7X8 1XC VOOES 5PM |
| ID | FETCH-LOGICAL-c613t-32fd133affd8fc83383759fa4bbabab0bbe0b7ed022d8f8a1a98cda32d29b6e93 |
| IEDL.DBID | P5Z |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000467364800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2376-5992 |
| IngestDate | Mon Nov 10 04:32:33 EST 2025 Tue Nov 04 02:04:45 EST 2025 Sat Oct 25 11:26:07 EDT 2025 Sun Nov 09 09:59:54 EST 2025 Fri Jul 25 02:42:17 EDT 2025 Tue Nov 11 10:16:29 EST 2025 Tue Nov 04 17:33:08 EST 2025 Thu Nov 13 15:47:53 EST 2025 Thu Jan 02 22:57:15 EST 2025 Sat Nov 29 03:19:44 EST 2025 Tue Nov 18 22:36:40 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Monte-Carlo STF Task-based Speculation |
| Language | English |
| License | http://creativecommons.org/licenses/by/4.0 2019 Bramas. Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Computer Science) and either DOI or URL of the article must be cited. |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c613t-32fd133affd8fc83383759fa4bbabab0bbe0b7ed022d8f8a1a98cda32d29b6e93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 content type line 23 |
| ORCID | 0000-0003-0281-9709 |
| OpenAccessLink | https://www.proquest.com/docview/2193466235?pq-origsite=%requestingapplication% |
| PMID | 33816836 |
| PQID | 2193466235 |
| PQPubID | 2045934 |
| PageCount | e183 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_3b9ce9d2e64d416983bbe2a846d35ff7 pubmedcentral_primary_oai_pubmedcentral_nih_gov_7924448 hal_primary_oai_HAL_hal_02070576v1 proquest_miscellaneous_2508896928 proquest_journals_2193466235 gale_infotracmisc_A578922837 gale_infotracacademiconefile_A578922837 gale_incontextgauss_ISR_A578922837 pubmed_primary_33816836 crossref_citationtrail_10_7717_peerj_cs_183 crossref_primary_10_7717_peerj_cs_183 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-03-18 |
| PublicationDateYYYYMMDD | 2019-03-18 |
| PublicationDate_xml | – month: 03 year: 2019 text: 2019-03-18 day: 18 |
| PublicationDecade | 2010 |
| PublicationPlace | United States |
| PublicationPlace_xml | – name: United States – name: San Diego – name: San Diego, USA |
| PublicationTitle | PeerJ. Computer science |
| PublicationTitleAlternate | PeerJ Comput Sci |
| PublicationYear | 2019 |
| Publisher | PeerJ. Ltd PeerJ, Inc PeerJ PeerJ Inc |
| Publisher_xml | – name: PeerJ. Ltd – name: PeerJ, Inc – name: PeerJ – name: PeerJ Inc |
| References | Salamanca (10.7717/peerj-cs.183/ref-27) 2017 Kim (10.7717/peerj-cs.183/ref-20) 2008; 375 Leiserson (10.7717/peerj-cs.183/ref-21) 2009 Martinez Caamaño (10.7717/peerj-cs.183/ref-22) 2017; 29 Tagliavini (10.7717/peerj-cs.183/ref-29) 2018; 29 Intel (10.7717/peerj-cs.183/ref-16) 2017 Danalis (10.7717/peerj-cs.183/ref-12) 2014 Tillenius (10.7717/peerj-cs.183/ref-32) 2015; 37 Agullo (10.7717/peerj-cs.183/ref-1) 2017; 28 Blumofe (10.7717/peerj-cs.183/ref-9) 1996; 37 Duran (10.7717/peerj-cs.183/ref-13) 2011; 21 Altekar (10.7717/peerj-cs.183/ref-4) 2004; 20 Gross (10.7717/peerj-cs.183/ref-15) 2011; 15 OpenMP Architecture Review Board (10.7717/peerj-cs.183/ref-23) 1997 Chronaki (10.7717/peerj-cs.183/ref-10) 2018 APOLLO (10.7717/peerj-cs.183/ref-5) 2016 Intel (10.7717/peerj-cs.183/ref-17) 2017 Perez (10.7717/peerj-cs.183/ref-26) 2008 Augonnet (10.7717/peerj-cs.183/ref-6) 2011; 23 Zhou (10.7717/peerj-cs.183/ref-34) 2013; 7 Ayguadé (10.7717/peerj-cs.183/ref-7) 2009; 20 Agullo (10.7717/peerj-cs.183/ref-2) 2016; 28 Agullo (10.7717/peerj-cs.183/ref-3) 2016; 43 Bauer (10.7717/peerj-cs.183/ref-8) 2012 Gautier (10.7717/peerj-cs.183/ref-14) 2013 Jeffrey (10.7717/peerj-cs.183/ref-18) 2015 Cosnard (10.7717/peerj-cs.183/ref-11) 1995 OpenMP Architecture Review Board (10.7717/peerj-cs.183/ref-25) 2013 Treikalis (10.7717/peerj-cs.183/ref-33) 2016 Kale (10.7717/peerj-cs.183/ref-19) 1993; vol. 28 OpenMP Architecture Review Board (10.7717/peerj-cs.183/ref-24) 2008 Steffan (10.7717/peerj-cs.183/ref-28) 1998 Thachuk (10.7717/peerj-cs.183/ref-30) 2007; 8 Thoman (10.7717/peerj-cs.183/ref-31) 2018; 74 |
| References_xml | – volume: 23 start-page: 187 issue: 2 year: 2011 ident: 10.7717/peerj-cs.183/ref-6 article-title: StarPU: a unified platform for task scheduling on heterogeneous multicore architectures publication-title: Concurrency and Computation: Practice and Experience doi: 10.1002/cpe.1631 – year: 2016 ident: 10.7717/peerj-cs.183/ref-5 article-title: APOLLO—automatic speculative polyhedral loop optimizer – volume: 375 start-page: 1416 issue: 5 year: 2008 ident: 10.7717/peerj-cs.183/ref-20 article-title: Coarse-grained models for simulations of multiprotein complexes: application to ubiquitin binding publication-title: Journal of Molecular Biology doi: 10.1016/j.jmb.2007.11.063 – year: 1997 ident: 10.7717/peerj-cs.183/ref-23 article-title: OpenMP fortran application program interface 1.0 – start-page: 2 year: 1998 ident: 10.7717/peerj-cs.183/ref-28 article-title: The potential for using thread-level data speculation to facilitate automatic parallelization doi: 10.1109/HPCA.1998.650541 – volume: 21 start-page: 173 issue: 02 year: 2011 ident: 10.7717/peerj-cs.183/ref-13 article-title: OmpSs: a proposal for programming heterogeneous multi-core architectures publication-title: Parallel Processing Letters doi: 10.1142/S0129626411000151 – year: 2017 ident: 10.7717/peerj-cs.183/ref-27 article-title: Using hardware-transactional-memory support to implement thread-level speculation – volume: 20 start-page: 407 issue: 3 year: 2004 ident: 10.7717/peerj-cs.183/ref-4 article-title: Parallel metropolis coupled Markov chain Monte Carlo for Bayesian phylogenetic inference publication-title: Bioinformatics doi: 10.1093/bioinformatics/btg427 – volume: 37 start-page: 55 issue: 1 year: 1996 ident: 10.7717/peerj-cs.183/ref-9 article-title: Cilk: an efficient multithreaded runtime system publication-title: Journal of Parallel and Distributed Computing doi: 10.1006/jpdc.1996.0107 – start-page: 66 year: 2012 ident: 10.7717/peerj-cs.183/ref-8 article-title: Legion: expressing locality and independence with logical regions – year: 2017 ident: 10.7717/peerj-cs.183/ref-16 article-title: Intel Cilk Plus – year: 2017 ident: 10.7717/peerj-cs.183/ref-17 article-title: Threading Building Blocks (TBB) – volume: 28 start-page: 2608 issue: 9 year: 2016 ident: 10.7717/peerj-cs.183/ref-2 article-title: Task-based FMM for heterogeneous architectures publication-title: Concurrency and Computation: Practice and Experience doi: 10.1002/cpe.3723 – volume: vol. 28 start-page: 91 volume-title: ACM Sigplan Notices year: 1993 ident: 10.7717/peerj-cs.183/ref-19 article-title: CHARM++: a portable concurrent object oriented system based on C++ – start-page: 1299 year: 2013 ident: 10.7717/peerj-cs.183/ref-14 article-title: XKaapi: a runtime system for data-flow task programming on heterogeneous architectures doi: 10.1109/IPDPS.2013.66 – volume: 20 start-page: 404 issue: 3 year: 2009 ident: 10.7717/peerj-cs.183/ref-7 article-title: The design of OpenMP tasks publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2008.105 – volume: 7 start-page: 219 issue: 1L year: 2013 ident: 10.7717/peerj-cs.183/ref-34 article-title: Parallel metropolis coupled Markov chain Monte Carlo for isolation with migration model publication-title: Applied Mathematics & Information Sciences doi: 10.12785/amis/071L30 – start-page: 113 year: 1995 ident: 10.7717/peerj-cs.183/ref-11 article-title: Automatic task graph generation techniques doi: 10.1109/HICSS.1995.375471 – volume: 28 start-page: 2794 issue: 10 year: 2017 ident: 10.7717/peerj-cs.183/ref-1 article-title: Bridging the gap between OpenMP and task-based runtime systems for the fast multipole method publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2017.2697857 – volume: 29 start-page: e4192 issue: 15 year: 2017 ident: 10.7717/peerj-cs.183/ref-22 article-title: Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones publication-title: Concurrency and Computation: Practice and Experience doi: 10.1002/cpe.4192 – start-page: 389 volume-title: High performance computing year: 2018 ident: 10.7717/peerj-cs.183/ref-10 article-title: TaskGenX: a hardware-software proposal for accelerating task parallelism doi: 10.1007/978-3-319-92040-5_20 – start-page: 228 year: 2015 ident: 10.7717/peerj-cs.183/ref-18 article-title: A scalable architecture for ordered parallelism doi: 10.1145/2830772.2830777 – year: 2013 ident: 10.7717/peerj-cs.183/ref-25 article-title: OpenMP application program interface version 4.0 – start-page: 21 year: 2014 ident: 10.7717/peerj-cs.183/ref-12 article-title: PTG: an abstraction for unhindered parallelism doi: 10.1109/WOLFHPC.2014.8 – year: 2008 ident: 10.7717/peerj-cs.183/ref-24 article-title: OpenMP application program interface version 3.0 – start-page: 142 year: 2008 ident: 10.7717/peerj-cs.183/ref-26 article-title: A dependency-aware task-based programming environment for multi-core architectures doi: 10.1109/CLUSTR.2008.4663765 – start-page: 522 year: 2009 ident: 10.7717/peerj-cs.183/ref-21 article-title: The Cilk++ concurrency platform – volume: 29 start-page: 2150 issue: 9 year: 2018 ident: 10.7717/peerj-cs.183/ref-29 article-title: Unleashing fine-grained parallelism on embedded many-core accelerators with lightweight OpenMP tasking publication-title: IEEE Transactions on Parallel and Distributed Systems doi: 10.1109/TPDS.2018.2814602 – volume: 15 start-page: 29 year: 2011 ident: 10.7717/peerj-cs.183/ref-15 article-title: A GPU approach to parallel replica-exchange polymer simulations publication-title: Physics Procedia doi: 10.1016/j.phpro.2011.05.055 – volume: 8 start-page: 342 issue: 1 year: 2007 ident: 10.7717/peerj-cs.183/ref-30 article-title: A replica exchange Monte Carlo algorithm for protein folding in the HP model publication-title: BMC Bioinformatics doi: 10.1186/1471-2105-8-342 – volume: 43 start-page: 13:1 issue: 2 year: 2016 ident: 10.7717/peerj-cs.183/ref-3 article-title: Implementing multifrontal sparse solvers for multicore architectures with sequential task flow runtime systems publication-title: ACM Transactions on Mathematical Software doi: 10.1145/2898348 – volume: 37 start-page: C617 issue: 6 year: 2015 ident: 10.7717/peerj-cs.183/ref-32 article-title: Superglue: a shared memory framework using data versioning for dependency-aware task-based parallelization publication-title: SIAM Journal on Scientific Computing doi: 10.1137/140989716 – start-page: 628 year: 2016 ident: 10.7717/peerj-cs.183/ref-33 article-title: RepEx: a flexible framework for scalable replica exchange molecular dynamics simulations doi: 10.1109/ICPP.2016.78 – volume: 74 start-page: 1422 issue: 4 year: 2018 ident: 10.7717/peerj-cs.183/ref-31 article-title: A taxonomy of task-based parallel programming technologies for high-performance computing publication-title: The Journal of Supercomputing doi: 10.1007/s11227-018-2238-4 |
| SSID | ssj0001511119 |
| Score | 2.117652 |
| Snippet | Task-based programming models have demonstrated their efficiency in the development of scientific applications on modern high-performance platforms. They allow... |
| SourceID | doaj pubmedcentral hal proquest gale pubmed crossref |
| SourceType | Open Website Open Access Repository Aggregation Database Index Database Enrichment Source |
| StartPage | e183 |
| SubjectTerms | Algorithms Computer Science Computer simulation Distributed and Parallel Computing Distributed, Parallel, and Cluster Computing Energy High performance computing Instruction execution (Computers) International conferences Methods Monte Carlo methods Monte Carlo simulation Monte-Carlo Motivation Parallel processing Proteins Review boards Run time (computers) Software Speculation STF Task-based Technology application Temperature |
| SummonAdditionalLinks | – databaseName: Open Access: DOAJ - Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lj9MwELZgxYEL70egILMCcUBh0zhN7GNBrBZptUK8tCcsP8a7gW66atqKn8-Mk1YNCHFBvVTxqHVnxv5m1JlvGHueiZAZRCpqjrEpnkSXKiuyFBAqpMIMoohcel-Pq5MTeXqqPuyM-qKasI4euFPcgbDKgfI5lIXH4EFJYS3kBmHTi0kIsY88q9ROMtX1B9NVoLpK9wpTloNLgMX31LWvx1IMMChS9W8v5KvnVA_5Z7D5e83kDggd3mI3-uiRT7td32ZXoLnDbm4mM_D-oN5l3_DYU7U54hLHCI97wLQa-DxwovqezWBWtxd8Fdep1zLO8FoDh5_4nkzF64YvTfsjJZTznOgJ6gvgHe9ze499OXz3-e1R2k9SSB3C9TIVefCYjJoQvAxOxrR0ooIprDX4ylClma3AI6CjgDRjo6TzRuQ-V7YEJe6zvWbewEPGc5VD4X1Am7jC2VLZzARZBimdKy2ME_Zqo1vteppxmnYx05hukCV0tIR2rUZLJOzFVvqyo9f4i9wbMtNWhkix4wN0Fd27iv6XqyRsn4ysifaiobqaM7NqW_3-00c9xYtLRSaghL3shcIc9-1M36aAv56YsgaSo4Eknks3WN5HXxrs-Gh6rOkZhugVxsnlGrU12ria7i-PViOIiKLEuHSSsGfbZfp4KohrYL5CGQqsValymbAHnWduv0rQn8FSlAmrBj472MtwpanPI7V4hek4JuyP_oe6H7PrGF0qKtgbyxHbWy5W8IRdc-tl3S6exvP6Cx_MSkQ priority: 102 providerName: Directory of Open Access Journals |
| Title | Increasing the degree of parallelism using speculative execution in task-based runtime systems |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/33816836 https://www.proquest.com/docview/2193466235 https://www.proquest.com/docview/2508896928 https://inria.hal.science/hal-02070576 https://pubmed.ncbi.nlm.nih.gov/PMC7924448 https://doaj.org/article/3b9ce9d2e64d416983bbe2a846d35ff7 |
| Volume | 5 |
| WOSCitedRecordID | wos000467364800001&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 | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: Directory of Open Access Journals - DOAJ (NTUSG) customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: DOA dateStart: 20150101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: M~E dateStart: 20150101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: K7- dateStart: 20150527 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest advanced technologies & aerospace journals customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: P5Z dateStart: 20150527 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: BENPR dateStart: 20150527 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2376-5992 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0001511119 issn: 2376-5992 databaseCode: PIMPY dateStart: 20150527 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3Nb9MwFLfoxoEL45tAqcwE4oDC0rhN7BPqUKdNbFU1PlR2wHL8sRW6pDRtxYm_nffctCMguKBKURU_NXbft_P8e4Q8i5iLFHgqPByThaCJOhQZi0ILroILyCA6Hkvv43E6GPDRSAyrDbeyKqtc20RvqE2hcY98DzSLdRJw1t3X028hdo3Ct6tVC40G2UaUBGzdMOyeXe2xdNEgiFW9ewqJy97U2tmXUJev2pzVPJEH7N-Y5cYFVkX-GXL-Xjn5iys62PnfRdwiN6sglPZWUnObXLP5HbKzbvBAK32_Sz6D9cCidXBvFAJFaixk55YWjiJi-GRiJ-Pyki78OB7Z9K3Alpba7_AdOU7HOZ2r8muIztJQRDkYX1q6go8u75EPB_33bw7DqiFDqMHrz0MWOwM5rXLOcKe5z267wqlOlin4RFlmoyy1BuICIOCqrQTXRrHYxCJLrGD3yVZe5PYhobGIbccYZ4XRHZ0lIouU44njXOsks-2AvFwzR-oKrRybZkwkZC3ISulZKXUpgZUBeb6hnq5QOv5Ct4983tAgtra_UczOZaWqkmVCw7Rim3QMhKuCM1hXrCBQM6zrXBqQXZQSiegZOZbnnKtFWcqjd6eyB_ZPeEChgLyoiFwB89aqOu0Aq0fArRpls0YJ6q1rw7sgjLUZH_aOJd6DSD-FcDtZwr_VXMubrGxQKa-ELSBPN8P481hXl9tiATQYn4tExDwgD1aivXkUw3fKnCUBSWtCX5tLfSQfX3iE8hSyesj7H_17Wo_JDQg_BVb0tXmTbM1nC_uEXNfL-bictUgjHfEW2d7vD4anLb9XAte3aQjXkx_9lld1GB8enQw__QRi3F7z |
| linkProvider | ProQuest |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF6VggQXyhtDgKWi4oBMHduxdw8IhUeVqCFCUFBPLPtMA6kT4iTAn-I3MuNHikFw6wHlYnlHzq49882MPfsNIQ-CyAUSPBVujlE-WKL2uYoC34KrYBwyiLjg0ns_SIdDdnjIX2-QH_VeGCyrrDGxAGoz1fiOfBcsK4oTcNadp7MvPnaNwq-rdQuNUi327fevkLLlT_ov4PnuhOHey4PnPb_qKuBrcF0LPwqdgcRMOmeY06xI0TrcyVgpCb9AKRuo1BpwbiDAZFtypo2MQhNylVgkXwLIPxtHLEW72k_9k3c6HQQgXtbXp5Ao7c6snX_ydf64zaKG5ysaBKzdwJkjrML8M8T9vVLzF9e3t_W_3bRL5GIVZNNuaRWXyYbNrpCtuoEFrfDsKvkA6IhF-eC-KQTC1NjR3Fo6dRQZ0ScTOxnnx3RZjOOW1KLV2cpS-w2OUaPpOKMLmX_2MRgwFFkcxseWlvTY-TXy7lRWeZ1sZtPM3iQ05KGNjXGWGx1rlXAVSMcSx5jWibJtjzyqlUHoio0dm4JMBGRlqDqiUB2hcwGq45GdtfSsZCH5i9wz1Ku1DHKHFyem85GooEhEimuYVmiT2EA4zlkE6wolBKIm6jiXemQbtVIgO0iG5Ucjucxz0X_7RnQB33lBmOSRh5WQm8K8tax2c8DqkVCsIdlqSAJ86cbwNih_Y8a97kDgOchkUkgnkhXcrVat36LC2FycKLdH7q-H8fJYN5jZ6RJkMP_gCQ-ZR26UprT-qwi_mbMo8UjaMLLGXJoj2fioYGBPOUTFMbv172ndI-d7B68GYtAf7t8mFyDU5li92GYtsrmYL-0dck6vFuN8freAEUo-nrYJ_gSS27hr |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9NAEF6VghAXyhtDgKWi4oBMHNuxdw8IBUrUqlEU8agqDizrfaSB1A5xEuCv8euY8SPFILj1gHKxvCNn1_7mZc9-Q8gjL7CeBE-Fm2MSFzRRuTwJPNeAq2AcMoiw4NI7HMTDITs64qMN8qPeC4NllbVNLAy1zhS-I2-DZgVhBM6627ZVWcRot_989sXFDlL4pbVup1FC5MB8_wrpW_5sfxee9Y7v91-9fbnnVh0GXAVubOEGvtWQpElrNbOKFelal1sZJomEn5ckxktio8HRgQCTHcmZ0jLwtc-TyCARE5j_8zHkmFhOOOq-P32_00VjxMta-xiSpvbMmPknV-VPOyxoeMGiWcDaJZw7xorMP8Pd36s2f3GD_a3_-QZeIZer4Jv2Sm25SjZMeo1s1Y0taGXnrpMPYDWxWB_cOoUAmWoznhtDM0uRKX06NdNJfkKXxThuVS1aoK0MNd_gGJFOJyldyPyzi0GCpsjuMDkxtKTNzm-Qd2eyyptkM81Sc5tQn_sm1NoarlWokognnrQssowpFSWm45AnNTCEqljasVnIVEC2hjASBYyEygXAyCE7a-lZyU7yF7kXiLG1DHKKFyey-VhUJkoECVcwLd9EoYYwnbMA1uVLCFB10LU2dsg2IlQga0iK8BnLZZ6L_TevRQ_sPi-IlBzyuBKyGcxbyWqXB6weicYakq2GJJg11RjeBkVozHivNxB4DjKcGNKMaAV3q1VjXVS2NxenQHfIw_UwXh7rCVOTLUEG8xIecZ855FapVuu_CvBbOgsih8QNhWvMpTmSTo4LZvaYQ7Qcsjv_ntYDchE0Twz2hwd3ySWIwDkWNXZYi2wu5ktzj1xQq8Ukn98vLAolH89aA38CAxfBjw |
| 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%3Ajournal&rft.genre=article&rft.atitle=Increasing+the+degree+of+parallelism+using+speculative+execution+in+task-based+runtime+systems&rft.jtitle=PeerJ.+Computer+science&rft.au=Bramas%2C+B%C3%A9renger&rft.date=2019-03-18&rft.pub=PeerJ+Inc&rft.eissn=2376-5992&rft.volume=5&rft_id=info:doi/10.7717%2Fpeerj-cs.183&rft_id=info%3Apmid%2F33816836&rft.externalDocID=PMC7924448 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2376-5992&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2376-5992&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2376-5992&client=summon |