Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • harvard-cite-them-right
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Of Concurrent Data Structures and Iterations
Chalmers University of Technology.
Högskolan i Borås, Akademin för bibliotek, information, pedagogik och IT. (CSL@BS)
Chalmers University of Technology.
Chalmers University of Technology.
2015 (Engelska)Ingår i: Algorithms, Probability, Networks, and Games: Scientific Papers and Essays Dedicated to Paul G. Spirakis on the Occasion of His 60th Birthday / [ed] Christos D. Zaroliagis and Grammati E. Pantziou and Spyros C. Kontogiannis, Springer Berlin/Heidelberg, 2015, Vol. 9295, s. 358-369Kapitel i bok, del av antologi (Refereegranskat)
Resurstyp
Text
Abstract [en]

Bulk operations on data structures are widely used both on user-level but also on programming language level. Iterations are a good example of such bulk operations. In the sequential setting iterations are easy to design on top of an algorithmic construction of a data structure and is not considered as a challenge. In a concurrent environment, such as a multicore system, the situation is completely different and the issue of extending concurrent data structure designs to support iteration operations opens new research challenges in concurrent algorithmic data structure implementations, with respect to consistency and efficiency. In this paper we take a journey through this young and evolving research topic. More precisely we describe recent advances in the area together with an overview of iteration implementations that have appeared in the research literature as well as in widely-used programming environments and we outline a range of application targets and challenging future directions.

Ort, förlag, år, upplaga, sidor
Springer Berlin/Heidelberg, 2015. Vol. 9295, s. 358-369
Serie
Lecture Notes in Computer Science ; 9295
Nyckelord [en]
Iteration, Consistency, Lock-free Concurrent data structures, In-memory computation, Range-queries
Nationell ämneskategori
Datavetenskap (datalogi)
Identifikatorer
URN: urn:nbn:se:hb:diva-5409DOI: 10.1007/978-3-319-24024-4_20Scopus ID: 2-s2.0-84951869962OAI: oai:DiVA.org:hb-5409DiVA, id: diva2:884988
Projekt
Execution Models for Energy-Efficient Computing Systems - EXCESS (European Union Seventh Framework Programme (FP7/2013-2016) under grant agreement 611183)
Forskningsfinansiär
EU, FP7, Sjunde ramprogrammet, 611183Tillgänglig från: 2015-12-17 Skapad: 2015-12-17 Senast uppdaterad: 2018-01-10Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopushttp://dx.doi.org/10.1007/978-3-319-24024-4_20

Personposter BETA

Gidenstam, Anders

Sök vidare i DiVA

Av författaren/redaktören
Gidenstam, Anders
Av organisationen
Akademin för bibliotek, information, pedagogik och IT
Datavetenskap (datalogi)

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 509 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • harvard-cite-them-right
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf