Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Concurrent transformation components using contention context sensors
Linnaeus University, Faculty of Technology, Department of Computer Science.
Linnaeus University, Faculty of Technology, Department of Computer Science.ORCID iD: 0000-0002-7565-3714
2014 (English)In: Proceedings of the 29th ACM/IEEE international conference on Automated software engineering, ACM Press, 2014, 223-234 p.Conference paper, Published paper (Refereed)
Abstract [en]

Sometimes components are conservatively implemented as thread-safe, while during the actual execution they are only accessed from one thread. In these scenarios, overly conservative assumptions lead to suboptimal performance.

The contribution of this paper is a component architecture that combines the benefits of different synchronization mechanisms to implement thread-safe concurrent components. Based on the thread contention monitored at runtime, context-aware composition and optimization select the appropriate mechanism. On changing contention, it revises this decision automatically and transforms the components accordingly. We implemented this architecture for concurrent queues, sets, and ordered sets. In all three cases, experimental evaluation shows close to optimal performance regardless of the actual contention.

As a consequence, programmers can focus on the semantics of their systems and, e.g., conservatively use thread-safe components to assure consistency of their data, while deferring implementation and optimization decisions to contention-context-aware composition at runtime.

Place, publisher, year, edition, pages
ACM Press, 2014. 223-234 p.
National Category
Computer Science
Research subject
Computer and Information Sciences Computer Science, Computer Science
Identifiers
URN: urn:nbn:se:lnu:diva-42432DOI: 10.1145/2642937.2642995Scopus ID: 2-s2.0-84908610246ISBN: 978-1-4503-3013-8 (print)OAI: oai:DiVA.org:lnu-42432DiVA: diva2:805581
Conference
ASE 2014, September 15-19, 2014, Västerås, Sweden
Funder
Swedish Research Council, 2011-6185
Available from: 2015-04-15 Created: 2015-04-15 Last updated: 2017-01-27Bibliographically approved

Open Access in DiVA

fulltext(1836 kB)34 downloads
File information
File name FULLTEXT03.pdfFile size 1836 kBChecksum SHA-512
b0323d81bfcbe6ecda22bd312df68b81a6f1d3c3139a1c0b93c53aed4ea3e7cf90e5e43e3a09eef0a8dc20e7e847894346dae20d2f1acd4107c65ca078fe6eb4
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopusFulltext ACM

Search in DiVA

By author/editor
Österlund, ErikLöwe, Welf
By organisation
Department of Computer Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 35 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 147 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf