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

      Re-implementation of Lock-free Contention Adapting Search Trees Using MRLock

      Preprint
      In review
      research-article
      Bookmark

            Abstract

            To explore multi-core programming, we re-implement the Lock Free Contention Adapting Search Tree. We follow the structure of the original, using immutable treaps as leaf nodes implemented with an array for better performance with memory caching. The initial re-implementation uses coarse-grained locking with MRLock to provide thread-safety. This will be extended to be lock-free in a future publication.

            Content

            Author and article information

            Journal
            ScienceOpen Preprints
            ScienceOpen
            23 March 2020
            Affiliations
            [1 ] University of Central Florida
            Article
            10.14293/S2199-1006.1.SOR-.PPIV7TZ.v1
            74675d5c-aeb0-4d11-bc93-797a0c51ee4e

            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 in the repository: https://github.com/kboyles8/lock-free-search-tree
            Data structures & Algorithms
            coarse-grained locking,multi-core programming,lock-free,MRLock,tree

            Comments

            Comment on this article