Concurrency Paradigms: Competitive, Coordinated, and Collaborative: Which Control Mechanisms are Appropriate?
Saved in:
| Title: | Concurrency Paradigms: Competitive, Coordinated, and Collaborative: Which Control Mechanisms are Appropriate? |
|---|---|
| Authors: | Gentleman, W.1 Morven.Gentleman@dal.ca |
| Source: | International Journal of Parallel Programming. Apr2016, Vol. 44 Issue 2, p325-336. 12p. |
| Subjects: | Parallel programming, Concurrent Aggregates (Computer program language), Turing machines, Computer programming, Computer simulation |
| Abstract: | Concurrent computation has been with us for over 50 years, and has become essential today. Concurrency paradigms affect the way we think about parallelism, the programs we try to write, the algorithms we choose, the performance we achieve, the errors we make, and the support mechanisms we need. The paradigms are not equivalent. Although each paradigm can usually be simulated in environments designed for a different paradigm, such a 'Turing machine style' proof of computational equivalency does not establish equivalency in terms of the effort required to program solutions, the proclivity for solutions to be error-prone, or the comparable effectiveness of solutions. Two classic concurrency paradigms are reviewed. A third (not so widely recognized) concurrency paradigm is then discussed. [ABSTRACT FROM AUTHOR] |
| Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Links: – Type: pdflink Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 114191205 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Concurrency Paradigms: Competitive, Coordinated, and Collaborative: Which Control Mechanisms are Appropriate? – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Gentleman%2C+W%2E%22">Gentleman, W.</searchLink><relatesTo>1</relatesTo><i> Morven.Gentleman@dal.ca</i> – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22International+Journal+of+Parallel+Programming%22">International Journal of Parallel Programming</searchLink>. Apr2016, Vol. 44 Issue 2, p325-336. 12p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Parallel+programming%22">Parallel programming</searchLink><br /><searchLink fieldCode="DE" term="%22Concurrent+Aggregates+%28Computer+program+language%29%22">Concurrent Aggregates (Computer program language)</searchLink><br /><searchLink fieldCode="DE" term="%22Turing+machines%22">Turing machines</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+simulation%22">Computer simulation</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Concurrent computation has been with us for over 50 years, and has become essential today. Concurrency paradigms affect the way we think about parallelism, the programs we try to write, the algorithms we choose, the performance we achieve, the errors we make, and the support mechanisms we need. The paradigms are not equivalent. Although each paradigm can usually be simulated in environments designed for a different paradigm, such a 'Turing machine style' proof of computational equivalency does not establish equivalency in terms of the effort required to program solutions, the proclivity for solutions to be error-prone, or the comparable effectiveness of solutions. Two classic concurrency paradigms are reviewed. A third (not so widely recognized) concurrency paradigm is then discussed. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of International Journal of Parallel Programming is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=114191205 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1007/s10766-015-0370-9 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 325 Subjects: – SubjectFull: Parallel programming Type: general – SubjectFull: Concurrent Aggregates (Computer program language) Type: general – SubjectFull: Turing machines Type: general – SubjectFull: Computer programming Type: general – SubjectFull: Computer simulation Type: general Titles: – TitleFull: Concurrency Paradigms: Competitive, Coordinated, and Collaborative: Which Control Mechanisms are Appropriate? Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Gentleman, W. IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 04 Text: Apr2016 Type: published Y: 2016 Identifiers: – Type: issn-print Value: 08857458 Numbering: – Type: volume Value: 44 – Type: issue Value: 2 Titles: – TitleFull: International Journal of Parallel Programming Type: main |
| ResultId | 1 |
