{"id":"https://openalex.org/W4411267038","doi":"https://doi.org/10.1145/3729337","title":"RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures","display_name":"RRR-SMR: Reduce, Reuse, Recycle: Better Methods for Practical Lock-Free Data Structures","publication_year":2025,"publication_date":"2025-06-10","ids":{"openalex":"https://openalex.org/W4411267038","doi":"https://doi.org/10.1145/3729337"},"language":"en","primary_location":{"id":"doi:10.1145/3729337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729337","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3729337","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118196327","display_name":"Md Amit Hasan Arovi","orcid":null},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Md Amit Hasan Arovi","raw_affiliation_strings":["Pennsylvania State University, University Park, USA"],"raw_orcid":"https://orcid.org/0009-0009-4341-1954","affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, USA","institution_ids":["https://openalex.org/I130769515"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010053583","display_name":"Ruslan Nikolaev","orcid":"https://orcid.org/0000-0002-1699-0593"},"institutions":[{"id":"https://openalex.org/I130769515","display_name":"Pennsylvania State University","ror":"https://ror.org/04p491231","country_code":"US","type":"education","lineage":["https://openalex.org/I130769515"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ruslan Nikolaev","raw_affiliation_strings":["Pennsylvania State University, University Park, USA"],"raw_orcid":"https://orcid.org/0000-0002-1699-0593","affiliations":[{"raw_affiliation_string":"Pennsylvania State University, University Park, USA","institution_ids":["https://openalex.org/I130769515"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5118196327"],"corresponding_institution_ids":["https://openalex.org/I130769515"],"apc_list":null,"apc_paid":null,"fwci":1.3517,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82510208,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"9","issue":"PLDI","first_page":"2156","last_page":"2179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11986","display_name":"Scientific Computing and Data Management","score":0.9954000115394592,"subfield":{"id":"https://openalex.org/subfields/1802","display_name":"Information Systems and Management"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.8349068760871887},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.8088150024414062},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5375338196754456},{"id":"https://openalex.org/keywords/process-engineering","display_name":"Process engineering","score":0.3757026791572571},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.23340094089508057},{"id":"https://openalex.org/keywords/waste-management","display_name":"Waste management","score":0.22712713479995728},{"id":"https://openalex.org/keywords/mechanical-engineering","display_name":"Mechanical engineering","score":0.13852205872535706}],"concepts":[{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.8349068760871887},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.8088150024414062},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5375338196754456},{"id":"https://openalex.org/C21880701","wikidata":"https://www.wikidata.org/wiki/Q2144042","display_name":"Process engineering","level":1,"score":0.3757026791572571},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.23340094089508057},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.22712713479995728},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.13852205872535706}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729337","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3729337","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729337","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1981393723","https://openalex.org/W2069398819","https://openalex.org/W2100357382","https://openalex.org/W2117572751","https://openalex.org/W2148789662","https://openalex.org/W2159392969","https://openalex.org/W2738549499","https://openalex.org/W2788506055","https://openalex.org/W2886479168","https://openalex.org/W2999256041","https://openalex.org/W3008221320","https://openalex.org/W3032912255","https://openalex.org/W3099276241","https://openalex.org/W3103113662","https://openalex.org/W3131868981","https://openalex.org/W3133445000","https://openalex.org/W3158678064","https://openalex.org/W3174400449","https://openalex.org/W3175644491","https://openalex.org/W4221052948","https://openalex.org/W4224032755","https://openalex.org/W4378801286","https://openalex.org/W4399851484","https://openalex.org/W4399852727","https://openalex.org/W6949443043"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2384475851","https://openalex.org/W2000444236","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109"],"abstract_inverted_index":{"Traditionally,":[0],"most":[1],"concurrent":[2],"algorithms":[3],"rely":[4],"on":[5,264],"safe":[6,217],"memory":[7,13,34,218],"reclamation":[8,20],"(SMR)":[9],"schemes":[10,16],"for":[11,33,104,273],"manual":[12],"management.":[14],"SMR":[15,117,129,222,278],"such":[17],"as":[18,29],"epoch-based":[19],"(EBR)":[21],"and":[22,81,95,149,168,241,248,277],"hazard":[23],"pointers":[24],"(HP)":[25],"are":[26],"typically":[27,102],"viewed":[28],"the":[30,60,85,97,108,119,127,132,140,225],"only":[31],"solution":[32],"recycling.":[35],"When":[36],"using":[37,116,221,270],"SMR,":[38],"a":[39,52,74,89,204,250,254],"new":[40,48],"object":[41,62],"needs":[42],"to":[43,51,65,79,84,160,186,215,232],"be":[44,66,154,197],"allocated":[45],"whenever":[46],"something":[47],"is":[49,101,157,183,230],"added":[50],"data":[53,70,142,162,213,243,275],"structure.":[54],"However,":[55],"in":[56,88,139,146],"more":[57,255],"complex":[58],"scenarios,":[59],"same":[61,120,133],"may":[63],"need":[64],"moved":[67],"between":[68],"different":[69,274],"structures":[71,163,214,276],"(e.g.,":[72],"moving":[73],"node":[75,98,134],"from":[76],"one":[77],"list":[78],"another,":[80],"then":[82],"back":[83,138],"original":[86,141],"list)":[87],"copy-free":[90],"manner,":[91],"i.e.,":[92],"without":[93],"deallocating":[94],"allocating":[96],"again.":[99],"It":[100],"impossible":[103,185],"two":[105],"reasons:":[106],"(1)":[107],"ABA":[109],"problem":[110],"would":[111],"still":[112,196],"arise":[113],"even":[114],"when":[115,220,269],"since":[118,193],"pointer":[121],"can":[122,152],"reappear":[123],"(without":[124],"going":[125],"through":[126],"full":[128],"cycle)":[130],"if":[131],"eventually":[135],"ends":[136],"up":[137],"structure;":[143],"(2)":[144],"while":[145],"simple":[147],"queues":[148],"stacks,":[150],"nodes":[151],"immediately":[153,188],"recycled,":[155],"it":[156,182],"unclear":[158],"how":[159],"adapt":[161],"which":[164,223],"use":[165],"non-trivial":[166],"traversal":[167],"two-phase":[169],"deletion":[170],"strategies,":[171],"e.g.,":[172],"linked":[173,233],"lists,":[174,176,234,236],"skip":[175,235],"hash":[177,237],"tables,":[178,238],"trees,":[179],"etc.,":[180],"where":[181],"seemingly":[184],"always":[187],"move":[189],"(logically)":[190],"deleted":[191],"objects":[192],"they":[194],"might":[195],"accessed":[198],"by":[199],"other":[200,242],"threads.":[201],"We":[202,245],"propose":[203,249],"general":[205],"method":[206,229],"of":[207,258],"creating":[208],"RRR":[209],"(Reduce,":[210],"Reuse,":[211],"Recycle)":[212],"allow":[216],"recycling":[219],"addresses":[224],"above-mentioned":[226],"problems.":[227],"Our":[228,262],"applicable":[231],"Natarajan-Mittal":[239],"tree,":[240],"structures.":[244],"also":[246],"discuss":[247],"specialized":[251],"approach":[252],"--":[253],"efficient":[256],"version":[257],"Michael-and-Scott's":[259],"(recycling)":[260],"queue.":[261],"evaluation":[263],"x86-64":[265],"shows":[266],"promising":[267],"results":[268],"our":[271],"methods":[272],"schemes.":[279]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}