BQ-Reference-Cited by-同舟云学术

Published:2018-07-11 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Milman Gal¹,Kogan Alex²,Lev Yossi²,Luchangco Victor²,Petrank Erez¹

Affiliation:

1. Technion, Haifa, Israel

2. Oracle Labs, Burlington, MA, USA

Funder

the Israel Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3210377.3210388

Reference28 articles.

1. Nachshon Cohen and Erez Petrank . 2015. Efficient memory management for lock-free data structures with optimistic access SPAA. 10.1145/2755573.2755579 Nachshon Cohen and Erez Petrank . 2015. Efficient memory management for lock-free data structures with optimistic access SPAA. 10.1145/2755573.2755579

2. Robert Colvin and Lindsay Groves . 2005. Formal verification of an array-based nonblocking queue ICECCS. 10.1109/ICECCS.2005.49 Robert Colvin and Lindsay Groves . 2005. Formal verification of an array-based nonblocking queue ICECCS. 10.1109/ICECCS.2005.49

3. Panagiota Fatourou and Nikolaos D. Kallimanis . 2011. A highly-efficient wait-free universal construction SPAA. 10.1145/1989493.1989549 Panagiota Fatourou and Nikolaos D. Kallimanis . 2011. A highly-efficient wait-free universal construction SPAA. 10.1145/1989493.1989549

4. Panagiota Fatourou and Nikolaos D. Kallimanis . 2012. Revisiting the combining synchronization technique PPoPP. 10.1145/2145816.2145849 Panagiota Fatourou and Nikolaos D. Kallimanis . 2012. Revisiting the combining synchronization technique PPoPP. 10.1145/2145816.2145849

Cited by 17 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SPAMeR: Speculative Push for Anticipated Message Requests in Multi-Core Systems;Proceedings of the 51st International Conference on Parallel Processing;2022-08-29

2. wCQ;Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures;2022-07-11

3. Efficient parallel graph trimming by arc-consistency;The Journal of Supercomputing;2022-04-16

4. A Parallel, O(n) Algorithm for an Unbiased, Thin Watershed;Image Processing On Line;2022-04-08

5. BQ: A Lock-Free Queue with Batching;ACM Transactions on Parallel Computing;2022-03-23