{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:18:40Z","timestamp":1740133120493,"version":"3.37.3"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100003662","name":"IT R&D program of MKE\/KEIT","doi-asserted-by":"publisher","award":["10041244"],"award-info":[{"award-number":["10041244"]}],"id":[{"id":"10.13039\/501100003662","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003621","name":"MSIP","doi-asserted-by":"publisher","award":["NIPA-2014 H0301-14-1020"],"award-info":[{"award-number":["NIPA-2014 H0301-14-1020"]}],"id":[{"id":"10.13039\/501100003621","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Information Technology Research Center","award":["NIPA-2014 H0301-14-1020"],"award-info":[{"award-number":["NIPA-2014 H0301-14-1020"]}]},{"DOI":"10.13039\/501100003665","name":"National IT Industry Promotion Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tpds.2014.2333007","type":"journal-article","created":{"date-parts":[[2014,6,25]],"date-time":"2014-06-25T14:34:30Z","timestamp":1403706870000},"page":"1910-1922","source":"Crossref","is-referenced-by-count":4,"title":["Integrating Lock-Free and Combining Techniques for a Practical and Scalable FIFO Queue"],"prefix":"10.1109","volume":"26","author":[{"given":"Changwoo","family":"Min","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young Ik","family":"Eom","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"0","key":"ref39"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/2483852.2483868"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1109\/TPDS.2011.159"},{"key":"ref32","first-page":"297","article-title":"Using read-copy-update techniques for system V IPC in the Linux 2.5 Kernel","author":"arcangeli","year":"0","journal-title":"Proc USENIX Annu Technical Conf Freenix Track"},{"key":"ref31","first-page":"509","article-title":"Read-copy update: Using execution history to solve concurrency problems","author":"mckenney","year":"0","journal-title":"Proc Parallel Distrib Comput Syst Conf"},{"year":"1995","author":"mckenney","article-title":"Apparatus and method for achieving reduced overhead mutual exclusion and maintaining coherency in a multiprocessor system utilizing execution history and thread monitoring","key":"ref30"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/ICDCS.2003.1203503"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/2145816.2145835"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1145\/1007912.1007944"},{"year":"2004","author":"fraser","article-title":"Practical lock-freedom","key":"ref34"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1145\/248052.248106"},{"year":"1993","author":"craig","article-title":"Building FIFO and priority-queuing spin locks from atomic swap","key":"ref40"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/s00446-007-0050-0"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1587\/transinf.E95.D.2956"},{"key":"ref13","first-page":"253","article-title":"Using elimination to implement scalable and lock-free FIFO queues","author":"moir","year":"0","journal-title":"Proc 17th Annu ACM Symp Parallel Algorithms Arch"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/978-3-540-77096-1_29"},{"key":"ref15","first-page":"396","article-title":"Adaptive backoff synchronization techniques","author":"agarwal","year":"0","journal-title":"Proc 16th Annu Int Symp Comput Archit"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1145\/2442516.2442527"},{"key":"ref17","first-page":"182","article-title":"Executing parallel programs with synchronization bottlenecks efficiently","author":"oyama","year":"0","journal-title":"Proc Int Workshop Parallel Distrib Comput Symbolic Irregular Appl"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1145\/1810479.1810540"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/2145816.2145849"},{"year":"0","author":"vyukov","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/PACT.2013.6618816"},{"year":"1987","author":"mellor-crummey","article-title":"Concurrent queues: Practical fetch-and- $\\Phi$ algorithms","key":"ref27"},{"year":"0","key":"ref3"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1145\/2421648.2421659"},{"year":"0","author":"desnoyers","key":"ref29"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1109\/PACT.2011.9"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36108-1_23","article-title":"The repeat offender problem: A mechanism for supporting dynamic-sized lock-free data structures","author":"herlihy","year":"2002"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1109\/TPDS.2004.8"},{"year":"0","key":"ref2"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1016\/j.jpdc.2007.04.010"},{"year":"0","author":"lea","key":"ref1"},{"doi-asserted-by":"publisher","key":"ref46","DOI":"10.1145\/153724.153741"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/978-3-642-15763-9_8"},{"doi-asserted-by":"publisher","key":"ref45","DOI":"10.1145\/78969.78972"},{"year":"2006","author":"detlefs","article-title":"Lock free reference counting","key":"ref22"},{"year":"2001","journal-title":"Introduction to Algorithms","key":"ref47"},{"year":"2007","author":"moir","article-title":"Single-word lock-free reference counting","key":"ref21"},{"year":"0","key":"ref42"},{"year":"1986","author":"treiber","journal-title":"Systems Programming Coping with Parallelism","key":"ref24"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/IPPS.1994.288305"},{"year":"2004","author":"michael","article-title":"Method for efficient implementation of dynamic lock-free data structures with safe memory reclamation","key":"ref23"},{"year":"0","key":"ref44"},{"key":"ref26","first-page":"388","article-title":"Distributing hot-spot addressing in large-scale multiprocessors","volume":"tc 36","author":"yew","year":"1987","journal-title":"IEEE Trans Comput"},{"year":"0","key":"ref43"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1145\/114005.102808"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7121064\/06844158.pdf?arnumber=6844158","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:40:56Z","timestamp":1641987656000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6844158\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":47,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2014.2333007","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}