A Survey on Lock-free Binary Search Tree
- Authors
- Lee, S.; Cho, S.; Pham, K.T.; Kim, S.; Son, Y.
- Issue Date
- Oct-2022
- Publisher
- IEEE Computer Society
- Keywords
- Binary Search Tree (BST); Concurrency; Data Structure; Lock-Free Algorithm
- Citation
- International Conference on ICT Convergence, v.2022-October, pp 1136 - 1138
- Pages
- 3
- Journal Title
- International Conference on ICT Convergence
- Volume
- 2022-October
- Start Page
- 1136
- End Page
- 1138
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60824
- DOI
- 10.1109/ICTC55196.2022.9952812
- ISSN
- 2162-1233
- Abstract
- Binary Search Tree is the data structure that has fast search speed and easy addition, removal of elements. Due to these advantages, binary search tree (BST) is one of the frequently used data structures of these days. However, most binary search tree schemes use locking technique to support multiple access of multiple threads for synchronization. Unfortunately, this locking techniques significantly reduce the performance of BST. Locking techniques block or spin the threads that has not obtained the lock until the thread that has obtained the lock completes its job. Thus, to improve the performance of BST, efficient concurrent programming technique should be applied, such as lock-free technique. In this paper, we conduct a comparison of existing lock-free/non-blocking BST methods. We analyze operations and evaluate the strengths and weaknesses of each schemes.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60824)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.