Automatic scoping of task clauses for the OpenMP tasking model
OpenMP provides an easy-to-learn and powerful programming environment for the development of parallel programs. We propose here an algorithm for the automatic correction of the OpenMP tasking model. Assuming a compiler or programmer has identified task regions in the source programs, the proposed al...
Uloženo v:
| Vydáno v: | The Journal of supercomputing Ročník 71; číslo 3; s. 808 - 823 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Boston
Springer US
01.03.2015
|
| Témata: | |
| ISSN: | 0920-8542, 1573-0484 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | OpenMP provides an easy-to-learn and powerful programming environment for the development of parallel programs. We propose here an algorithm for the automatic correction of the OpenMP tasking model. Assuming a compiler or programmer has identified task regions in the source programs, the proposed algorithm will automatically generate correct task clauses and synchronization. The proposed algorithm is implemented here based on the ROSE compiler infrastructure; 14 benchmark programs are tested, each of which has had all clauses in the task directives removed for the evaluation. The results of this experimental evaluation show that the proposed technique can successfully generate correct clauses for the tested benchmark programs. The proposed technique can simplify the parallelizing of programs using the OpenMP tasking model, making parallel programming more effective and productive. |
|---|---|
| AbstractList | OpenMP provides an easy-to-learn and powerful programming environment for the development of parallel programs. We propose here an algorithm for the automatic correction of the OpenMP tasking model. Assuming a compiler or programmer has identified task regions in the source programs, the proposed algorithm will automatically generate correct task clauses and synchronization. The proposed algorithm is implemented here based on the ROSE compiler infrastructure; 14 benchmark programs are tested, each of which has had all clauses in the task directives removed for the evaluation. The results of this experimental evaluation show that the proposed technique can successfully generate correct clauses for the tested benchmark programs. The proposed technique can simplify the parallelizing of programs using the OpenMP tasking model, making parallel programming more effective and productive. |
| Author | Wang, Chun-Kun Chen, Peng-Sheng |
| Author_xml | – sequence: 1 givenname: Chun-Kun surname: Wang fullname: Wang, Chun-Kun organization: Department of Computer Science and Information Engineering, National Chung Cheng University – sequence: 2 givenname: Peng-Sheng surname: Chen fullname: Chen, Peng-Sheng email: pschen@cs.ccu.edu.tw organization: Department of Computer Science and Information Engineering, Advanced Institute of Manufacturing for High-tech Innovations, National Chung Cheng University |
| BookMark | eNp9kD1PwzAQhi1UJNrCD2DzHzCcP1InC1JVAUUqKgPMlnN2SkoaV7Y78O9JKRNDpxvufV7dPRMy6kPvCbnlcMcB9H3iXAjNgCvGpZgxeUHGvNCSgSrViIyhEsDKQokrMklpCwBKajkmD_NDDjubW6QJw77tNzQ0NNv0RbGzh-QTbUKk-dPT9d73r2-_u2NsF5zvrsllY7vkb_7mlHw8Pb4vlmy1fn5ZzFcMZVFmhk5WygsoUSoQhUSQTmlvfV3XuoaqQnSKA9YwE0IWDVoHWLgZF1Zb7Wo5JfrUizGkFH1jsM3D1aHP0bad4WCOGsxJgxk0mKMGIweS_yP3sd3Z-H2WEScmDdl-46PZhkPshwfPQD_iSHFj |
| CitedBy_id | crossref_primary_10_3390_app13063667 crossref_primary_10_3390_electronics10101188 |
| Cites_doi | 10.1007/978-3-642-30961-8_3 10.1007/978-3-540-79561-2_9 10.1016/0167-8191(95)00032-9 10.1109/ICPP.2009.64 10.1007/978-3-540-31832-3_7 10.1007/3-540-44587-0_1 10.1007/s10766-010-0139-0 10.1142/S0129626400000214 10.1145/7902.7904 10.1016/0743-7315(90)90028-N 10.1109/TPDS.2008.105 10.1007/978-3-540-31832-3_8 10.1007/978-3-540-31832-3_9 |
| ContentType | Journal Article |
| Copyright | Springer Science+Business Media New York 2014 |
| Copyright_xml | – notice: Springer Science+Business Media New York 2014 |
| DBID | AAYXX CITATION |
| DOI | 10.1007/s11227-014-1326-3 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1573-0484 |
| EndPage | 823 |
| ExternalDocumentID | 10_1007_s11227_014_1326_3 |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C .4S .86 .DC .VR 06D 0R~ 0VY 123 199 1N0 1SB 2.D 203 28- 29L 2J2 2JN 2JY 2KG 2KM 2LR 2P1 2VQ 2~H 30V 4.4 406 408 409 40D 40E 5QI 5VS 67Z 6NX 78A 8TC 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADQRH ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHSBF AHYZX AI. AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN B-. B0M BA0 BBWZM BDATZ BGNMA BSONS CAG COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 EAD EAP EAS EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX F5P FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNWQR GQ6 GQ7 GQ8 GXS H13 HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ KDC KOV KOW LAK LLZTM M4Y MA- N2Q N9A NB0 NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM OVD P19 P2P P9O PF0 PT4 PT5 QOK QOS R4E R89 R9I RHV RNI ROL RPX RSV RZC RZE RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TEORI TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW VH1 W23 W48 WH7 WK8 YLTOR Z45 Z7R Z7X Z7Z Z83 Z88 Z8M Z8N Z8R Z8T Z8W Z92 ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABJCF ABRTQ ACSTC ADHKG ADKFA AEZWR AFDZB AFFHD AFHIU AFKRA AFOHR AGQPQ AHPBZ AHWEU AIXLP ARAPS ATHPR AYFIA BENPR BGLVJ CCPQU CITATION HCIFZ K7- M7S PHGZM PHGZT PQGLB PTHSS |
| ID | FETCH-LOGICAL-c358t-cd394e208c340253c03d47eaebbb7b099ccd410cb062235fcad0c5d612a7a7db3 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 6 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000350868400003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0920-8542 |
| IngestDate | Tue Nov 18 21:22:03 EST 2025 Sat Nov 29 06:13:06 EST 2025 Fri Feb 21 02:27:42 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Validation OpenMP Tasking model Parallelization |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c358t-cd394e208c340253c03d47eaebbb7b099ccd410cb062235fcad0c5d612a7a7db3 |
| PageCount | 16 |
| ParticipantIDs | crossref_citationtrail_10_1007_s11227_014_1326_3 crossref_primary_10_1007_s11227_014_1326_3 springer_journals_10_1007_s11227_014_1326_3 |
| PublicationCentury | 2000 |
| PublicationDate | 2015-03-01 |
| PublicationDateYYYYMMDD | 2015-03-01 |
| PublicationDate_xml | – month: 03 year: 2015 text: 2015-03-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationPlace | Boston |
| PublicationPlace_xml | – name: Boston |
| PublicationSubtitle | An International Journal of High-Performance Computer Design, Analysis, and Use |
| PublicationTitle | The Journal of supercomputing |
| PublicationTitleAbbrev | J Supercomput |
| PublicationYear | 2015 |
| Publisher | Springer US |
| Publisher_xml | – name: Springer US |
| References | Liao C, Quinlan DJ, Panas T, de Supinski BR (2010) A ROSE-based openmp 3.0 research compiler supporting multiple runtime libraries. In: IWOMP, Sato M, Hanawa T, Müller MS, Chapman BM, de Supinski BR eds vol 6132 of lecture notes in computer science, Springer, pp 15–28 Aho AV, Sethi R, Ullman JD (1986) Compilers: principles, techniques, and tools. Addison Wesley Royuela S, Duran A, Liao C, Quinlan DJ (2012) Auto-scoping for openmp tasks. In: Proceedings of the 8th international conference on OpenMP in a heterogeneous World, IWOMP’12, Springer, Berlin, pp 29–43 BikAGirkarMGreyPTianXEfficient exploitation of parallelism on Pentium III and Pentium 4 processor-based systemsIntel Technol J2001Q19 LiaoCQuinlanDJWillcockJPanasTSemantic-aware automatic parallelization of modern applications using high-level abstractionsInt J Parallel Program2010385–636137810.1007/s10766-010-0139-01211.68075 Voss M, Chiu E, Chow PMY, Wong C, Yuen K (2005) An evaluation of auto-scoping in openmp. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP, WOMPAT’04, Springer, Berlin, pp 98–109 Aslot V, Domeika MJ, Eigenmann R, Gaertner G, Jones WB, Parady B (2001) Specomp: a new benchmark suite for measuring parallel computer performance. In: Proceedings of the international workshop on OpenMP applications and tools: OpenMP shared memory parallel programming (London, UK, UK, 2001), WOMPAT ’01, Springer, pp 1–10 PaduaDAWolfeMJAdvanced compiler optimizations for supercomputersCommun ACM198629121184120110.1145/7902.7904 Oracle (2012) Oracle solaris studio 12.3: OpenMP API USer’s Guide. http://docs.oracle.com/cd/E24457_01/html/E21996/, [Online; Accessed 1 Sept 2013] WolfeMJHigh performance compilers for parallel computing1995BostonAddison Wesley BhandarkarSMArabniaHRThe refine multiprocessor theoretical properties and algorithmsParallel Comput199521111783180510.1016/0167-8191(95)00032-9 Mattson T, Sanders B, Massingill B (2004) Patterns for parallel programming, 1st edn Addison-Wesley Professional OpenMP architecture review board (2011) OpenMP application program interface, 3.1 edn. Online available at http://www.openmp.org Johnson S, Evans E, Jin H, Ierotheou C (2005) The parawise expert assistant - widening accessibility to efficient and scalable tool generated openmp code. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP (Berlin, 2005), WOMPAT’04, Springer, pp 67–82 AyguadéECoptyNDuranAHoeflingerJLinYMassaioliFTeruelXUnnikrishnanPZhangGThe design of openmp tasksIEEE Trans Parallel Distrib Syst200920340441810.1109/TPDS.2008.105 Allen R, Kennedy K (2001) Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann JinHJostGYanJAyguadeEGonzalezMMartorellXAutomatic multilevel parallelization using openmpSci Progr2003112177190 Muchnick S (1997) Advanced compiler design and implementation. Morgan Kaufmann MüllerMSNeytchevPAn openmp validation suite2003GermanyAachen University QuinlanDJROSE: compiler support for object-oriented frameworksParallel Process Lett2000102/321522610.1142/S0129626400000214 Duran A, Corbalan J, Ayguade E (2008) Evaluation of openmp task scheduling strategies. In: OpenMP in a new era of parallelism (4th IWOMP’08), Eigenmann R, de Supinski BR eds vol 5004 of lecture notes in computer science (LNCS). Springer, New York, West Lafayette, IN, USA, pp 100–110 Bondhugula U, Baskaran M, Krishnamoorthy S, Ramanujam J, Rountev A, Sadayappan P (2008) Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: International conference on compiler construction (ETAPS CC) Karpov A (2009) Peaceful coexistence of pc-lint and vivamp. http://www.viva64.com/en/b/0005/ [Online; Accessed 1 July 2011] Intel. Automatic parallelization with intel compilers. http://software.intel.com/en-us/articles/automatic-parallelization-with-intel-compilers/. [Online; Accessed 1 July 2011] ArabniaHRA parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approachJ Parallel Distrib Comput199010218819210.1016/0743-7315(90)90028-N Lin Y, Terboven C, Mey DA, Copty N (2005) Automatic scoping of variables in parallel regions of an openmp program. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP, WOMPAT’04, Springer, Berlin, pp 83–97 Duran A, Teruel X, Ferrer R, Martorell X, Ayguade E (2009) Barcelona openmp tasks suite: a set of benchmarks targeting the exploitation of task parallelism in openmp. In: Proceedings of 2009 international conference on parallel processing (38th ICPP’09) CD-ROM (Vienna, Austria, Sept. 2009), IEEE Computer Society Website. Programming of parallel computers, assignment 3, gram-schmidt. https://github.com/yohannteston/Parallel-course-Ass3/. [Online; Accessed 1 July 2011] Arabnia H, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: International conference on high performance computing: New Horizons (Alberta, Canada, 1993), pp 349–357 1326_CR26 1326_CR27 1326_CR28 SM Bhandarkar (1326_CR7) 1995; 21 1326_CR22 1326_CR23 DA Padua (1326_CR24) 1986; 29 1326_CR20 C Liao (1326_CR17) 2010; 38 MJ Wolfe (1326_CR29) 1995 1326_CR15 1326_CR16 1326_CR5 1326_CR18 1326_CR2 1326_CR11 1326_CR3 1326_CR12 E Ayguadé (1326_CR6) 2009; 20 A Bik (1326_CR8) 2001; Q1 1326_CR1 1326_CR14 MS Müller (1326_CR21) 2003 1326_CR10 H Jin (1326_CR13) 2003; 11 1326_CR19 DJ Quinlan (1326_CR25) 2000; 10 HR Arabnia (1326_CR4) 1990; 10 1326_CR9 |
| References_xml | – reference: Karpov A (2009) Peaceful coexistence of pc-lint and vivamp. http://www.viva64.com/en/b/0005/ [Online; Accessed 1 July 2011] – reference: Website. Programming of parallel computers, assignment 3, gram-schmidt. https://github.com/yohannteston/Parallel-course-Ass3/. [Online; Accessed 1 July 2011] – reference: QuinlanDJROSE: compiler support for object-oriented frameworksParallel Process Lett2000102/321522610.1142/S0129626400000214 – reference: Lin Y, Terboven C, Mey DA, Copty N (2005) Automatic scoping of variables in parallel regions of an openmp program. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP, WOMPAT’04, Springer, Berlin, pp 83–97 – reference: Aslot V, Domeika MJ, Eigenmann R, Gaertner G, Jones WB, Parady B (2001) Specomp: a new benchmark suite for measuring parallel computer performance. In: Proceedings of the international workshop on OpenMP applications and tools: OpenMP shared memory parallel programming (London, UK, UK, 2001), WOMPAT ’01, Springer, pp 1–10 – reference: Liao C, Quinlan DJ, Panas T, de Supinski BR (2010) A ROSE-based openmp 3.0 research compiler supporting multiple runtime libraries. In: IWOMP, Sato M, Hanawa T, Müller MS, Chapman BM, de Supinski BR eds vol 6132 of lecture notes in computer science, Springer, pp 15–28 – reference: LiaoCQuinlanDJWillcockJPanasTSemantic-aware automatic parallelization of modern applications using high-level abstractionsInt J Parallel Program2010385–636137810.1007/s10766-010-0139-01211.68075 – reference: Allen R, Kennedy K (2001) Optimizing compilers for modern architectures: a dependence-based approach. Morgan Kaufmann – reference: PaduaDAWolfeMJAdvanced compiler optimizations for supercomputersCommun ACM198629121184120110.1145/7902.7904 – reference: Duran A, Corbalan J, Ayguade E (2008) Evaluation of openmp task scheduling strategies. In: OpenMP in a new era of parallelism (4th IWOMP’08), Eigenmann R, de Supinski BR eds vol 5004 of lecture notes in computer science (LNCS). Springer, New York, West Lafayette, IN, USA, pp 100–110 – reference: Oracle (2012) Oracle solaris studio 12.3: OpenMP API USer’s Guide. http://docs.oracle.com/cd/E24457_01/html/E21996/, [Online; Accessed 1 Sept 2013] – reference: OpenMP architecture review board (2011) OpenMP application program interface, 3.1 edn. Online available at http://www.openmp.org – reference: Johnson S, Evans E, Jin H, Ierotheou C (2005) The parawise expert assistant - widening accessibility to efficient and scalable tool generated openmp code. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP (Berlin, 2005), WOMPAT’04, Springer, pp 67–82 – reference: AyguadéECoptyNDuranAHoeflingerJLinYMassaioliFTeruelXUnnikrishnanPZhangGThe design of openmp tasksIEEE Trans Parallel Distrib Syst200920340441810.1109/TPDS.2008.105 – reference: Royuela S, Duran A, Liao C, Quinlan DJ (2012) Auto-scoping for openmp tasks. In: Proceedings of the 8th international conference on OpenMP in a heterogeneous World, IWOMP’12, Springer, Berlin, pp 29–43 – reference: BhandarkarSMArabniaHRThe refine multiprocessor theoretical properties and algorithmsParallel Comput199521111783180510.1016/0167-8191(95)00032-9 – reference: MüllerMSNeytchevPAn openmp validation suite2003GermanyAachen University – reference: Mattson T, Sanders B, Massingill B (2004) Patterns for parallel programming, 1st edn Addison-Wesley Professional – reference: Bondhugula U, Baskaran M, Krishnamoorthy S, Ramanujam J, Rountev A, Sadayappan P (2008) Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: International conference on compiler construction (ETAPS CC) – reference: Voss M, Chiu E, Chow PMY, Wong C, Yuen K (2005) An evaluation of auto-scoping in openmp. In: Proceedings of the 5th international conference on OpenMP applications and tools: shared memory parallel programming with OpenMP, WOMPAT’04, Springer, Berlin, pp 98–109 – reference: ArabniaHRA parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approachJ Parallel Distrib Comput199010218819210.1016/0743-7315(90)90028-N – reference: Duran A, Teruel X, Ferrer R, Martorell X, Ayguade E (2009) Barcelona openmp tasks suite: a set of benchmarks targeting the exploitation of task parallelism in openmp. In: Proceedings of 2009 international conference on parallel processing (38th ICPP’09) CD-ROM (Vienna, Austria, Sept. 2009), IEEE Computer Society – reference: Muchnick S (1997) Advanced compiler design and implementation. Morgan Kaufmann – reference: WolfeMJHigh performance compilers for parallel computing1995BostonAddison Wesley – reference: Aho AV, Sethi R, Ullman JD (1986) Compilers: principles, techniques, and tools. Addison Wesley – reference: JinHJostGYanJAyguadeEGonzalezMMartorellXAutomatic multilevel parallelization using openmpSci Progr2003112177190 – reference: Intel. Automatic parallelization with intel compilers. http://software.intel.com/en-us/articles/automatic-parallelization-with-intel-compilers/. [Online; Accessed 1 July 2011] – reference: BikAGirkarMGreyPTianXEfficient exploitation of parallelism on Pentium III and Pentium 4 processor-based systemsIntel Technol J2001Q19 – reference: Arabnia H, Smith JW (1993) A reconfigurable interconnection network for imaging operations and its implementation using a multi-stage switching box. In: International conference on high performance computing: New Horizons (Alberta, Canada, 1993), pp 349–357 – ident: 1326_CR26 doi: 10.1007/978-3-642-30961-8_3 – volume: 11 start-page: 177 issue: 2 year: 2003 ident: 1326_CR13 publication-title: Sci Progr – ident: 1326_CR10 doi: 10.1007/978-3-540-79561-2_9 – volume-title: An openmp validation suite year: 2003 ident: 1326_CR21 – volume: 21 start-page: 1783 issue: 11 year: 1995 ident: 1326_CR7 publication-title: Parallel Comput doi: 10.1016/0167-8191(95)00032-9 – ident: 1326_CR2 – ident: 1326_CR19 – ident: 1326_CR9 – ident: 1326_CR15 – ident: 1326_CR11 doi: 10.1109/ICPP.2009.64 – ident: 1326_CR14 doi: 10.1007/978-3-540-31832-3_7 – ident: 1326_CR5 doi: 10.1007/3-540-44587-0_1 – volume: 38 start-page: 361 issue: 5–6 year: 2010 ident: 1326_CR17 publication-title: Int J Parallel Program doi: 10.1007/s10766-010-0139-0 – volume: 10 start-page: 215 issue: 2/3 year: 2000 ident: 1326_CR25 publication-title: Parallel Process Lett doi: 10.1142/S0129626400000214 – volume: 29 start-page: 1184 issue: 12 year: 1986 ident: 1326_CR24 publication-title: Commun ACM doi: 10.1145/7902.7904 – ident: 1326_CR23 – volume: 10 start-page: 188 issue: 2 year: 1990 ident: 1326_CR4 publication-title: J Parallel Distrib Comput doi: 10.1016/0743-7315(90)90028-N – volume: 20 start-page: 404 issue: 3 year: 2009 ident: 1326_CR6 publication-title: IEEE Trans Parallel Distrib Syst doi: 10.1109/TPDS.2008.105 – ident: 1326_CR12 – ident: 1326_CR1 – volume: Q1 start-page: 9 year: 2001 ident: 1326_CR8 publication-title: Intel Technol J – ident: 1326_CR3 – ident: 1326_CR16 – ident: 1326_CR18 doi: 10.1007/978-3-540-31832-3_8 – ident: 1326_CR28 – ident: 1326_CR20 – ident: 1326_CR22 – ident: 1326_CR27 doi: 10.1007/978-3-540-31832-3_9 – volume-title: High performance compilers for parallel computing year: 1995 ident: 1326_CR29 |
| SSID | ssj0004373 |
| Score | 2.043713 |
| Snippet | OpenMP provides an easy-to-learn and powerful programming environment for the development of parallel programs. We propose here an algorithm for the automatic... |
| SourceID | crossref springer |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 808 |
| SubjectTerms | Compilers Computer Science Interpreters Processor Architectures Programming Languages |
| Title | Automatic scoping of task clauses for the OpenMP tasking model |
| URI | https://link.springer.com/article/10.1007/s11227-014-1326-3 |
| Volume | 71 |
| WOSCitedRecordID | wos000350868400003&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: PRVAVX databaseName: SpringerLink Journals customDbUrl: eissn: 1573-0484 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004373 issn: 0920-8542 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60evBifWJ9sQdPykKafSUXoYjFg5aCWnoLu5sNiKUtTervdzYPS0EFPWeyhMnuzvcxM98AXImsK5XUGQ3xF1AuM0VNIAxyHiFMrCWX5dC-0aMaDKLxOB7Wfdx5U-3epCTLm3rV7NYNQ18mySkyKEnZJmwJLzbjKfrzaNUMyaq0coy8KBI8bFKZ3y2xHozWM6FlgOm3__Vpe7Bb40nSqzbAPmy46QG0m1kNpD66h3DbWxazUp6V-EYUXJ3MMlLo_J3YiV7mLicIXwnCQeJrTJ6G5TNvVs7KOYLX_v3L3QOtZydQy0RUUJuymLswiCxDhiiYDVjKldPOGKMMwkJrU94NrAkkAgSRWZ0GVqSId7TSKjXsGFrT2dSdALG-W1bJVEuBIU-GRmSSI66IrNJCadeBoHFiYmthcT_fYpKsJJG9fxL0T-L9k7AOXH-9Mq9UNX4zvmm8ntQHLP_Z-vRP1mewgwhIVEVl59AqFkt3Adv2o3jLF5flxvoEknvE9A |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB60CnqxPrE-9-BJWUizr-QiFLFUbEvBWnoLu5sNFEsrTervdzcPS0EFPWeyhMnuzjfMfPMB3LCkyQWXCfbtL8CUJwIrjymb8zCmQskpz0X7Rl3R7wfjcTgoedxp1e1elSTzm3pFdmv6vmuTpNhmUByTTdiiTmXHpegvoxUZkhRl5dDmRQGjflXK_G6J9WC0XgnNA0y7_q9P24e9Ek-iVrEBDmDDzA6hXmk1oPLoHsF9a5nN8_GsyBFR7OponqBMpm9IT-UyNSmy8BVZOIhcj0lvkD9zZrlWzjG8th-HDx1caidgTViQYR2TkBrfCzSxGSIj2iMxFUYapZRQFhZqHdOmp5XHLUBgiZaxp1ls8Y4UUsSKnEBtNp-ZU0DasWUFjyVnNuRxX7GEU4srAi0kE9I0wKucGOlysLjTt5hGq5HIzj-R9U_k_BORBtx-vfJeTNX4zfiu8npUHrD0Z-uzP1lfw05n2OtG3af-8znsWjTEigazC6hli6W5hG39kU3SxVW-yT4B2EHH2A |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1ZS8NAEF60ivhiPbGe--CTEkyzV_IiFLUo1lI8St_CXgGxtKVJ_f3O5rAUVBCfM9mE2V3mG2a--RA6Y0mTCy4TL4At8ChPhKd8piDnYUxFklOei_b1O6LbDQeDqFfqnKZVt3tVkiw4DW5K0yi7nJjkck58awaBa5mkHmRT3CPLaIVCIuN6up6e-3NiJClKzBHkSCGjQVXW_G6JxcC0WBXNg027_u_f3EQbJc7EreJgbKElO9pG9UrDAZdXegddtWbZOB_bih1BBb6ExwnOZPqO9VDOUptigLUYYCJ2vSePvfyZM8s1dHbRa_v25frOKzUVPE1YmHnakIjawA81gcyREe0TQ4WVViklFMBFrQ14UiufA3BgiZbG18wADpJCCqPIHqqNxiO7j7B2LFrBjeQMQiEPFEs4BbwRaiGZkLaB_MqhsS4Hjjvdi2E8H5Xs_BODf2Lnn5g00PnXK5Ni2sZvxhfVDsTlxUt_tj74k_UpWuvdtOPOfffhEK0DSGJF39kRqmXTmT1Gq_oje0unJ_l5-wTnk9C8 |
| 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=Automatic+scoping+of+task+clauses+for+the+OpenMP+tasking+model&rft.jtitle=The+Journal+of+supercomputing&rft.au=Wang%2C+Chun-Kun&rft.au=Chen%2C+Peng-Sheng&rft.date=2015-03-01&rft.pub=Springer+US&rft.issn=0920-8542&rft.eissn=1573-0484&rft.volume=71&rft.issue=3&rft.spage=808&rft.epage=823&rft_id=info:doi/10.1007%2Fs11227-014-1326-3&rft.externalDocID=10_1007_s11227_014_1326_3 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0920-8542&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0920-8542&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0920-8542&client=summon |