Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
Of Concurrent Data Structures and Iterations
Chalmers University of Technology.
University of Borås, Faculty of Librarianship, Information, Education and IT. (CSL@BS)
Chalmers University of Technology.
Chalmers University of Technology.
2015 (English)In: 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, 358-369 p.Chapter in book (Refereed)
Resource type
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.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2015. Vol. 9295, 358-369 p.
Series
Lecture Notes in Computer Science, 9295
Keyword [en]
Iteration, Consistency, Lock-free Concurrent data structures, In-memory computation, Range-queries
National Category
Computer Science
Identifiers
URN: urn:nbn:se:hb:diva-5409DOI: 10.1007/978-3-319-24024-4_20Scopus ID: 84951869962OAI: oai:DiVA.org:hb-5409DiVA: diva2:884988
Projects
Execution Models for Energy-Efficient Computing Systems - EXCESS (European Union Seventh Framework Programme (FP7/2013-2016) under grant agreement 611183)
Funder
EU, FP7, Seventh Framework Programme, 611183
Available from: 2015-12-17 Created: 2015-12-17 Last updated: 2016-12-30Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopushttp://dx.doi.org/10.1007/978-3-319-24024-4_20

Search in DiVA

By author/editor
Gidenstam, Anders
By organisation
Faculty of Librarianship, Information, Education and IT
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 297 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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