Finding linearization violations in lock-free concurrent data structures
Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2013.
Main Author: | Dabdoub, Sebastien Alberto |
---|---|
Other Authors: | Frans Kaashoek and Nickolai Zeldovich. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2014
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/85413 |
Similar Items
-
Fast bug finding in lock-free data structures with CB-DPOR
by: Van den Hooff, Jelle (Jelle August)
Published: (2014) -
Lock-free concurrent binomial heaps
by: Lowe, G
Published: (2018) -
Are lock-free concurrent algorithms practically wait-free?
by: Alistarh, Dan, et al.
Published: (2014) -
Optimism vs. locking : a study of concurrency control for client-server object-oriented databases
by: Gruber, Robert Edward
Published: (2005) -
Relaxed concurrent ordering structures
by: Kopinsky, Justin
Published: (2018)