Synthesis: an efficient implementation of fundamental operating system services
Synthesis: an efficient implementation of fundamental operating system services
Lock-free linked lists using compare-and-swap
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
The Repeat Offender Problem: A Mechanism for Supporting Dynamic-Sized, Lock-Free Data Structures
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Correction of a Memory Management Method for Lock-Free Data Structures
Correction of a Memory Management Method for Lock-Free Data Structures
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
IEEE Transactions on Parallel and Distributed Systems
Performance of memory reclamation for lockless synchronization
Journal of Parallel and Distributed Computing
Communications of the ACM - Rural engineering development
User-Level Implementations of Read-Copy Update
IEEE Transactions on Parallel and Distributed Systems
How FIFO is your concurrent FIFO queue?
Proceedings of the 2012 ACM workshop on Relaxing synchronization for multicore and manycore scalability
Transactional Memory Architecture and Implementation for IBM System Z
MICRO-45 Proceedings of the 2012 45th Annual IEEE/ACM International Symposium on Microarchitecture
The balancing act of choosing nonblocking features
Communications of the ACM
The Balancing Act of Choosing Nonblocking Features
Queue - Development
| Hi-index | 0.02 |
We simply do not have a synchronization mechanism that can enforce mutual exclusion.