{"title":"StackTrack: An automated transactional approach to concurrent memory reclamation","status":"public","acknowledgement":"Dan Alistarh - Part  of  this  work  was  performed  while  the  author  was  a  Postdoctoral\r\nAssociate a MIT CSAIL, supported in part by NSF grant CCF-1217921,\r\nDoE ASCR grant ER26116/DE-SC0008923, and by grants from the Oracle\r\nand Intel corporations.\r\nPatrick Eugester - Supported in part by DARPA grant N11AP20014 and NSF grant CNS-\r\n1117065.\r\nMaurice Herlihy - Supported by NSF grant 1301924.\r\nNir Shavit - Supported in part by NSF grants CCF-1217921 and CCF-1301926, DoE\r\nASCR grant ER26116/DE-SC0008923, and by grants from the Oracle and\r\nIntel corporations.","oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:48:24Z","publist_id":"6888","publisher":"ACM","year":"2014","citation":{"short":"D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, N. Shavit, in:, ACM, 2014.","ama":"Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. StackTrack: An automated transactional approach to concurrent memory reclamation. In: ACM; 2014. doi:<a href=\"https://doi.org/10.1145/2592798.2592808\">10.1145/2592798.2592808</a>","chicago":"Alistarh, Dan-Adrian, Patrick Eugster, Maurice Herlihy, Alexander Matveev, and Nir Shavit. “StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation.” ACM, 2014. <a href=\"https://doi.org/10.1145/2592798.2592808\">https://doi.org/10.1145/2592798.2592808</a>.","ista":"Alistarh D-A, Eugster P, Herlihy M, Matveev A, Shavit N. 2014. StackTrack: An automated transactional approach to concurrent memory reclamation. EuroSys: European Conference on Computer Systems.","apa":"Alistarh, D.-A., Eugster, P., Herlihy, M., Matveev, A., &#38; Shavit, N. (2014). StackTrack: An automated transactional approach to concurrent memory reclamation. Presented at the EuroSys: European Conference on Computer Systems, ACM. <a href=\"https://doi.org/10.1145/2592798.2592808\">https://doi.org/10.1145/2592798.2592808</a>","ieee":"D.-A. Alistarh, P. Eugster, M. Herlihy, A. Matveev, and N. Shavit, “StackTrack: An automated transactional approach to concurrent memory reclamation,” presented at the EuroSys: European Conference on Computer Systems, 2014.","mla":"Alistarh, Dan-Adrian, et al. <i>StackTrack: An Automated Transactional Approach to Concurrent Memory Reclamation</i>. ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2592798.2592808\">10.1145/2592798.2592808</a>."},"publication_status":"published","date_published":"2014-01-01T00:00:00Z","conference":{"name":"EuroSys: European Conference on Computer Systems"},"extern":"1","language":[{"iso":"eng"}],"_id":"770","abstract":[{"lang":"eng","text":"Dynamic memory reclamation is arguably the biggest open problem in concurrent data structure design: All known solutions induce high overhead, or must be customized to the specific data structure by the programmer, or both. This paper presents StackTrack, the first concurrent memory reclamation scheme that can be applied automatically by a compiler, while maintaining efficiency. StackTrack eliminates most of the expensive bookkeeping required for memory reclamation by leveraging the power of hardware transactional memory (HTM) in a new way: it tracks thread variables dynamically, and in an atomic fashion. This effectively makes all memory references visible without having threads pay the overhead of writing out this information. Our empirical results show that this new approach matches or outperforms prior, non-automated, techniques."}],"type":"conference","doi":"10.1145/2592798.2592808","author":[{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Eugster, Patrick","last_name":"Eugster","first_name":"Patrick"},{"full_name":"Herlihy, Maurice","first_name":"Maurice","last_name":"Herlihy"},{"last_name":"Matveev","first_name":"Alexander","full_name":"Matveev, Alexander"},{"first_name":"Nir","last_name":"Shavit","full_name":"Shavit, Nir"}],"day":"01","article_processing_charge":"No","month":"01","date_updated":"2023-02-23T13:14:25Z"}