Bapi Chatterjee, Data- och informationsteknik

​Lock-free Concurrent Search

The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. On the other hand, though many celebrated books on data structure and algorithm provide a comprehensive study of sequential search data structures, unfortunately, we do not have such a luxury if concurrency comes in the setting. The present dissertation aims to address this paucity. We describe novel lock-free algorithms for concurrent data structures that target a variety of search problems.


  1. Point search (membership query, predecessor query, nearest neighbour query) for 1-dimensional data: Lock-free linked-list; lock-free internal and external binary search trees (BST).
  2. Range search for 1-dimensional data: A range search method for lock-free ordered set data structures - linked-list, skip-list and BST.
  3. Point search for multi-dimensional data: Lock-free kD-tree, specially, a generic method for nearest neighbour search.
We prove that the presented algorithms are linearizable i.e. the concurrent data structure operations intuitively display their sequential behaviour to an observer of the concurrent system. The lock-freedom in the introduced algorithms guarantee overall progress in an asynchronous shared memory system. We present the amortized analysis of lock-free data structures to show their efficiency. Moreover, we provide sample implementations of the algorithms and test them over extensive micro-benchmarks. Our experiments demonstrate that the implementations are scalable and perform well when compared to related existing alternative implementations on common multi-core computers.


Our focus is on propounding the generic methodologies for efficient lock-free concurrent search. In this direction, we present the notion of help-optimality, which captures the optimization of amortized step complexity of the operations. In addition to that, we explore the language-portable design of lock-free data structures that aims to simplify an implementation from programmer’s point of view. Finally, our techniques to implement lock-free linearizable range search and nearest neighbour search are independent of the underlying data structures and thus are adaptive to similar data structures.
​Bapi Chatterjee tillhör avdelningen för nätverk och system vid Data- och informationsteknik.

Opponent
Professor Pascal Felber, University of Neuchâtel, Switzerland.

Betygsnämnd
Associate professor Paolo Romano, University of Lisbon, Portugal.
Associate professor Pedro Petersen Moura Trancoso, University of Cyprus.
Professor Stefano Kaxiras, Uppsala universitet, Sverige.

http://publications.lib.chalmers.se/publication/500027

Kategori Disputation
Plats: EA, lecture hall, EDIT trappa C, D och H, EDIT
Tid: 2018-01-25 10:00
Sluttid: 2018-01-25 11:00

Publicerad: on 20 dec 2017. Ändrad: fr 12 jan 2018