Award Date

8-1-2019

Degree Type

Dissertation

Degree Name

Doctor of Philosophy (PhD)

Department

Computer Science

First Committee Member

Ajoy Datta

Second Committee Member

John Minor

Third Committee Member

Laxmi Gewali

Fourth Committee Member

Sidkazem Taghva

Fifth Committee Member

Emma Regentova

Number of Pages

128

Abstract

This dissertation examines the concurrency approaches for a standard, unmodified B-Tree which is one of the more complex data structures. This includes the coarse grained, fine-grained locking, and the lock-free approaches. The basic industry standard coarse-grained approach is used as a base-line for comparison to the more advanced fine-grained and lock-free approaches. The fine-grained approach is explored and algorithms are presented for the fine-grained B-Tree insertion and deletion. The lock-free approach is addressed and an algorithm for a lock-free B- Tree insertion is provided. The issues associated with a lock-free deletion are discussed. Comparison trade-offs are presented and discussed. As a final part of this effort, specific testing processes are discussed and presented.

Keywords

Concurrency; fine grained locking; lock-free

Disciplines

Computer Sciences

Language

English


Share

COinS