Concurrent urban legends
This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows: 1 concurrent = parallel; 2 coroutining = concurrency; 3 synchronization = mutual exclusion; 4 Dekker < Peterson; 5 concurrency = library; 6 inherit...
Gespeichert in:
Veröffentlicht in: | Concurrency and computation 2005-08, Vol.17 (9), p.1133-1172 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 1172 |
---|---|
container_issue | 9 |
container_start_page | 1133 |
container_title | Concurrency and computation |
container_volume | 17 |
creator | Buhr, Peter A. Harji, Ashif S. |
description | This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows:
1
concurrent = parallel;
2
coroutining = concurrency;
3
synchronization = mutual exclusion;
4
Dekker < Peterson;
5
concurrency = library;
6
inheritance anomaly = major concurrency problem;
7
signalling = hints;
8
spurious wakeup = efficiency.
Identifying and understanding the fundamental concepts underlying concurrency is essential to the field. Equally important is not to confuse sequential and concurrent concepts. Finally, approaches based solely on efficiency are insufficient to justify a weak or difficult to use concurrent concept or construct. Copyright © 2005 John Wiley & Sons, Ltd. |
doi_str_mv | 10.1002/cpe.885 |
format | Article |
fullrecord | <record><control><sourceid>wiley_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1002_cpe_885</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>CPE885</sourcerecordid><originalsourceid>FETCH-LOGICAL-c2995-2ea4e77f666a05bbdafde169c829c29f0875956be6ef2a1fe18e0168e43fcd4d3</originalsourceid><addsrcrecordid>eNp1z89LwzAYxvEgCs4pXj3u5kE63yRNmh617BcrVVDRW0jTN1Kt3Ug25v57K5XdPL3v4cMDX0IuKYwpALu1axwrJY7IgArOIpA8Pj78TJ6SsxA-ACgFTgfkKlu1dus9tpvR1pemHTX4jm0VzsmJM03Ai787JC_TyXM2j_KH2SK7yyPL0lREDE2MSeKklAZEWVbGVUhlahVLO-FAJSIVskSJjhnqkCoEKhXG3NkqrviQXPe71q9C8Oj02tdfxu81Bf0bpLsg3QV18qaXu7rB_X9MZ4-TXke9rsMGvw_a-E8tE54I_VrM9LSYL9_ui1w_8R_M4Fo_</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Concurrent urban legends</title><source>Access via Wiley Online Library</source><creator>Buhr, Peter A. ; Harji, Ashif S.</creator><creatorcontrib>Buhr, Peter A. ; Harji, Ashif S.</creatorcontrib><description>This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows:
1
concurrent = parallel;
2
coroutining = concurrency;
3
synchronization = mutual exclusion;
4
Dekker < Peterson;
5
concurrency = library;
6
inheritance anomaly = major concurrency problem;
7
signalling = hints;
8
spurious wakeup = efficiency.
Identifying and understanding the fundamental concepts underlying concurrency is essential to the field. Equally important is not to confuse sequential and concurrent concepts. Finally, approaches based solely on efficiency are insufficient to justify a weak or difficult to use concurrent concept or construct. Copyright © 2005 John Wiley & Sons, Ltd.</description><identifier>ISSN: 1532-0626</identifier><identifier>EISSN: 1532-0634</identifier><identifier>DOI: 10.1002/cpe.885</identifier><language>eng</language><publisher>Chichester, UK: John Wiley & Sons, Ltd</publisher><subject>concurrent ; coroutine ; Dekker ; inheritance anomaly ; mutual exclusion ; parallel ; Peterson ; signalling ; spurious wakeup ; synchronization</subject><ispartof>Concurrency and computation, 2005-08, Vol.17 (9), p.1133-1172</ispartof><rights>Copyright © 2005 John Wiley & Sons, Ltd.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c2995-2ea4e77f666a05bbdafde169c829c29f0875956be6ef2a1fe18e0168e43fcd4d3</citedby><cites>FETCH-LOGICAL-c2995-2ea4e77f666a05bbdafde169c829c29f0875956be6ef2a1fe18e0168e43fcd4d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://onlinelibrary.wiley.com/doi/pdf/10.1002%2Fcpe.885$$EPDF$$P50$$Gwiley$$H</linktopdf><linktohtml>$$Uhttps://onlinelibrary.wiley.com/doi/full/10.1002%2Fcpe.885$$EHTML$$P50$$Gwiley$$H</linktohtml><link.rule.ids>314,780,784,1417,27924,27925,45574,45575</link.rule.ids></links><search><creatorcontrib>Buhr, Peter A.</creatorcontrib><creatorcontrib>Harji, Ashif S.</creatorcontrib><title>Concurrent urban legends</title><title>Concurrency and computation</title><addtitle>Concurrency Computat.: Pract. Exper</addtitle><description>This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows:
1
concurrent = parallel;
2
coroutining = concurrency;
3
synchronization = mutual exclusion;
4
Dekker < Peterson;
5
concurrency = library;
6
inheritance anomaly = major concurrency problem;
7
signalling = hints;
8
spurious wakeup = efficiency.
Identifying and understanding the fundamental concepts underlying concurrency is essential to the field. Equally important is not to confuse sequential and concurrent concepts. Finally, approaches based solely on efficiency are insufficient to justify a weak or difficult to use concurrent concept or construct. Copyright © 2005 John Wiley & Sons, Ltd.</description><subject>concurrent</subject><subject>coroutine</subject><subject>Dekker</subject><subject>inheritance anomaly</subject><subject>mutual exclusion</subject><subject>parallel</subject><subject>Peterson</subject><subject>signalling</subject><subject>spurious wakeup</subject><subject>synchronization</subject><issn>1532-0626</issn><issn>1532-0634</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2005</creationdate><recordtype>article</recordtype><recordid>eNp1z89LwzAYxvEgCs4pXj3u5kE63yRNmh617BcrVVDRW0jTN1Kt3Ug25v57K5XdPL3v4cMDX0IuKYwpALu1axwrJY7IgArOIpA8Pj78TJ6SsxA-ACgFTgfkKlu1dus9tpvR1pemHTX4jm0VzsmJM03Ai787JC_TyXM2j_KH2SK7yyPL0lREDE2MSeKklAZEWVbGVUhlahVLO-FAJSIVskSJjhnqkCoEKhXG3NkqrviQXPe71q9C8Oj02tdfxu81Bf0bpLsg3QV18qaXu7rB_X9MZ4-TXke9rsMGvw_a-E8tE54I_VrM9LSYL9_ui1w_8R_M4Fo_</recordid><startdate>20050810</startdate><enddate>20050810</enddate><creator>Buhr, Peter A.</creator><creator>Harji, Ashif S.</creator><general>John Wiley & Sons, Ltd</general><scope>BSCLL</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20050810</creationdate><title>Concurrent urban legends</title><author>Buhr, Peter A. ; Harji, Ashif S.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c2995-2ea4e77f666a05bbdafde169c829c29f0875956be6ef2a1fe18e0168e43fcd4d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2005</creationdate><topic>concurrent</topic><topic>coroutine</topic><topic>Dekker</topic><topic>inheritance anomaly</topic><topic>mutual exclusion</topic><topic>parallel</topic><topic>Peterson</topic><topic>signalling</topic><topic>spurious wakeup</topic><topic>synchronization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Buhr, Peter A.</creatorcontrib><creatorcontrib>Harji, Ashif S.</creatorcontrib><collection>Istex</collection><collection>CrossRef</collection><jtitle>Concurrency and computation</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Buhr, Peter A.</au><au>Harji, Ashif S.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Concurrent urban legends</atitle><jtitle>Concurrency and computation</jtitle><addtitle>Concurrency Computat.: Pract. Exper</addtitle><date>2005-08-10</date><risdate>2005</risdate><volume>17</volume><issue>9</issue><spage>1133</spage><epage>1172</epage><pages>1133-1172</pages><issn>1532-0626</issn><eissn>1532-0634</eissn><abstract>This discussion addresses a number of urban legends about concurrency in an attempt to separate the myth from the fact. These legends are as follows:
1
concurrent = parallel;
2
coroutining = concurrency;
3
synchronization = mutual exclusion;
4
Dekker < Peterson;
5
concurrency = library;
6
inheritance anomaly = major concurrency problem;
7
signalling = hints;
8
spurious wakeup = efficiency.
Identifying and understanding the fundamental concepts underlying concurrency is essential to the field. Equally important is not to confuse sequential and concurrent concepts. Finally, approaches based solely on efficiency are insufficient to justify a weak or difficult to use concurrent concept or construct. Copyright © 2005 John Wiley & Sons, Ltd.</abstract><cop>Chichester, UK</cop><pub>John Wiley & Sons, Ltd</pub><doi>10.1002/cpe.885</doi><tpages>40</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1532-0626 |
ispartof | Concurrency and computation, 2005-08, Vol.17 (9), p.1133-1172 |
issn | 1532-0626 1532-0634 |
language | eng |
recordid | cdi_crossref_primary_10_1002_cpe_885 |
source | Access via Wiley Online Library |
subjects | concurrent coroutine Dekker inheritance anomaly mutual exclusion parallel Peterson signalling spurious wakeup synchronization |
title | Concurrent urban legends |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-26T01%3A42%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Concurrent%20urban%20legends&rft.jtitle=Concurrency%20and%20computation&rft.au=Buhr,%20Peter%20A.&rft.date=2005-08-10&rft.volume=17&rft.issue=9&rft.spage=1133&rft.epage=1172&rft.pages=1133-1172&rft.issn=1532-0626&rft.eissn=1532-0634&rft_id=info:doi/10.1002/cpe.885&rft_dat=%3Cwiley_cross%3ECPE885%3C/wiley_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |