5 citations · 5 across the 4 of their papers we have counts for
4 papers
Publish on Ping: A Better Way to Publish Reservations in Memory Reclamation for Concurrent Data Structures
Ajay Singh, Trevor Brown
Safe memory reclamation techniques that utilize per read reservations, such as hazard pointers, often cause significant overhead in traversals of linked concurrent data structures.…
Are Your Epochs Too Epic? Batch Free Can Be Harmful
Daewoo Kim, Trevor Brown, Ajay Singh
Epoch based memory reclamation (EBR) is one of the most popular techniques for reclaiming memory in lock-free and optimistic locking data structures, due to its ease of use and goo…
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…
NBR: Neutralization Based Reclamation
Ajay Singh, Trevor Brown, Ali Mashtizadeh
Safe memory reclamation (SMR) algorithms suffer from a trade-off between bounding unreclaimed memory and the speed of reclamation. Hazard pointer (HP) based algorithms bound unrecl…