174
views
0
recommends
+1 Recommend
1 collections
    0
    shares
       
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Reimplementation and Performance Evaluation of a Lock-free Queue with Batching

      Preprint
      In review
      research-article
      1 , 1 ,   1 ,
      ScienceOpen Preprints
      ScienceOpen
      lock-free queue, batching
      Bookmark

            Abstract

            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.

            Content

            Author and article information

            Journal
            ScienceOpen Preprints
            ScienceOpen
            31 May 2019
            Affiliations
            [1 ] UCF
            Article
            10.14293/S2199-1006.1.SOR-.PPHO1JO.v1
            bcd2b838-91b5-43a4-aa5a-50dade0c92d5

            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 the original work is properly cited. Conditions, terms of use and publishing policy can be found at www.scienceopen.com .


            The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.
            Data structures & Algorithms
            lock-free queue,batching

            Comments

            Comment on this article