A Survey on Lock-free Binary Search Tree
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, S. | - |
dc.contributor.author | Cho, S. | - |
dc.contributor.author | Pham, K.T. | - |
dc.contributor.author | Kim, S. | - |
dc.contributor.author | Son, Y. | - |
dc.date.accessioned | 2023-02-21T02:41:11Z | - |
dc.date.available | 2023-02-21T02:41:11Z | - |
dc.date.issued | 2022-10 | - |
dc.identifier.issn | 2162-1233 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/60824 | - |
dc.description.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. | - |
dc.format.extent | 3 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE Computer Society | - |
dc.title | A Survey on Lock-free Binary Search Tree | - |
dc.type | Article | - |
dc.identifier.doi | 10.1109/ICTC55196.2022.9952812 | - |
dc.identifier.bibliographicCitation | International Conference on ICT Convergence, v.2022-October, pp 1136 - 1138 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.scopusid | 2-s2.0-85143253500 | - |
dc.citation.endPage | 1138 | - |
dc.citation.startPage | 1136 | - |
dc.citation.title | International Conference on ICT Convergence | - |
dc.citation.volume | 2022-October | - |
dc.type.docType | Conference Paper | - |
dc.publisher.location | 미국 | - |
dc.subject.keywordAuthor | Binary Search Tree (BST) | - |
dc.subject.keywordAuthor | Concurrency | - |
dc.subject.keywordAuthor | Data Structure | - |
dc.subject.keywordAuthor | Lock-Free Algorithm | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.