{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:33:34Z","timestamp":1780356814669,"version":"3.54.1"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","funder":[{"DOI":"10.13039\/501100002347","name":"Bundesministerium f\u00fcr Bildung und Forschung","doi-asserted-by":"publisher","award":["01IS18072"],"award-info":[{"award-number":["01IS18072"]}],"id":[{"id":"10.13039\/501100002347","id-type":"DOI","asserted-by":"publisher"}]},{"name":"German Science Foundation","award":["625\/7-2"],"award-info":[{"award-number":["625\/7-2"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2022,3,1]]},"DOI":"10.1109\/tpds.2021.3097901","type":"journal-article","created":{"date-parts":[[2021,8,10]],"date-time":"2021-08-10T23:05:01Z","timestamp":1628636701000},"page":"604-616","source":"Crossref","is-referenced-by-count":7,"title":["Fast and Portable Concurrent FIFO Queues With Deterministic Memory Reclamation"],"prefix":"10.1109","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6063-1651","authenticated-orcid":false,"given":"Oliver","family":"Giersch","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3818-5402","authenticated-orcid":false,"given":"Jorg","family":"Nolte","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34175-6_13"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40184-8_18"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2005.451"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3210377.3210388"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39958-9_18"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2442516.2442527"},{"key":"ref13","first-page":"28:1","article-title":"A scalable, portable, and memory-efficient lock-free FIFO queue","author":"nikolaev","year":"2019","journal-title":"Proc 33rd Int Symp Distrib Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.41"},{"key":"ref15","article-title":"FAAArrayQueue - MPMC lock-free queue","author":"ramalhete","year":"2016"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851168"},{"key":"ref17","article-title":"Wait-free bounded vs wait-free unbounded","author":"ramalhete","year":"2016"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/383962.384016"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2008.167"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2015.24"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3276513"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/996841.996848"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1109\/TPDS.2011.159","article-title":"User-level implementations of read-copy update","volume":"23","author":"mathieu","year":"2012","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17653-1_23"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/248052.248106"},{"key":"ref2","article-title":"Practical and efficient lock-free garbage collection based on reference counting","author":"gidenstam","year":"2005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1810479.1810540"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2006.10.001"},{"key":"ref20","article-title":"Practical lock-freedom","author":"fraser","year":"2004"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178488"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/564879.564881"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385978"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/9497774\/09490347.pdf?arnumber=9490347","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,1]],"date-time":"2021-11-01T20:00:21Z","timestamp":1635796821000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9490347\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,1]]},"references-count":33,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2021.3097901","relation":{},"ISSN":["1045-9219","1558-2183","2161-9883"],"issn-type":[{"value":"1045-9219","type":"print"},{"value":"1558-2183","type":"electronic"},{"value":"2161-9883","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,1]]}}}