Lock-free concurrent data structures and how to model their performance
Paper i proceeding, 2019

Concurrent data structures provide the means to multi-threaded applications to share data. Typical designs of concurrent data structures are based on locks in order to avoid inconsistency due to concurrent modifications. Locks though introduce a sequential component in Amdahl's law. Lock-free algorithmic designs of concurrent data structures were introduced in the quest for better performance and scalability and are widely used in practice. Lock-free designs typically employ optimistic conflict control making performance analysis challenging. In this talk, I will describe recent efforts in analyzing their performance.

Lock free

Performace Modeling

Analysis

Parallel Computing

Data STructures

Författare

Philippas Tsigas

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

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

15504808 (ISSN)

Vol. 2019-June 1-2 8843620

19th International Conference on Application of Concurrency to System Design, ACSD 2019
Aachen, Germany,

Ämneskategorier

Medieteknik

Annan data- och informationsvetenskap

Mediateknik

DOI

10.1109/ACSD.2019.00004

Mer information

Senast uppdaterat

2019-11-19