{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T05:10:05Z","timestamp":1748495405923,"version":"3.41.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Hunan Provincial Department of Education Scientific Research Outstanding Youth Project","award":["22B0222"],"award-info":[{"award-number":["22B0222"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3569072","type":"journal-article","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T17:45:14Z","timestamp":1747071914000},"page":"90200-90211","source":"Crossref","is-referenced-by-count":0,"title":["TSC-IBR: A Variant of Interval-Based Memory Reclamation Using CPU\u2019s Time-Stamp Counter"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-3000-3261","authenticated-orcid":false,"given":"Chen","family":"Zhang","sequence":"first","affiliation":[{"name":"College of Information and Intelligence, Hunan Agricultural University, Changsha, China"}]},{"given":"Wendong","family":"Li","sequence":"additional","affiliation":[{"name":"College of Information and Intelligence, Hunan Agricultural University, Changsha, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7150-0008","authenticated-orcid":false,"given":"Xinghui","family":"Zhu","sequence":"additional","affiliation":[{"name":"College of Information and Intelligence, Hunan Agricultural University, Changsha, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486184"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767436"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3385412.3385978"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1062247.1062249"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571829"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3558481.3591102"},{"article-title":"Practical lock-freedom","year":"2004","author":"Fraser","key":"ref8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2007.04.010"},{"key":"ref10","first-page":"509","article-title":"Read-copy update: Using execution history to solve concurrency problems","volume-title":"Proc. Parallel Distrib. Comput. Syst.","author":"McKenney"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087588"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3178487.3178488"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00068"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2541228.2555297"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3503221.3508437"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3240302.3240305"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2676963"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3064015"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2926697.2926699"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374540"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12142"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2150976.2150998"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/11795490_3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/3453483.3454090"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755579"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814298"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3276513"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3409964.3461817"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755600"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2592798.2592808"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993821"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331575"},{"key":"ref33","article-title":"Crystalline: Fast and memory efficient wait-free reclamation","author":"Nikolaev","year":"2021","journal-title":"arXiv:2108.02763"},{"volume-title":"Intel 64 and IA-32 Architectures Software Developer\u2019s Manual","year":"2024","key":"ref34"},{"article-title":"A Scalable Concurrent malloc(3) Implementation for FreeBSD","year":"2006","author":"Evans","key":"ref35"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45414-4_21"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/2555243.2555256"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1504\/ijbic.2023.133508"},{"issue":"3","key":"ref39","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1504\/IJBIC.2024.10063188","article-title":"Artificial bee colony algorithm with multi-strategy adaptation","volume":"23","author":"Zhang","year":"2024","journal-title":"Int. J. Bio-Inspired Comput."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11000280.pdf?arnumber=11000280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,29]],"date-time":"2025-05-29T04:36:55Z","timestamp":1748493415000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11000280\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3569072","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}