Description
- Abstract:
- This work unifies insights from the systems and functional programming communities, in order to enable compositional reasoning about software which is nonetheless efficiently realizable in hardware. It exploits a correspondence between design goals for efficient concurrent data structures and efficient immutable persistent data structures, to produce novel implementations of mutable concurrent trees with low contention and an efficient snapshot operation to support speculative execution models. It also exploits commutativity to characterize a design space for integrating traditional high-performance concurrent data structures into Software Transactional Memory (STM) runtimes, and extends this technique to yield a novel algorithm for concurrent execution of so-called "smart contracts" (specialized programs which manipulate the state of blockchain ledgers).
- Notes:
- Thesis (Ph. D.)--Brown University, 2019
Access Conditions
- Rights
- In Copyright
- Restrictions on Use
- Collection is open for research.
Citation
Dickerson, Thomas D.,
"Adapting Persistent Data Structures for Concurrency and Speculation"
(2019).
Computer Science Theses and Dissertations.
Brown Digital Repository. Brown University Library.
https://doi.org/10.26300/mrtg-sy85
Relations
Collection:
-
Computer Science Theses and Dissertations
Theses and Dissertations for the Computer Science department....