Using independence to enable parallelism on multicore computers
A simple programming ion based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its programmed solution. This enables a compiler and runtime system to exploit the independence and achieve efficient parallelism of execution o...
Saved in:
| Published in: | Software, practice & experience Vol. 41; no. 4; pp. 393 - 402 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
Chichester, UK
John Wiley & Sons, Ltd
10.04.2011
|
| Subjects: | |
| ISSN: | 0038-0644, 1097-024X, 1097-024X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | A simple programming ion based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its programmed solution. This enables a compiler and runtime system to exploit the independence and achieve efficient parallelism of execution on multicore processors. The constructs needed to express mutual independence among statements are proposed and their implementation in iOberon, an extension of the Active Oberon programming language, is defined. The programming language extensions, runtime support, and performance measurements are described in detail. We believe that this concept of specifying local disjoint program fragments can be applied to other programming languages. Copyright © 2010 John Wiley & Sons, Ltd. |
|---|---|
| AbstractList | A simple programming abstraction based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its programmed solution. This enables a compiler and runtime system to exploit the independence and achieve efficient parallelism of execution on multicore processors. The constructs needed to express mutual independence among statements are proposed and their implementation in iOberon, an extension of the Active Oberon programming language, is defined. The programming language extensions, runtime support, and performance measurements are described in detail. We believe that this concept of specifying local disjoint program fragments can be applied to other programming languages. A simple programming abstraction based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its programmed solution. This enables a compiler and runtime system to exploit the independence and achieve efficient parallelism of execution on multicore processors. The constructs needed to express mutual independence among statements are proposed and their implementation in iOberon, an extension of the Active Oberon programming language, is defined. The programming language extensions, runtime support, and performance measurements are described in detail. We believe that this concept of specifying local disjoint program fragments can be applied to other programming languages. Copyright © 2010 John Wiley & Sons, Ltd. A simple programming ion based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its programmed solution. This enables a compiler and runtime system to exploit the independence and achieve efficient parallelism of execution on multicore processors. The constructs needed to express mutual independence among statements are proposed and their implementation in iOberon, an extension of the Active Oberon programming language, is defined. The programming language extensions, runtime support, and performance measurements are described in detail. We believe that this concept of specifying local disjoint program fragments can be applied to other programming languages. Copyright © 2010 John Wiley & Sons, Ltd. |
| Author | Knudsen, Svend E. |
| Author_xml | – sequence: 1 givenname: Svend E. surname: Knudsen fullname: Knudsen, Svend E. email: knudsen@id.ethz.ch organization: Department of Computer Science, Swiss Federal Institute of Technology, Zurich, Switzerland |
| BookMark | eNp10MFKxDAQBuAgCq6r4CP0ppeuk6RNNydRWVdhUUFFbyGmU4mmSU26qG9vZUVQ9DIzDN_M4d8i6z54JGSXwoQCsIPU4TBQWCMjCrLKgRX362QEwKc5iKLYJFspPQFQWjIxIoe3yfrHzPoaOxyKN5j1IUOvHxxmnY7aOXQ2tVnwWbt0vTUhYmZC2y17jGmbbDTaJdz56mNyezq7OTnLF5fz85OjRW44LyGXxlDKKqkrihJFyYui5nUluGx4yTiHRgpDWakrXclhWQgqGEJT1vUUa5R8TPZWf7sYXpaYetXaZNA57TEsk5JAxbQoGAxyspImhpQiNsrYXvc2-D5q6xQF9RmUGoJSn0ENB_u_DrpoWx3f_6L5ir5ah-__OnV9Nfvpberx7dvr-KxExatS3V3MFbA5PZZwpeb8A9Knhz8 |
| CitedBy_id | crossref_primary_10_1145_3485008 |
| Cites_doi | 10.1145/258948.258967 10.1007/11860990_13 10.1145/359576.359585 10.1145/324133.324234 10.1145/1018203.1018205 10.1007/11860990_3 10.1145/1463822.1463838 10.1145/363235.363259 10.1007/978-1-4757-3472-0 10.1007/BF00265077 10.1145/1465482.1465560 10.1145/42411.42415 10.1145/359763.359771 10.1007/978-1-4612-5695-3_26 10.1109/PGEC.1966.264565 10.1007/978-3-642-83565-0 10.1145/358818.358824 10.1002/(SICI)1097-024X(199605)26:5<581::AID-SPE53>3.0.CO;2-P 10.1145/361454.361473 10.1109/TSE.1975.6312840 |
| ContentType | Journal Article |
| Copyright | Copyright © 2010 John Wiley & Sons, Ltd. |
| Copyright_xml | – notice: Copyright © 2010 John Wiley & Sons, Ltd. |
| DBID | BSCLL AAYXX CITATION 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| DOI | 10.1002/spe.1010 |
| DatabaseName | Istex CrossRef Computer and Information Systems Abstracts Technology Research Database ANTE: Abstracts in New Technology & Engineering Engineering Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest Computer Science Collection Computer and Information Systems Abstracts Engineering Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Technology Research Database CrossRef |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1097-024X |
| EndPage | 402 |
| ExternalDocumentID | 10_1002_spe_1010 SPE1010 ark_67375_WNG_02G1B90P_G |
| Genre | article |
| GroupedDBID | -~X .3N .DC .GA .Y3 05W 0R~ 10A 123 1L6 1OB 1OC 31~ 33P 3SF 3WU 4.4 4ZD 50Y 50Z 51W 51X 52M 52N 52O 52P 52S 52T 52U 52W 52X 5VS 66C 702 7PT 8-0 8-1 8-3 8-4 8-5 85S 8UM 930 A03 AAESR AAEVG AAHQN AAMMB AAMNL AANHP AANLZ AAONW AASGY AAXRX AAYCA AAZKR ABCQN ABCUV ABIJN ABLJU ABUFD ACAHQ ACBWZ ACCZN ACFBH ACGFS ACIWK ACNCT ACPOU ACRPL ACXBN ACXQS ACYXJ ADBBV ADEOM ADIZJ ADKYN ADMGS ADNMO ADOZA ADXAS ADZMN AEFGJ AEIGN AEIMD AENEX AEUYR AEYWJ AFBPY AFFPM AFGKR AFWVQ AFZJQ AGQPQ AGXDD AGYGG AHBTC AIDQK AIDYY AITYG AIURR ALAGY ALMA_UNASSIGNED_HOLDINGS ALVPJ AMBMR AMYDB ASPBG ATUGU AUFTA AVWKF AZBYB AZFZN AZVAB BAFTC BDRZF BFHJK BHBCM BMNLL BNHUX BROTX BRXPI BSCLL BY8 CS3 D-E D-F D0L DCZOG DPXWK DR2 DRFUL DRSTM DU5 EBS EJD F00 F01 F04 FEDTE G-S G.N GNP GODZA H.T H.X HBH HF~ HGLYW HHY HVGLF HZ~ IX1 J0M 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 NF~ NNB O66 O9- OIG P2P P2W P2X P4D PQQKQ PZZ Q.N Q11 QB0 QRW R.K ROL RX1 RXW RYL S10 SUPJJ TWZ UB1 V2E W8V W99 WBKPD WH7 WIB WIH WIK WOHZO WQJ WXSBR WYISQ WZISG XG1 XPP XV2 ZCA ZZTAW ~02 ~IA ~WT AAHHS ACCFJ AEEZP AEQDE AEUQT AFPWT AIWBW AJBDE ALUQN RWI WRC WWW AAYXX CITATION O8X 7SC 8FD F28 FR3 JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c3350-9cc11279a71e9e65344d3d7639f352330f96c125a7a7939f46162e0f5dd8ede93 |
| IEDL.DBID | DRFUL |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000288080800003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0038-0644 1097-024X |
| IngestDate | Thu Jul 10 18:20:46 EDT 2025 Tue Nov 18 22:25:53 EST 2025 Sat Nov 29 04:02:35 EST 2025 Wed Jan 22 16:38:27 EST 2025 Tue Nov 11 03:30:12 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 4 |
| Language | English |
| License | http://onlinelibrary.wiley.com/termsAndConditions#vor |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c3350-9cc11279a71e9e65344d3d7639f352330f96c125a7a7939f46162e0f5dd8ede93 |
| Notes | istex:E73D8C76F137E86FCE52D4F7469F0B3AC87A87D6 ark:/67375/WNG-02G1B90P-G ArticleID:SPE1010 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
| PQID | 901684420 |
| PQPubID | 23500 |
| PageCount | 10 |
| ParticipantIDs | proquest_miscellaneous_901684420 crossref_citationtrail_10_1002_spe_1010 crossref_primary_10_1002_spe_1010 wiley_primary_10_1002_spe_1010_SPE1010 istex_primary_ark_67375_WNG_02G1B90P_G |
| PublicationCentury | 2000 |
| PublicationDate | 10 April 2011 |
| PublicationDateYYYYMMDD | 2011-04-10 |
| PublicationDate_xml | – month: 04 year: 2011 text: 10 April 2011 day: 10 |
| PublicationDecade | 2010 |
| PublicationPlace | Chichester, UK |
| PublicationPlace_xml | – name: Chichester, UK |
| PublicationTitle | Software, practice & experience |
| PublicationTitleAlternate | Softw: Pract. Exper |
| PublicationYear | 2011 |
| Publisher | John Wiley & Sons, Ltd |
| Publisher_xml | – name: John Wiley & Sons, Ltd |
| References | Hansen BP. Structured multiprogramming. CACM 1972; 15:574-578. Knudsen SE. Statement-sets. Lecture Notes in Computer Science 1996; 1127:23-36. Lampl O, Stellnberger E, Böszönnenyi L. Programming language concepts for multimedia application development. Lecture Notes in Computer Science 2006; 4228:23-36. Bernstein AJ. Program analysis for parallel processing. IEEE Transactions on Electronic Computers 1966; EC-15:757-762. Hoare CAR. An axiomatic basis for Computer Programming. CACM 1969; 12:10. van Wijngaarden A. Revised report on the algorithmic language ALGOL 68. Acta Informatica 1975; 5:1-236. Hansen PB. The programming language concurrent pascal. IEEE Transactions on Software Engineering 1975; 1(2):199-207. Hoare CAR. Occam 2 Reference Manual. Inmos Limited (Prentice-Hall International Series in Computer Science): Upper Saddle River, NJ, 1988. Geschke CM, Morris JH Jr, Satterthwaite EH. Early experience with Mesa. Communications of the ACM 1977; 20(8):540-552. Hansen PB. Efficient parallel recursion. Special Interest Group on Programming Languages (SIGPLAN) 1996; 30(12):9-16. Wirth N. Algorithms + Data Structures =Programs. Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1976; 76-82. Hoare CAR. Communicating sequential processes. Communications of the ACM 1978; 21(8):666-677. Gosling J, Joy B, Steele GL. The Java Language Specification. Addison-Wesley: Boston, MA, 1996. Friedrich FO, Gutknecht J. Array-structured object types for mathematical programming. Lecture Notes in Computer Science 2006; 4228:195-210. Gustafson JL. Reevaluating Amdahl's Law. Communications of the ACM 1988; 31(5):532-533. Benton N, Cardelli L, Fournet C. Modern concurrency abstractions for C#. Transactions on Programming Languages and Systems (TOPLAS) 2004; 26(5):769-804. Blumofe RD. Scheduling multithreaded computations by work stealing. Journal of the ACM 1999; 46(5):720-748. Wirth N. Report on the Programming Language Modula-2 (4th edn). Springer: Heidelberg, Germany, 1988. Wirth N. The Programming Language Oberon. Department of Computer Science, ETH: Zürich, Report 111, 1989. Ben-Asher Y, Feitelson DG, Rudolph L. ParC-An extension of C for shared memory parallel processing. Software: Practice and Experience 1996; 26(5):581-612. Lampson BW, Redell DD. Experience with processes and monitors in mesa. Communications of the ACM 1980; 23(2):105-117. Dijkstra EW. Cooperating Sequential Processes. EWD123. Technological University: Eindhoven, The Netherlands, 1965. 2010 1980; 23 2004; 26 1969; 12 2009 1976 1998 1999; 46 1997 1996; 30 1977; 20 1996 1966; EC‐15 1971 1988; 31 2002 1996; 1127 1978; 21 1965 2006; 4228 1975; 1 1982 1996; 26 1989 1967 1972; 15 1975; 5 1988 e_1_2_10_22_2 e_1_2_10_20_2 e_1_2_10_21_2 Hansen PB (e_1_2_10_17_2) 1996; 30 Wirth N (e_1_2_10_26_2) 1988 Wirth N (e_1_2_10_13_2) 1976 Hoare CAR (e_1_2_10_23_2) 1988 Dijkstra EW (e_1_2_10_2_2) 1965 e_1_2_10_19_2 e_1_2_10_3_2 Wirth N (e_1_2_10_9_2) 1989 e_1_2_10_18_2 e_1_2_10_5_2 e_1_2_10_15_2 e_1_2_10_4_2 e_1_2_10_16_2 e_1_2_10_6_2 e_1_2_10_14_2 e_1_2_10_35_2 e_1_2_10_34_2 e_1_2_10_8_2 e_1_2_10_12_2 e_1_2_10_33_2 e_1_2_10_32_2 e_1_2_10_10_2 e_1_2_10_31_2 Knudsen SE (e_1_2_10_7_2) 1996; 1127 e_1_2_10_30_2 e_1_2_10_28_2 Gosling J (e_1_2_10_27_2) 1996 e_1_2_10_29_2 e_1_2_10_24_2 Hoare CAR (e_1_2_10_11_2) 1971 e_1_2_10_25_2 |
| References_xml | – reference: Hoare CAR. An axiomatic basis for Computer Programming. CACM 1969; 12:10. – reference: Wirth N. Algorithms + Data Structures =Programs. Prentice-Hall, Inc.: Englewood Cliffs, NJ, 1976; 76-82. – reference: Wirth N. Report on the Programming Language Modula-2 (4th edn). Springer: Heidelberg, Germany, 1988. – reference: Hansen BP. Structured multiprogramming. CACM 1972; 15:574-578. – reference: van Wijngaarden A. Revised report on the algorithmic language ALGOL 68. Acta Informatica 1975; 5:1-236. – reference: Benton N, Cardelli L, Fournet C. Modern concurrency abstractions for C#. Transactions on Programming Languages and Systems (TOPLAS) 2004; 26(5):769-804. – reference: Hansen PB. The programming language concurrent pascal. IEEE Transactions on Software Engineering 1975; 1(2):199-207. – reference: Hoare CAR. Occam 2 Reference Manual. Inmos Limited (Prentice-Hall International Series in Computer Science): Upper Saddle River, NJ, 1988. – reference: Gosling J, Joy B, Steele GL. The Java Language Specification. Addison-Wesley: Boston, MA, 1996. – reference: Geschke CM, Morris JH Jr, Satterthwaite EH. Early experience with Mesa. Communications of the ACM 1977; 20(8):540-552. – reference: Wirth N. The Programming Language Oberon. Department of Computer Science, ETH: Zürich, Report 111, 1989. – reference: Hoare CAR. Communicating sequential processes. Communications of the ACM 1978; 21(8):666-677. – reference: Blumofe RD. Scheduling multithreaded computations by work stealing. Journal of the ACM 1999; 46(5):720-748. – reference: Hansen PB. Efficient parallel recursion. Special Interest Group on Programming Languages (SIGPLAN) 1996; 30(12):9-16. – reference: Gustafson JL. Reevaluating Amdahl's Law. Communications of the ACM 1988; 31(5):532-533. – reference: Ben-Asher Y, Feitelson DG, Rudolph L. ParC-An extension of C for shared memory parallel processing. Software: Practice and Experience 1996; 26(5):581-612. – reference: Dijkstra EW. Cooperating Sequential Processes. EWD123. Technological University: Eindhoven, The Netherlands, 1965. – reference: Friedrich FO, Gutknecht J. Array-structured object types for mathematical programming. Lecture Notes in Computer Science 2006; 4228:195-210. – reference: Lampson BW, Redell DD. Experience with processes and monitors in mesa. Communications of the ACM 1980; 23(2):105-117. – reference: Bernstein AJ. Program analysis for parallel processing. IEEE Transactions on Electronic Computers 1966; EC-15:757-762. – reference: Knudsen SE. Statement-sets. Lecture Notes in Computer Science 1996; 1127:23-36. – reference: Lampl O, Stellnberger E, Böszönnenyi L. Programming language concepts for multimedia application development. Lecture Notes in Computer Science 2006; 4228:23-36. – volume: 23 start-page: 105 issue: 2 year: 1980 end-page: 117 article-title: Experience with processes and monitors in mesa publication-title: Communications of the ACM – year: 2009 – volume: 12 start-page: 10 year: 1969 article-title: An axiomatic basis for Computer Programming publication-title: CACM – volume: 5 start-page: 1 year: 1975 end-page: 236 article-title: Revised report on the algorithmic language ALGOL 68 publication-title: Acta Informatica – year: 1989 – start-page: 61 year: 1971 end-page: 71 – year: 1996 – volume: 1 start-page: 199 issue: 2 year: 1975 end-page: 207 article-title: The programming language concurrent pascal publication-title: IEEE Transactions on Software Engineering – volume: 4228 start-page: 23 year: 2006 end-page: 36 article-title: Programming language concepts for multimedia application development publication-title: Lecture Notes in Computer Science – volume: 46 start-page: 720 issue: 5 year: 1999 end-page: 748 article-title: Scheduling multithreaded computations by work stealing publication-title: Journal of the ACM – volume: 30 start-page: 9 issue: 12 year: 1996 end-page: 16 article-title: Efficient parallel recursion publication-title: Special Interest Group on Programming Languages (SIGPLAN) – start-page: 147 year: 1982 end-page: 160 – start-page: 76 year: 1976 end-page: 82 – volume: 20 start-page: 540 issue: 8 year: 1977 end-page: 552 article-title: Early experience with Mesa publication-title: Communications of the ACM – volume: 26 start-page: 581 issue: 5 year: 1996 end-page: 612 article-title: ParC—An extension of C for shared memory parallel processing publication-title: Software: Practice and Experience – volume: 31 start-page: 532 issue: 5 year: 1988 end-page: 533 article-title: Reevaluating Amdahl's Law publication-title: Communications of the ACM – year: 2010 – year: 1998 – start-page: 196 year: 1997 end-page: 203 – year: 1965 – volume: 15 start-page: 574 year: 1972 end-page: 578 article-title: Structured multiprogramming publication-title: CACM – year: 2002 – year: 1988 – volume: 4228 start-page: 195 year: 2006 end-page: 210 article-title: Array‐structured object types for mathematical programming publication-title: Lecture Notes in Computer Science – start-page: 139 end-page: 146 – volume: 1127 start-page: 23 year: 1996 end-page: 36 article-title: Statement‐sets publication-title: Lecture Notes in Computer Science – volume: 21 start-page: 666 issue: 8 year: 1978 end-page: 677 article-title: Communicating sequential processes publication-title: Communications of the ACM – volume: EC‐15 start-page: 757 year: 1966 end-page: 762 article-title: Program analysis for parallel processing publication-title: IEEE Transactions on Electronic Computers – volume: 26 start-page: 769 issue: 5 year: 2004 end-page: 804 article-title: Modern concurrency abstractions for C# publication-title: Transactions on Programming Languages and Systems (TOPLAS) – start-page: 483 year: 1967 end-page: 485 – volume-title: The Programming Language Oberon year: 1989 ident: e_1_2_10_9_2 – ident: e_1_2_10_28_2 doi: 10.1145/258948.258967 – ident: e_1_2_10_35_2 doi: 10.1007/11860990_13 – ident: e_1_2_10_29_2 – volume: 1127 start-page: 23 year: 1996 ident: e_1_2_10_7_2 article-title: Statement‐sets publication-title: Lecture Notes in Computer Science – ident: e_1_2_10_3_2 doi: 10.1145/359576.359585 – ident: e_1_2_10_15_2 doi: 10.1145/324133.324234 – ident: e_1_2_10_30_2 doi: 10.1145/1018203.1018205 – ident: e_1_2_10_12_2 – ident: e_1_2_10_31_2 – ident: e_1_2_10_34_2 doi: 10.1007/11860990_3 – ident: e_1_2_10_5_2 doi: 10.1145/1463822.1463838 – ident: e_1_2_10_10_2 doi: 10.1145/363235.363259 – start-page: 76 volume-title: Algorithms + Data Structures =Programs year: 1976 ident: e_1_2_10_13_2 – ident: e_1_2_10_14_2 – volume-title: Cooperating Sequential Processes. EWD123 year: 1965 ident: e_1_2_10_2_2 – volume-title: Occam 2 Reference Manual year: 1988 ident: e_1_2_10_23_2 – ident: e_1_2_10_20_2 doi: 10.1007/978-1-4757-3472-0 – ident: e_1_2_10_22_2 doi: 10.1007/BF00265077 – ident: e_1_2_10_18_2 doi: 10.1145/1465482.1465560 – volume-title: The Java Language Specification year: 1996 ident: e_1_2_10_27_2 – start-page: 61 volume-title: International Seminar on Operating System Techniques year: 1971 ident: e_1_2_10_11_2 – volume: 30 start-page: 9 issue: 12 year: 1996 ident: e_1_2_10_17_2 article-title: Efficient parallel recursion publication-title: Special Interest Group on Programming Languages (SIGPLAN) – ident: e_1_2_10_19_2 doi: 10.1145/42411.42415 – ident: e_1_2_10_25_2 doi: 10.1145/359763.359771 – ident: e_1_2_10_21_2 doi: 10.1007/978-1-4612-5695-3_26 – ident: e_1_2_10_33_2 – ident: e_1_2_10_6_2 doi: 10.1109/PGEC.1966.264565 – volume-title: Report on the Programming Language Modula‐2 year: 1988 ident: e_1_2_10_26_2 doi: 10.1007/978-3-642-83565-0 – ident: e_1_2_10_16_2 doi: 10.1145/358818.358824 – ident: e_1_2_10_8_2 – ident: e_1_2_10_32_2 doi: 10.1002/(SICI)1097-024X(199605)26:5<581::AID-SPE53>3.0.CO;2-P – ident: e_1_2_10_4_2 doi: 10.1145/361454.361473 – ident: e_1_2_10_24_2 doi: 10.1109/TSE.1975.6312840 |
| SSID | ssj0011526 |
| Score | 1.8921729 |
| Snippet | A simple programming ion based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly into its... A simple programming abstraction based on the notion of independence is introduced as a means for mapping the independence inherent in an algorithm explicitly... |
| SourceID | proquest crossref wiley istex |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 393 |
| SubjectTerms | Algorithms C (programming language) Computer programs independence multicore processing parallel programming language Performance measurement Processors Programming Programming languages Software |
| Title | Using independence to enable parallelism on multicore computers |
| URI | https://api.istex.fr/ark:/67375/WNG-02G1B90P-G/fulltext.pdf https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fspe.1010 https://www.proquest.com/docview/901684420 |
| Volume | 41 |
| WOSCitedRecordID | wos000288080800003&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: 1097-024X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011526 issn: 0038-0644 databaseCode: DRFUL dateStart: 19960101 isFulltext: true titleUrlDefault: https://onlinelibrary.wiley.com providerName: Wiley-Blackwell |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LSwMxEA7SevBifWJ9EUH0tDTNZrObk_ho60FKUYu9hTSbhWLdLd1W_PlO9qUFBcHTXibJkmRmvmQm3yB0DpYvsuEmhygKBxQFGC7gOnJcrpmnFXgUkheb8Pv9YDQSgyKr0r6Fyfkhqgs3qxmZvbYKrsZp64s0NJ0Ze_SE43qdwrZlNVS_e-wOH6oYAngmnpMyBg44XlZSzxLaKtuuOKO6ndePFaT5Ha9mDqfb-M-vbqHNAmbi63xfbKM1E--gRlnCARcavYuuspQBPKmK4WqDFwk22YsqbHnBp1MYPH3DSYyz5ENLe4l10VG6h4bdzvPtvVPUVHC063rEEVoDwvKF8ttGGO65jIVuCEZGRADFXJdEgmsAPcpXoLkiYrzNqSGRF4aBCY1w91EtTmJzgLDX5lEwhkY0AFxIPBV4xldgAqiOALiMm-iynFypC8JxW_diKnOqZCphXmyKGWmis0pylpNs_CBzka1PJaDmrzYpzffkS78nCe21bwQZyF4T4XIBJaiKjX-o2CTLVAL04QFj1PaVLdevg8mnQcd-D_8qeIQ28stmBn7tGNUW86U5Qev6fTFJ56fFzvwEskzj9w |
| linkProvider | Wiley-Blackwell |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3fT9swED6hdhK8DDZAFAYzEoKnqG5iO7H2MAGjBa1UFVDBm-U6jlTRpVVTJv58zvkFSJs0aU95OduR7bv77Dt_B3CEli9x4SaPah8PKBoxXCRM4gXCMG40ehRaFJsIB4Po4UEOV-Bb9Ram4IeoL9ycZuT22im4u5Buv7KGZnPrzp54Xm8y3EW8Ac0fN91Rvw4ioGsSBStj5KHnZRX3LPXbVdt33qjpJvb5HdR8C1hzj9Nd_69_3YCPJdAkp8XO-AQrNv0M61URB1Lq9CZ8z5MGyKQuh2ssWc6Izd9UEccMPp3i6NkvMktJnn7oiC-JKTvKtmDUvbg7v_TKqgqeCQJOPWkMYqxQ6rBjpRU8YCwOYjQzMkEwFgQ0kcIg7NGhRt2VCRMd4Vua8DiObGxlsA2NdJbaHSC8I5JojI38CJEh5TriNtRoBHyTIHQZt-Ckml1lSspxV_liqgqyZF_hvLgkM9qCw1pyXtBs_EHmOF-gWkAvHl1aWsjV_aCnqN_rnEk6VL0WkGoFFSqLi4Do1M6eMoXgR0SM-a6vfL3-Opi6HV647-6_Cn6F1cu7677qXw1-7sFacfXM0Mt9gcZy8WT34YP5vZxki4Nym74AYgjn5w |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dSxwxEB_EK-JLz1bF02ojiD4t5naT7IY-iF93lR7H4Qf6FnLZBMTr3nF7lv75TvZLhRYKfdqXSbIkmZlfMpPfAByg5XM-3BRQHeIBRSOGS4RxQSQM40ajR6FlsYl4OEweHuRoCb7Vb2FKfojmws1rRmGvvYLbWeqOX1lD85n1Z088r7cYlwK1snVx3bsbNEEEdE2iZGVMAvS8rOaepeFx3fadN2r5if39Dmq-BayFx-m1_-tf1-BjBTTJabkzPsGSzT5Duy7iQCqdXoeTImmAPDblcI0liymxxZsq4pnBJxMcPf9Jphkp0g898SUxVUf5Btz1Lm_PvwdVVYXARBGngTQGMVYsddy10goeMZZGKZoZ6RCMRRF1UhiEPTrWqLvSMdEVoaWOp2liUyujTVjOppndAsK7wiVjbBQmiAwp1wm3sUYjEBqH0GXcgaN6dpWpKMd95YuJKsmSQ4Xz4pPMaAf2G8lZSbPxB5nDYoEaAT1_8mlpMVf3w76iYb97JulI9TtA6hVUqCw-AqIzO33OFYIfkTAW-r6K9frrYOpmdOm_2_8q-BVWRhc9Nbga_tiB1fLmmaGT-wLLi_mz3YUP5tfiMZ_vVbv0BQ_I52I |
| 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=Using+independence+to+enable+parallelism+on+multicore+computers&rft.jtitle=Software%2C+practice+%26+experience&rft.au=Knudsen%2C+Svend+E&rft.date=2011-04-10&rft.issn=1097-024X&rft.volume=41&rft.issue=4&rft.spage=393&rft.epage=402&rft_id=info:doi/10.1002%2Fspe.1010&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0038-0644&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0038-0644&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0038-0644&client=summon |