3 papers
cs.DC2023
The Fence Complexity of Persistent Sets
Gaetano Coccimiglio, Trevor Brown, Srivatsan Ravi
We study the psync complexity of concurrent sets in the non-volatile shared memory model. Flush instructions are used in non-volatile memory to force shared state to be written bac…
cs.DC2023
Efficient Hardware Primitives for Immediate Memory Reclamation in Optimistic Data Structures
Ajay Singh, Trevor Brown, Michael Spear
Safe memory reclamation (SMR) algorithms are crucial for preventing use-after-free errors in optimistic data structures. SMR algorithms typically delay reclamation for safety and r…
cs.DC2021
Elimination (a,b)-trees with fast, durable updates
Anubhav Srivastava, Trevor Brown
Many concurrent dictionary implementations are designed and optimized for read-mostly workloads with uniformly distributed keys, and often perform poorly on update-heavy workloads.…