{"oa_version":"None","volume":4,"abstract":[{"text":"The concurrent memory reclamation problem is that of devising a way for a deallocating thread to verify that no other concurrent threads hold references to a memory block being deallocated. To date, in the absence of automatic garbage collection, there is no satisfactory solution to this problem; existing tracking methods like hazard pointers, reference counters, or epoch-based techniques like RCU are either prohibitively expensive or require significant programming expertise to the extent that implementing them efficiently can be worthy of a publication. None of the existing techniques are automatic or even semi-automated.\r\nIn this article, we take a new approach to concurrent memory reclamation. Instead of manually tracking access to memory locations as done in techniques like hazard pointers, or restricting shared accesses to specific epoch boundaries as in RCU, our algorithm, called ThreadScan, leverages operating system signaling to automatically detect which memory locations are being accessed by concurrent threads.\r\nInitial empirical evidence shows that ThreadScan scales surprisingly well and requires negligible programming effort beyond the standard use of Malloc and Free.","lang":"eng"}],"date_updated":"2023-02-23T13:17:54Z","status":"public","date_created":"2019-02-14T13:24:11Z","author":[{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"William","last_name":"Leiserson","full_name":"Leiserson, William"},{"full_name":"Matveev, Alexander","first_name":"Alexander","last_name":"Matveev"},{"full_name":"Shavit, Nir","last_name":"Shavit","first_name":"Nir"}],"publication_status":"published","issue":"4","language":[{"iso":"eng"}],"publication":"ACM Transactions on Parallel Computing","article_number":"18","_id":"6001","scopus_import":1,"doi":"10.1145/3201897","type":"journal_article","intvolume":"         4","date_published":"2018-09-01T00:00:00Z","citation":{"chicago":"Alistarh, Dan-Adrian, William Leiserson, Alexander Matveev, and Nir Shavit. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>.","apa":"Alistarh, D.-A., Leiserson, W., Matveev, A., &#38; Shavit, N. (2018). ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3201897\">https://doi.org/10.1145/3201897</a>","ista":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. 2018. ThreadScan: Automatic and scalable memory reclamation. ACM Transactions on Parallel Computing. 4(4), 18.","mla":"Alistarh, Dan-Adrian, et al. “ThreadScan: Automatic and Scalable Memory Reclamation.” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4, 18, Association for Computing Machinery, 2018, doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>.","short":"D.-A. Alistarh, W. Leiserson, A. Matveev, N. Shavit, ACM Transactions on Parallel Computing 4 (2018).","ieee":"D.-A. Alistarh, W. Leiserson, A. Matveev, and N. Shavit, “ThreadScan: Automatic and scalable memory reclamation,” <i>ACM Transactions on Parallel Computing</i>, vol. 4, no. 4. Association for Computing Machinery, 2018.","ama":"Alistarh D-A, Leiserson W, Matveev A, Shavit N. ThreadScan: Automatic and scalable memory reclamation. <i>ACM Transactions on Parallel Computing</i>. 2018;4(4). doi:<a href=\"https://doi.org/10.1145/3201897\">10.1145/3201897</a>"},"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"779"}]},"quality_controlled":"1","title":"ThreadScan: Automatic and scalable memory reclamation","publication_identifier":{"issn":["2329-4949"]},"publisher":"Association for Computing Machinery","day":"01","department":[{"_id":"DaAl"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","month":"09","year":"2018"}