{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:23:38Z","timestamp":1755926618696,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472475","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:39:57Z","timestamp":1633459197000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["A Universal Construction to implement Concurrent Data Structure for NUMA-muticore"],"prefix":"10.1145","author":[{"given":"zhengming","family":"yi","sequence":"first","affiliation":[{"name":"National University of Defense Technology"}]},{"given":"yiping","family":"yao","sequence":"additional","affiliation":[{"name":"National University of Defense Technology"}]},{"given":"Kai","family":"Chen","sequence":"additional","affiliation":[{"name":"National University of Defense Technology"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"[\n  1\n  ]  N. Shavit and D. Touitou. Software Transactional Memory. PODC\u2019 97.  [1] N. Shavit and D. Touitou. Software Transactional Memory. PODC\u2019 97.","DOI":"10.1007\/978-3-642-27848-8_607-1"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297858.3304040"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815400.2815406"},{"key":"e_1_3_2_1_4_1","unstructured":"[\n  4\n  ]  Paul E McKenney and John D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509\u2013518.  [4] Paul E McKenney and John D Slingwine. 1998. Read-copy update: Using execution history to solve concurrency problems. In Parallel and Distributed Computing and Systems. 509\u2013518."},{"volume-title":"Proceedings of the 22nd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM","author":"Calciu Irina","key":"e_1_3_2_1_5_1","unstructured":"[ 5 ] Irina Calciu , Siddhartha Sen , Mahesh Balakrishnan , and Marcos K. Aguilera . 2017. Black-box Concurrent Data Structures for NUMA Architectures . In Proceedings of the 22nd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM , Xi\u2019an, China, 207\u2013221. [5] Irina Calciu, Siddhartha Sen, Mahesh Balakrishnan, and Marcos K. Aguilera. 2017. Black-box Concurrent Data Structures for NUMA Architectures. In Proceedings of the 22nd ACM International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS). ACM, Xi\u2019an, China, 207\u2013221."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132771"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3342195.3387527"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132747.3132771"},{"key":"e_1_3_2_1_9_1","unstructured":"[\n  9\n  ]  C. Cascaval C. Blundell M. Michael H. W. Cain P. Wu S. Chiras and S. Chatterjee. Software Transactional Memory: Why Is It Only a Research Toy? ACM Queue \u201908.  [9] C. Cascaval C. Blundell M. Michael H. W. Cain P. Wu S. Chiras and S. Chatterjee. Software Transactional Memory: Why Is It Only a Research Toy? ACM Queue \u201908."},{"key":"e_1_3_2_1_10_1","volume-title":"Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13:124\u2013 149","author":"Herlihy M.","year":"1991","unstructured":"[ 10 ] M. Herlihy . Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13:124\u2013 149 , 1991 . [10] M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems (TOPLAS), 13:124\u2013 149, 1991."},{"key":"e_1_3_2_1_11_1","volume-title":"A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 15:745\u2013770","author":"Herlihy M.","year":"1993","unstructured":"[ 11 ] M. Herlihy . A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 15:745\u2013770 , 1993 . [11] M. Herlihy. A methodology for implementing highly concurrent data objects. ACM Transactions on Programming Languages and Systems (TOPLAS), 15:745\u2013770, 1993."},{"key":"e_1_3_2_1_12_1","volume-title":"Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5:190\u2013222","author":"Lamport L.","year":"1983","unstructured":"[ 12 ] L. Lamport . Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5:190\u2013222 , 1983 . [12] L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems (TOPLAS), 5:190\u2013222, 1983."},{"key":"e_1_3_2_1_13_1","first-page":"82","volume-title":"Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures","author":"Michael M. M.","unstructured":"[ 13 ] M. M. Michael . High performance dynamic lock-free hash tables and list-based sets . In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures , pages 73\u2013 82 . ACM, 2002. [13] M. M. Michael. High performance dynamic lock-free hash tables and list-based sets. In Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures, pages 73\u201382. ACM, 2002."},{"key":"e_1_3_2_1_14_1","first-page":"121","volume-title":"International Symposium on Distributed Computing","author":"Purcell C.","unstructured":"[ 14 ] C. Purcell and T. Harris . Non-blocking hashtables with open addressing . In International Symposium on Distributed Computing , pages 108\u2013 121 . Springer, 2005. [14] C. Purcell and T. Harris. Non-blocking hashtables with open addressing. In International Symposium on Distributed Computing, pages 108\u2013121. Springer, 2005."},{"key":"e_1_3_2_1_15_1","first-page":"2003","volume-title":"Parallel and Distributed Processing Symposium, 2003. Proceedings. International","author":"Sundell H.","unstructured":"[ 15 ] H. Sundell and P. Tsigas . Fast and lock-free concurrent priority queues for multi-thread systems . In Parallel and Distributed Processing Symposium, 2003. Proceedings. International , pages 11\u2013pp. IEEE, 2003 . [15] H. Sundell and P. Tsigas. Fast and lock-free concurrent priority queues for multi-thread systems. In Parallel and Distributed Processing Symposium, 2003. Proceedings. International, pages 11\u2013pp. IEEE, 2003."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/269459"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935796"},{"key":"e_1_3_2_1_18_1","volume-title":"May","author":"Herlihy M.","year":"1993","unstructured":"[ 18 ] M. Herlihy and J. E. B. Moss . Transactional memory: Architectural support for lock-free data structures. ACM SIGARCH Computer Architecture News, 21(2):289\u2013300 , May 1993 . [18] M. Herlihy and J. E. B. Moss. Transactional memory: Architectural support for lock-free data structures. ACM SIGARCH Computer Architecture News, 21(2):289\u2013300, May 1993."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1734069"},{"key":"e_1_3_2_1_20_1","volume-title":"McKenney and Aravinda Prasad","author":"Paul","year":"2015","unstructured":"[ 20 ] Paul E. McKenney and Aravinda Prasad . 2015 . Some more details on Read-Log-Update . (2015). https:\/\/lwn.net\/Articles\/667720\/. [20] Paul E. McKenney and Aravinda Prasad. 2015. Some more details on Read-Log-Update. (2015). https:\/\/lwn.net\/Articles\/667720\/."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-013-9491-y"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/142111.964613"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/114005.102808"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463710"},{"key":"e_1_3_2_1_26_1","volume-title":"Proceedings of the 25rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201920)","author":"Correia Andreia","year":"2020","unstructured":"[ 26 ] Andreia Correia , Pedro Ramalhete , and Pascal Felber . 2020 . A Wait-Free Universal Construct for Large Objects . In Proceedings of the 25rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201920) . [26] Andreia Correia, Pedro Ramalhete, and Pascal Felber. 2020. A Wait-Free Universal Construct for Large Objects. In Proceedings of the 25rd ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP \u201920)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178519"},{"key":"e_1_3_2_1_29_1","volume-title":"NUMA-Aware Reader-Writer Locks. PPoPP 2013","author":"Calciu Irina","year":"2013","unstructured":"[ 29 ] Irina Calciu , Dave Dice , Yossi Lev , Victor Luchangco , Virendra J. Marathe , and Nir Shavit . 2013. NUMA-Aware Reader-Writer Locks. PPoPP 2013 ( 2013 ). [29] Irina Calciu, Dave Dice, Yossi Lev, Victor Luchangco, Virendra J. Marathe, and Nir Shavit. 2013. NUMA-Aware Reader-Writer Locks. PPoPP 2013 (2013)."},{"key":"e_1_3_2_1_30_1","volume-title":"Jan.","author":"Lozi J.-P.","year":"2016","unstructured":"[30] J.-P. Lozi , F. David , G. Thomas , J. Lawall , and G. Muller . Fast and Portable Locking for Multicore Architectures. ACM Trans. Comput. Syst., 33(4):13:1\u201313:62 , Jan. 2016 . [30]J.-P. Lozi, F. David, G. Thomas, J. Lawall, and G. Muller. Fast and Portable Locking for Multicore Architectures. ACM Trans. Comput. Syst., 33(4):13:1\u201313:62, Jan. 2016."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851146"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"e_1_3_2_1_33_1","unstructured":"[\n  33\n  ]  T. David R. Guerraoui and V. Trigonakis. Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask. SOSP \u201913.  [33] T. David R. Guerraoui and V. Trigonakis. Everything You Always Wanted to Know About Synchronization but Were Afraid to Ask. SOSP \u201913."},{"key":"e_1_3_2_1_34_1","unstructured":"[\n  34\n  ]  FAL Labs. 2011. Kyoto Cabinet: a straightforward implementation of DBM. http:\/\/fallabs.com\/kyotocabinet\/.  [34] FAL Labs. 2011. Kyoto Cabinet: a straightforward implementation of DBM. http:\/\/fallabs.com\/kyotocabinet\/."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612696"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2016.2630695"},{"key":"e_1_3_2_1_37_1","unstructured":"[\n  37\n  ]  Dmitry Vyukov. Distributed Reader-Writer Mutex. http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/ reader-writer-problem\/distributed-reader-writer-mutex.  [37] Dmitry Vyukov. Distributed Reader-Writer Mutex. http:\/\/www.1024cores.net\/home\/lock-free-algorithms\/ reader-writer-problem\/distributed-reader-writer-mutex."},{"key":"e_1_3_2_1_38_1","volume-title":"Dec.","author":"Balakrishnan M.","year":"2013","unstructured":"[ 38 ] M. Balakrishnan , D. Malkhi , J. P. Davis , V. Prabhakaran , M. Wei , and T. Wobber . CORFU: A distributed shared log. ACM Transactions on Computer Systems, 31(4) , Dec. 2013 . [38] M. Balakrishnan, D. Malkhi, J. P. Davis, V. Prabhakaran, M. Wei, and T. Wobber. CORFU: A distributed shared log. ACM Transactions on Computer Systems, 31(4), Dec. 2013."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2015.83"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472475","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472475","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:11Z","timestamp":1750193291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472475"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":38,"alternative-id":["10.1145\/3472456.3472475","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472475","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}