lnu.sePublikasjoner
Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Concurrent transformation components using contention context sensors
Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).
Linnéuniversitetet, Fakulteten för teknik (FTK), Institutionen för datavetenskap (DV).ORCID-id: 0000-0002-7565-3714
2014 (engelsk)Inngår i: Proceedings of the 29th ACM/IEEE international conference on Automated software engineering, ACM Press, 2014, s. 223-234Konferansepaper, Publicerat paper (Fagfellevurdert)
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.

sted, utgiver, år, opplag, sider
ACM Press, 2014. s. 223-234
HSV kategori
Forskningsprogram
Data- och informationsvetenskap, Datavetenskap
Identifikatorer
URN: urn:nbn:se:lnu:diva-42432DOI: 10.1145/2642937.2642995Scopus ID: 2-s2.0-84908610246ISBN: 978-1-4503-3013-8 (tryckt)OAI: oai:DiVA.org:lnu-42432DiVA, id: diva2:805581
Konferanse
ASE 2014, September 15-19, 2014, Västerås, Sweden
Forskningsfinansiär
Swedish Research Council, 2011-6185Tilgjengelig fra: 2015-04-15 Laget: 2015-04-15 Sist oppdatert: 2018-01-11bibliografisk kontrollert

Open Access i DiVA

fulltext(1836 kB)75 nedlastinger
Filinformasjon
Fil FULLTEXT03.pdfFilstørrelse 1836 kBChecksum SHA-512
b0323d81bfcbe6ecda22bd312df68b81a6f1d3c3139a1c0b93c53aed4ea3e7cf90e5e43e3a09eef0a8dc20e7e847894346dae20d2f1acd4107c65ca078fe6eb4
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopusFulltext ACM

Personposter BETA

Österlund, ErikLöwe, Welf

Søk i DiVA

Av forfatter/redaktør
Österlund, ErikLöwe, Welf
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 76 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 201 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf