상세 보기
A Survey on Lock-free Binary Search Tree
- Lee, S.;
- Cho, S.;
- Pham, K.T.;
- Kim, S.;
- Son, Y.
SCOPUS
1초록
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.
키워드
- 제목
- A Survey on Lock-free Binary Search Tree
- 저자
- Lee, S.; Cho, S.; Pham, K.T.; Kim, S.; Son, Y.
- 발행일
- 2022-10
- 유형
- Conference Paper
- 저널명
- International Conference on ICT Convergence
- 권
- 2022-October
- 페이지
- 1136 ~ 1138
- 언어
- ENG
- 출판사
- IEEE Computer Society
- 발행국가
- 미국
- 분량
- 3 페이지
- ISSN
- P 2162-1233