{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:18:31Z","timestamp":1740133111108,"version":"3.37.3"},"reference-count":22,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61702499"],"award-info":[{"award-number":["61702499"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"crossref","award":["2016QY04W0804"],"award-info":[{"award-number":["2016QY04W0804"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100005089","name":"Beijing Municipal Natural Science Foundation","doi-asserted-by":"publisher","award":["4172069"],"award-info":[{"award-number":["4172069"]}],"id":[{"id":"10.13039\/501100005089","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2019,7,1]]},"DOI":"10.1109\/tpds.2018.2889048","type":"journal-article","created":{"date-parts":[[2018,12,21]],"date-time":"2018-12-21T19:50:46Z","timestamp":1545421846000},"page":"1596-1612","source":"Crossref","is-referenced-by-count":2,"title":["Fast Wait-Free Construction for Pool-Like Objects with Weakened Internal Order: Stacks as an Example"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8482-3631","authenticated-orcid":false,"given":"Yaqiong","family":"Peng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaochun","family":"Yun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyu","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"1986","author":"treiber","article-title":"Systems programming: Coping with parallelism","key":"ref10"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1145\/78969.78972"},{"year":"2013","key":"ref12"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-319-26850-7_1"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1145\/2517327.2442527"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1109\/ICDCS.2003.1203503"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/2429069.2429109"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1145\/3087556.3087582"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1145\/3210377.3210388","article-title":"BQ: A lock-free queue with batching","author":"milman","year":"2018","journal-title":"Proc 30th Symp Parallelism Algorithms Archit"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/3178487.3178490"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/2370036.2145835","article-title":"A methodology for creating fast wait-free data structures","volume":"47","author":"kogan","year":"2012","journal-title":"SIGPlan Notices"},{"key":"ref3","first-page":"16:1","article-title":"A wait-free queue as fast as fetch-and-add","author":"yang","year":"2016","journal-title":"Proc 21st ACM SIGPLAN Symp Principles Practice Parallel Program"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2767386.2767415"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1145\/2555243.2555261"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TPDS.2017.2770121"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/1989493.1989549"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/2775051.2676963"},{"year":"2014","author":"dodds","article-title":"Fast concurrent data-structures through explicit timestamping","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/1007912.1007944"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1145\/1810479.1810540"},{"key":"ref22","first-page":"260","article-title":"Automatic memory reclamation for lock-free data structures","author":"cohen","year":"2015","journal-title":"Proc ACM SIGPLAN Int Conf Object-Oriented Program Syst Lang Appl"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/2370036.2145849"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/8735966\/08585072.pdf?arnumber=8585072","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:53:49Z","timestamp":1657745629000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8585072\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,1]]},"references-count":22,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2018.2889048","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"type":"print","value":"1045-9219"},{"type":"electronic","value":"1558-2183"},{"type":"electronic","value":"2161-9883"}],"subject":[],"published":{"date-parts":[[2019,7,1]]}}}