Affiliation:
1. KAIST, Daejeon, Republic of Korea
Funder
Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education
Institute for Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT)
Reference49 articles.
1. Forkscan
2. ThreadScan
3. A practical concurrent binary search tree
4. Trevor Brown. 2017a. Reclaiming memory for lock-free data structures: there has to be a better way. CoRR , Vol. abs/1712.01044 (2017). showeprint[arXiv]1712.01044 http://arxiv.org/abs/1712.01044
5. Trevor Brown. 2017b. Techniques for Constructing Efficient Lock-free Data Structures. https://doi.org/10.48550/ARXIV.1712.05406