This paper describes an implementation of a lock-free queue that utilizes batching to increase performance by up to 16x over standard lock-free queues. We attempted to implement the design and algorithms from the original research paper BQ: A Lock-Free Queue with Batching and tried to reproduce similar functionality and performance. The original implementation of this data structure was done in C++, but we wanted to try and build this in Java so we could compare the results of how the data structure performs in two different languages.
Author and article information
This work has been published open access under Creative Commons Attribution License
CC BY 4.0, which permits unrestricted use, distribution, and reproduction in any medium, provided
can be found at
Data availability: The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.