Implementation of Scalable Lock-Free Vector with Combining

In Scalable Lock-Free Vector with Combining [1], Walulya and Tsigas introduce the ﬁrst implementation of a concurrent, lock-free vector that utilizes combining to increase performance. In our project, we implement this concurrent vector as described in [1] and describe our approach here. We also implement a concurrent vector utilizing a Software Transactional Memory library. We compare the performance of our two implementations to each other and to the authors performance evaluations.

Content

Author and article information

Journal

Title: ScienceOpen Preprints

Publisher: ScienceOpen

Publication date (Electronic preprint): 30 May 2019

Affiliations

[1 ] University of Central Florida

Author information

COP 4520 https://orcid.org/0000-0002-4592-0850

Article

DOI: 10.14293/S2199-1006.1.SOR-.PPMISNL.v1

SO-VID: ec16c1fe-56f3-4694-ac42-36cf9e8d7e4a

License:

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 .

History

Data availability: The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request.

ScienceOpen disciplines: Data structures & Algorithms

Keywords: lock-free vector,concurrent vector,Software Transactional Memory