Showing cs.DCShow all
2 papers · 1 filter
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.…