Lock-free Concurrent Data Structures
Preprint, 2013

Concurrent data structures are the data sharing side of parallel programming. Data structures give the means to the program to store data, but also provide operations to the program to access and manipulate these data. These operations are implemented through algorithms that have to be efficient. In the sequential setting, data structures are crucially important for the performance of the respective computation. In the parallel programming setting, their importance becomes more crucial because of the increased use of data and resource sharing for utilizing parallelism. The first and main goal of this chapter is to provide a sufficient background and intuition to help the interested reader to navigate in the complex research area of lock-free data structures. The second goal is to offer the programmer familiarity to the subject that will allow her to use truly concurrent methods.


Daniel Cederman

Chalmers, Data- och informationsteknik, Nätverk och system

Anders Gidenstam

Högskolan i Borås

Phuong Ha

Universitetet i Tromsø – Norges arktiske universitet

Håkan Sundell

Högskolan i Borås

Marina Papatriantafilou

Chalmers, Data- och informationsteknik, Nätverk och system

Philippas Tsigas

Chalmers, Data- och informationsteknik, Nätverk och system


Informations- och kommunikationsteknik



Data- och informationsvetenskap

Mer information

Senast uppdaterat