Author:
Braginsky Anastasia,Cohen Nachshon,Petrank Erez
Publisher
Springer International Publishing
Reference19 articles.
1. Braginsky, A., Cohen, N., Petrank, E.: CBPQ: High performance lock-free priority queue (full version).
http://www.cs.technion.ac.il/~erez/papers.html
2. Braginsky, A., Kogan, A., Petrank, E.: Drop the anchor: lightweight memory management for non-blocking data structures. SPAA (2013)
3. Lecture Notes in Computer Science;A Braginsky,2011
4. Brown, T.A.: Reclaiming memory for lock-free data structures: There has to be a better way. In: PODC (2015)
5. Lecture Notes in Computer Science;I Calciu,2014
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Elimination (a,b)-trees with fast, durable updates;Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming;2022-03-28
2. BGPQ: A Heap-Based Priority Queue Design for GPUs;50th International Conference on Parallel Processing;2021-08-09
3. TSLQueue: An Efficient Lock-Free Design for Priority Queues;Euro-Par 2021: Parallel Processing;2021
4. KiWi;ACM Transactions on Parallel Computing;2020-08-05
5. LOFT;Proceedings of the 24th Symposium on Principles and Practice of Parallel Programming;2019-02-16