共 50 条
- [1] Every Data Structure Deserves Lock-Free Memory Reclamation PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2018, 2
- [3] Memory Reclamation Methods for Lock-Free Hash Tries 2019 31ST INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING (SBAC-PAD 2019), 2019, : 188 - 195
- [4] Snapshot-Free, Transparent, and Robust Memory Reclamation for Lock-Free Data Structures PROCEEDINGS OF THE 42ND ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '21), 2021, : 987 - 1002
- [5] Decoupling Lock-Free Data Structures from Memory Reclamation for Static Analysis PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2019, 3 (POPL):
- [6] Pointer Life Cycle Types for Lock-Free Data Structures with Memory Reclamation PROCEEDINGS OF THE ACM ON PROGRAMMING LANGUAGES-PACMPL, 2020, 4 (POPL):
- [7] Transactional memory as an approach to building a lock-free data structure 7TH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT (ITQM 2019): INFORMATION TECHNOLOGY AND QUANTITATIVE MANAGEMENT BASED ON ARTIFICIAL INTELLIGENCE, 2019, 162 : 76 - 81