Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems
OpenMP is emerging as a viable high‐level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache‐coherent Non‐Uniform Memory Access (ccNUMA) architectures. Unfortunate...
Uložené v:
| Vydané v: | Concurrency and computation Ročník 14; číslo 8-9; s. 713 - 739 |
|---|---|
| Hlavní autori: | , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Chichester, UK
John Wiley & Sons, Ltd
01.07.2002
|
| Predmet: | |
| ISSN: | 1532-0626, 1532-0634 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | OpenMP is emerging as a viable high‐level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache‐coherent Non‐Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop‐level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high‐performance computation on an important class of modern architectures. Copyright © 2002 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | OpenMP is emerging as a viable high‐level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache‐coherent Non‐Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop‐level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high‐performance computation on an important class of modern architectures. Copyright © 2002 John Wiley & Sons, Ltd. OpenMP is emerging as a viable high-level programming model for shared memory parallel systems. It was conceived to enable easy, portable application development on this range of systems, and it has also been implemented on cache-coherent Non-Uniform Memory Access (ccNUMA) architectures. Unfortunately, it is hard to obtain high performance on the latter architecture, particularly when large numbers of threads are involved. In this paper, we discuss the difficulties faced when writing OpenMP programs for ccNUMA systems, and explain how the vendors have attempted to overcome them. We focus on one such system, the SGI Origin 2000, and perform a variety of experiments designed to illustrate the impact of the vendor's efforts. We compare codes written in a standard, loop-level parallel style under OpenMP with alternative versions written in a Single Program Multiple Data (SPMD) fashion, also realized via OpenMP, and show that the latter consistently provides superior performance. A carefully chosen set of language extensions can help us translate programs from the former style to the latter (or to compile directly, but in a similar manner). Syntax for these extensions can be borrowed from HPF, and some aspects of HPF compiler technology can help the translation process. It is our expectation that an extended language, if well compiled, would improve the attractiveness of OpenMP as a language for high-performance computation on an important class of modern architectures. Copyright copyright 2002 John Wiley & Sons, Ltd. |
| Author | Chapman, B. Prabhakar, A. Patil, A. Bregier, F. |
| Author_xml | – sequence: 1 givenname: B. surname: Chapman fullname: Chapman, B. email: chapman@cs.uh.edu organization: Department of Computer Science, University of Houston, Houston, TX 77204-3010, U.S.A – sequence: 2 givenname: F. surname: Bregier fullname: Bregier, F. organization: Department of Computer Science, University of Houston, Houston, TX 77204-3010, U.S.A – sequence: 3 givenname: A. surname: Patil fullname: Patil, A. organization: Department of Computer Science, University of Houston, Houston, TX 77204-3010, U.S.A – sequence: 4 givenname: A. surname: Prabhakar fullname: Prabhakar, A. organization: Department of Computer Science, University of Houston, Houston, TX 77204-3010, U.S.A |
| BookMark | eNp1kEtL5EAURgtxwNfgX6iVLiRaj6SSLJtGW0FbB5QZxkVRubnR0qQqVqXV_vdGWgQHZ3UvH4ezOFtk3XmHhOxydsgZE0fQ46FK1RrZ5JkUCVMyXf_8hdogWzE-MMY5k3yT3E7g3uKzdXe0x9D40BkHSBeuxkAve3QXV9Q7CjC_uZhQ42oafTO8mIC0tnEItloMOI7341LTDjsfljQu44Bd3CE_GtNG_Plxt8nNyfH19DQ5v5ydTSfnCUhRqKQEKEyNeVNiqVIGggtsaoQ0hwKqQpmsMgWiZMwYXgBkZWnqSqHKoJBYKblN9lbePvinBcZBdzYCtq1x6BdRi5xlaV7mI7i_AiH4GAM2ug-2M2GpOdPv8fQYT4_xRjL5hwQ7mMF6NwRj22_4gxX_Yltc_k-rp1fHX-xjQXz9pE141CqXeaZ_z2f6-pdgc_Gn0H_lGyaSkl8 |
| CitedBy_id | crossref_primary_10_1002_cpe_752 crossref_primary_10_1080_1206212X_2007_11441848 crossref_primary_10_1177_1094342018774126 crossref_primary_10_1109_TC_2010_199 crossref_primary_10_1007_s10766_010_0136_3 crossref_primary_10_1016_j_micpro_2011_08_010 |
| Cites_doi | 10.1145/264107.264206 10.1109/SC.2000.10001 10.1103/PhysRevE.56.6811 10.1002/1096-9128(200010)12:12<1117::AID-CPE543>3.0.CO;2-# 10.1109/SC.2000.10025 10.1109/2.485843 10.1145/305138.305210 10.1109/SC.2000.10019 10.1145/139669.139676 |
| ContentType | Journal Article |
| Copyright | Copyright © 2002 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 2002 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION 7SP 8FD L7M |
| DOI | 10.1002/cpe.646 |
| DatabaseName | Istex CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts |
| DatabaseTitleList | CrossRef Technology Research Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1532-0634 |
| EndPage | 739 |
| ExternalDocumentID | 10_1002_cpe_646 CPE646 ark_67375_WNG_TQ20N2X8_Z |
| Genre | article |
| GrantInformation_xml | – fundername: NASA Ames Research Center funderid: NCC2‐5394 – fundername: NSF funderid: NSF ACI 99‐82160 |
| GroupedDBID | .3N .DC .GA .Y3 05W 0R~ 10A 1L6 1OC 31~ 33P 3SF 3WU 4.4 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5GY 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 8UM 930 A03 AAESR AAEVG AAHQN AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABEML ABIJN ACAHQ ACBWZ ACCZN ACPOU ACRPL ACSCC ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADMLS ADNMO ADOZA ADXAS ADZMN AEIGN AEIMD AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGHNM AGQPQ AGYGG AHBTC AITYG AIURR AJXKR ALMA_UNASSIGNED_HOLDINGS ALUQN ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN BAFTC BDRZF BFHJK BHBCM BMNLL BROTX BRXPI BSCLL BY8 CS3 D-E D-F DCZOG DPXWK DR2 DRFUL DRSTM EBS EJD F00 F01 F04 F5P FEDTE G-S G.N GNP GODZA HF~ HGLYW HHY HVGLF HZ~ IX1 JPC KQQ LATKE LAW LC2 LC3 LEEKS LH4 LITHE LOXES LP6 LP7 LUTES LW6 LYRES MEWTI MK4 MRFUL MRSTM MSFUL MSSTM MXFUL MXSTM N04 N05 N9A O66 O9- OIG P2W P2X P4D PQQKQ Q.N Q11 QB0 QRW R.K ROL RX1 SUPJJ TN5 UB1 V2E W8V W99 WBKPD WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 XV2 ~IA ~WT AAHHS ACCFJ ADZOD AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE RWI WRC AAYXX CITATION O8X 7SP 8FD L7M |
| ID | FETCH-LOGICAL-c3286-9cc8ade7f9e9640c212efdec47c8cb86a5ba8ee300aa18cc599adb6e65c83eb63 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 10 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000177078200011&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1532-0626 |
| IngestDate | Sun Nov 09 12:27:16 EST 2025 Tue Nov 18 22:27:43 EST 2025 Sat Nov 29 01:41:08 EST 2025 Wed Jan 22 16:31:28 EST 2025 Tue Nov 11 03:33:40 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 8-9 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3286-9cc8ade7f9e9640c212efdec47c8cb86a5ba8ee300aa18cc599adb6e65c83eb63 |
| Notes | istex:970529853F7F494E7C9F07FE183606ADC17CACF9 ArticleID:CPE646 NASA Ames Research Center - No. NCC2-5394 NSF - No. NSF ACI 99-82160 ark:/67375/WNG-TQ20N2X8-Z ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 27054797 |
| PQPubID | 23500 |
| PageCount | 27 |
| ParticipantIDs | proquest_miscellaneous_27054797 crossref_primary_10_1002_cpe_646 crossref_citationtrail_10_1002_cpe_646 wiley_primary_10_1002_cpe_646_CPE646 istex_primary_ark_67375_WNG_TQ20N2X8_Z |
| PublicationCentury | 2000 |
| PublicationDate | 2002-07-01 |
| PublicationDateYYYYMMDD | 2002-07-01 |
| PublicationDate_xml | – month: 07 year: 2002 text: 2002-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Concurrency and computation |
| PublicationTitleAlternate | Concurrency Computat.: Pract. Exper |
| PublicationYear | 2002 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | He X, Luo L-S. Theory of the lattice Boltzmann method: From the Boltzmann equation to the lattice Boltzmann equation. Physics Review Letters E 1997; 56(6):6811. Nichols B, Buttlar D, Proulx Farrell J. Pthreads Programming. O'Reilly: Sebastopol, 1996. Amza C et al. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer 1996; 29(2):18-28. Brorsson M, Chapman B (eds.) Selected papers from the First European Workshop on OpenMP. Concurrency: Practice and Experience 2000; 12 (Special Issue). 1998 1997 1996 1995 1994 1996; 29 1992 1991 2000 2000; 12 1997; 56 1999 e_1_2_1_22_2 e_1_2_1_23_2 e_1_2_1_20_2 e_1_2_1_21_2 e_1_2_1_26_2 e_1_2_1_27_2 e_1_2_1_24_2 e_1_2_1_25_2 e_1_2_1_28_2 e_1_2_1_29_2 Nichols B (e_1_2_1_9_2) 1996 e_1_2_1_6_2 e_1_2_1_30_2 e_1_2_1_7_2 e_1_2_1_4_2 e_1_2_1_5_2 e_1_2_1_2_2 e_1_2_1_11_2 e_1_2_1_3_2 e_1_2_1_12_2 e_1_2_1_33_2 e_1_2_1_32_2 e_1_2_1_10_2 e_1_2_1_31_2 e_1_2_1_15_2 e_1_2_1_16_2 e_1_2_1_13_2 e_1_2_1_14_2 e_1_2_1_19_2 e_1_2_1_8_2 e_1_2_1_17_2 e_1_2_1_18_2 |
| References_xml | – reference: Nichols B, Buttlar D, Proulx Farrell J. Pthreads Programming. O'Reilly: Sebastopol, 1996. – reference: Brorsson M, Chapman B (eds.) Selected papers from the First European Workshop on OpenMP. Concurrency: Practice and Experience 2000; 12 (Special Issue). – reference: He X, Luo L-S. Theory of the lattice Boltzmann method: From the Boltzmann equation to the lattice Boltzmann equation. Physics Review Letters E 1997; 56(6):6811. – reference: Amza C et al. TreadMarks: Shared memory computing on networks of workstations. IEEE Computer 1996; 29(2):18-28. – volume: 56 start-page: 6811 issue: 6 year: 1997 article-title: Theory of the lattice Boltzmann method: From the Boltzmann equation to the lattice Boltzmann equation publication-title: Physics Review Letters E – year: 1997 – year: 2000 – year: 1996 – year: 1995 – volume: 29 start-page: 18 issue: 2 year: 1996 end-page: 28 article-title: TreadMarks: Shared memory computing on networks of workstations publication-title: IEEE Computer – start-page: 32 year: 1999 end-page: 39 – volume: 12 year: 2000 article-title: Selected papers from the First European Workshop on OpenMP publication-title: Concurrency: Practice and Experience – year: 1991 – year: 1992 – year: 1994 – year: 1998 – year: 1999 – start-page: 115 year: 1994 end-page: 131 – ident: e_1_2_1_11_2 – ident: e_1_2_1_2_2 doi: 10.1145/264107.264206 – ident: e_1_2_1_14_2 – ident: e_1_2_1_22_2 – ident: e_1_2_1_3_2 – ident: e_1_2_1_27_2 doi: 10.1109/SC.2000.10001 – ident: e_1_2_1_8_2 – ident: e_1_2_1_5_2 – ident: e_1_2_1_30_2 – ident: e_1_2_1_6_2 – volume-title: Pthreads Programming year: 1996 ident: e_1_2_1_9_2 – ident: e_1_2_1_10_2 – ident: e_1_2_1_33_2 – ident: e_1_2_1_28_2 – ident: e_1_2_1_32_2 – ident: e_1_2_1_7_2 – ident: e_1_2_1_15_2 doi: 10.1103/PhysRevE.56.6811 – ident: e_1_2_1_23_2 doi: 10.1002/1096-9128(200010)12:12<1117::AID-CPE543>3.0.CO;2-# – ident: e_1_2_1_31_2 doi: 10.1109/SC.2000.10025 – ident: e_1_2_1_24_2 – ident: e_1_2_1_17_2 doi: 10.1109/2.485843 – ident: e_1_2_1_16_2 – ident: e_1_2_1_25_2 doi: 10.1145/305138.305210 – ident: e_1_2_1_20_2 – ident: e_1_2_1_19_2 – ident: e_1_2_1_29_2 – ident: e_1_2_1_26_2 – ident: e_1_2_1_12_2 doi: 10.1109/SC.2000.10019 – ident: e_1_2_1_13_2 doi: 10.1109/SC.2000.10019 – ident: e_1_2_1_18_2 – ident: e_1_2_1_21_2 doi: 10.1145/139669.139676 – ident: e_1_2_1_4_2 |
| SSID | ssj0011031 |
| Score | 1.7138954 |
| Snippet | OpenMP is emerging as a viable high‐level programming model for shared memory parallel systems. It was conceived to enable easy, portable application... OpenMP is emerging as a viable high-level programming model for shared memory parallel systems. It was conceived to enable easy, portable application... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 713 |
| SubjectTerms | ccNUMA architectures data distribution data locality OpenMP restructuring shared memory parallel programming software distributed shared memory |
| Title | Achieving performance under OpenMP on ccNUMA and software distributed shared memory systems |
| URI | https://api.istex.fr/ark:/67375/WNG-TQ20N2X8-Z/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fcpe.646 https://www.proquest.com/docview/27054797 |
| Volume | 14 |
| WOSCitedRecordID | wos000177078200011&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: PRVWIB databaseName: Wiley Online Library Full Collection 2020 customDbUrl: eissn: 1532-0634 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011031 issn: 1532-0626 databaseCode: DRFUL dateStart: 20010101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Lb9QwEB5BlwMXylNdnj5UvYWGxHHs46p04dBGC-rCCg6WPZmoFZBdJS2Pf48nyW5bISQkTpEcW4nGnoftme8D2K2U1liRiXSmXCQxbHdMTD5KK6-Cw8tQdjf4H47yotCLhZldofrq8SE2B26sGZ29ZgV3vt2_BA3FFb1UUt2EEZdUhX3X6PX76fxoc4XA_AU9WGoSxSFs7ytmefD-MPSaKxqxVH9eizOvRqudu5lu_8eP3oU7Q4wpJv2iuAc3qL4P22v-BjGo8wP4PMHTM-ITBbG6rB8QXFbWCM40OZ6JZS0Qi_nxRLi6FG0w2j9cQ6JkvF2myqLQeMpJ7OIb5-z-Ej00dPsQ5tPDk4O30UC2EGGaaBUZRO1KyitDRskYg0ujqiSUOWr0WrnMO02UxrFzrzRiZowrvSKVoU7Jq_QRbNXLmnZAmNhJdN5jsCUyxMM6SUlhqdmg5UhyDHtruVsckMiZEOOr7TGUExtEZoPIxiA2HVc9-MafXfa6idu8d80XzlXLM_uxeGNP3iVxkSy0_TSGF-uZtUGD-FrE1bS8aG1YPpnMTT6G3W4a__YpezA7DI_H_9btCdzuiGO6zN6nsHXeXNAzuIXfz8_a5vmwWH8DFqzv_Q |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1Zb9NAEB5BggQvlFOEq_tQ9c3U9bHHY1QaikisgBKI4GG1Ho_VCnAip-X49-zYTkqFkJB4srSelVczO4d3Z74B2Cul1liSCXQqXZCg_90xIeVBXObSO7wUk-YG__1YZZleLMy0y6rkWpgWH2J74Maa0dhrVnA-kD64RA3FFb2QibwO_UTGSveg__LdaD7e3iFwA4MWLTUKQh-3tyWzPPmgm3rFF_WZrT-uBJq_h6uNvxnt_M9K78DtLsoUw3Zb3IVrVN2DnU0HB9Ep9H34NMTTM-IzBbG6rCAQXFhWC841mUzFshKI2XwyFK4qxNqb7e-uJlEw4i43yyI_eMpp7OIrZ-3-FC049PoBzEfHs6OToGu3EGAcaRkYRO0KUqUhI5MQvVOjsiBMFGrMtXRp7jRRHIbOHWrE1BhX5JJkijqmXMYPoVctK3oEwoQuQZfn6K1J4iNiHcUksdBs0hRSMoD9DeMtdljk3BLji21RlCPrWWY9ywYgtoSrFn7jT5L9RnLb967-zNlqKrUfsld29jYKs2ih7ccB7G5Ea70O8cWIq2h5sbaR8stURg1gr5Hj3z5lj6bH_vH438h24ebJbDK249fZmydwq2kj0-T5PoXeeX1Bz-AGfjs_W9fPu537C2sN8-0 |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3db9MwED9BixAvG5-iY2N-mPYWliWOYz9W2wqILipohQoeLOdy0SYgrdKNj_8eX5J2TAgJiadIzlmx7nwfse9-B7BXKq2xJBPoRLlAov_dMSHlQVzmyju8BGVzg_9-nGaZns3MpMuq5FqYFh9ifeDGmtHYa1ZwWhTlwTVqKC7ohZLqNvRlYhLZg_7xu9F0vL5D4AYGLVpqFIQ-bm9LZnnyQTf1hi_qM1t_3Ag0fw9XG38z2vyfld6HjS7KFMN2WzyAW1Q9hM1VBwfRKfQj-DTE8wviMwWxuK4gEFxYVgvONTmdiHklELPp6VC4qhBLb7a_u5pEwYi73CyL_OA5p7GLr5y1-1O04NDLxzAdnZwdvQq6dgsBxpFWgUHUrqC0NGSUDNE7NSoLQpmixlwrl-ROE8Vh6NyhRkyMcUWuSCWoY8pV_AR61byipyBM6CS6PEdvTaSPiHUUk8JCs0lLkeQA9leMt9hhkXNLjC-2RVGOrGeZ9SwbgFgTLlr4jT9J9hvJrd-7-jNnq6WJ_ZC9tGdvozCLZtp-HMDuSrTW6xBfjLiK5ldLG6V-malJB7DXyPFvn7JHkxP_2Po3sl24Ozke2fHr7M0zuNd0kWnSfLehd1lf0Q7cwW-XF8v6ebdxfwEJv_No |
| 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=Achieving+performance+under+OpenMP+on+ccNUMA+and+software+distributed+shared+memory+systems&rft.jtitle=Concurrency+and+computation&rft.au=Chapman%2C+B&rft.au=Bregier%2C+F&rft.au=Patil%2C+A&rft.au=Prabhakar%2C+A&rft.date=2002-07-01&rft.issn=1532-0626&rft.volume=14&rft.issue=8-9&rft.spage=713&rft.epage=739&rft_id=info:doi/10.1002%2Fcpe.646&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1532-0626&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1532-0626&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1532-0626&client=summon |