1. Fast Non-blocking Persistence for Concurrent Data Structures. In 35th Intl. Symp. on Distributed Computing (DISC). Freiburg;Cai Wentao;Germany,2021
2. Wentao Cai , Haosen Wen , and Michael L . Scott . 2023 . Transactional Composition of Nonblocking Data Structures . arXiv preprint arXiv:2301.00996. Wentao Cai, Haosen Wen, and Michael L. Scott. 2023. Transactional Composition of Nonblocking Data Structures. arXiv preprint arXiv:2301.00996.
3. The Transaction Processing Council. 2010. TPC-C Benchmark (Revision 5.11.0). http://www.tpc.org/tpcc/. The Transaction Processing Council. 2010. TPC-C Benchmark (Revision 5.11.0). http://www.tpc.org/tpcc/.
4. Keir Fraser. 2003. Practical Lock-Freedom. Ph.D. Dissertation. King's College , Univ. of Cambridge. Published as Univ. of Cambridge Computer Laboratory technical report #579 , February 2004 . www.cl.cam.ac.uk/techreports/UCAM-CL-TR-579.pdf. Keir Fraser. 2003. Practical Lock-Freedom. Ph.D. Dissertation. King's College, Univ. of Cambridge. Published as Univ. of Cambridge Computer Laboratory technical report #579, February 2004. www.cl.cam.ac.uk/techreports/UCAM-CL-TR-579.pdf.
5. NVTraverse: in NVRAM data structures, the destination is more important than the journey