ABSTRACT
No abstract available.
- Harris, T. A Pragmatic Implementation of Non-Blocking Linked Lists. In Proceedings of the 15th International Conference on Distributed Computing. Google ScholarDigital Library
- Michael, M. High Performance Dynamic Lock-Free Hash Tables and List-Based Sets. In Proceedings of the 14th Annual ACM Symposium on Parallel Algorithms and Architectures. Google ScholarDigital Library
Index Terms
- Brief announcement: implementing multi-word atomic snapshots on current hardware
Recommendations
Brief Announcement: Hazard Eras - Non-Blocking Memory Reclamation
SPAA '17: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and ArchitecturesFor non-blocking data-structures, only memory reclamation with pointer-based techniques can maintain non-blocking progress, but there can be high overhead associated to these techniques, with the most notable example being Hazard Pointers. We present a ...
Static analysis of atomicity for programs with non-blocking synchronization
PPoPP '05: Proceedings of the tenth ACM SIGPLAN symposium on Principles and practice of parallel programmingIn concurrent programming, non-blocking synchronization is very efficient but difficult to design correctly. This paper presents a static analysis to show that code blocks are atomic, i.e., that every execution of the program is equivalent to one in ...
A Wait-Free Multi-Word Compare-and-Swap Operation
The number of cores in future multi-core systems are expected to increase by 100 fold over the next decade. The fine-grained synchronization methods found in wait-free algorithm designs makes them desirable for these future systems. Unfortunately, such ...
Comments