Restricted memory-friendly lock-free bounded queues

Nikita Koval, Vitaly Aksenov. Restricted memory-friendly lock-free bounded queues. In Rajiv Gupta, Xipeng Shen, editors, PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, February 22-26, 2020. pages 433-434, ACM, 2020. [doi]

@inproceedings{KovalA20,
  title = {Restricted memory-friendly lock-free bounded queues},
  author = {Nikita Koval and Vitaly Aksenov},
  year = {2020},
  doi = {10.1145/3332466.3374508},
  url = {https://doi.org/10.1145/3332466.3374508},
  researchr = {https://researchr.org/publication/KovalA20},
  cites = {0},
  citedby = {0},
  pages = {433-434},
  booktitle = {PPoPP '20: 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, San Diego, California, USA, February 22-26, 2020},
  editor = {Rajiv Gupta and Xipeng Shen},
  publisher = {ACM},
  isbn = {978-1-4503-6818-6},
}