ACM Transactions on Programming Languages and Systems (TOPLAS)
Selecting locking primitives for parallel programming
Communications of the ACM
Real-time computing with lock-free shared objects
ACM Transactions on Computer Systems (TOCS)
On concurrent programming
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
On Reducing False Sharing While Improving Locality on Shared Memory Multiprocessors
PACT '99 Proceedings of the 1999 International Conference on Parallel Architectures and Compilation Techniques
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms
Hazard Pointers: Safe Memory Reclamation for Lock-Free Objects
IEEE Transactions on Parallel and Distributed Systems
Exploiting deferred destruction: an analysis of read-copy-update techniques in operating system kernels
Performance of memory reclamation for lockless synchronization
Journal of Parallel and Distributed Computing
Queue - The Concurrency Problem
A Better x86 Memory Model: x86-TSO
TPHOLs '09 Proceedings of the 22nd International Conference on Theorem Proving in Higher Order Logics
The repeat offender problem: a mechanism for supporting dynamic-sized lock-free data structures
The repeat offender problem: a mechanism for supporting dynamic-sized lock-free data structures
Sequential verification of serializability
Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The Art of Multiprocessor Programming
The Art of Multiprocessor Programming
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
User-Level Implementations of Read-Copy Update
IEEE Transactions on Parallel and Distributed Systems
Lock cohorting: a general technique for designing NUMA locks
Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming
Fence-free work stealing on bounded TSO processors
Proceedings of the 19th international conference on Architectural support for programming languages and operating systems
| Hi-index | 48.22 |
Exploring an alternative to lock-based synchronization.