Thesis Proposal


"Adapting Persistent Data Structures for Concurrency & Speculation"

Thomas Dickerson

Thursday, March 22, 2018 at 12:00 Noon

Room 368 (CIT 3rd Floor)

This work exploits a correspondence between design goals for efficient concurrent data structures and efficient immutable persistent data structures, to produce novel implementations of concurrent trees with low contention and an efficient snapshot operation to support speculative execution models.

We start with a Braun heap based on hand-over-hand locking, and propose several additional implementations.

Host: Professor Maurice Herlihy