{"id":"https://openalex.org/W2808271599","doi":"https://doi.org/10.1145/3210563.3210569","title":"FRC: a high-performance concurrent parallel deferred reference counter for C++","display_name":"FRC: a high-performance concurrent parallel deferred reference counter for C++","publication_year":2018,"publication_date":"2018-06-11","ids":{"openalex":"https://openalex.org/W2808271599","doi":"https://doi.org/10.1145/3210563.3210569","mag":"2808271599"},"language":"en","primary_location":{"id":"doi:10.1145/3210563.3210569","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210563.3210569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5009413377","display_name":"Charles Tripp","orcid":"https://orcid.org/0000-0002-5867-3561"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Charles Tripp","raw_affiliation_strings":["Terrain Data, USA"],"affiliations":[{"raw_affiliation_string":"Terrain Data, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040432863","display_name":"David Hyde","orcid":"https://orcid.org/0009-0004-4950-5533"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Hyde","raw_affiliation_strings":["Stanford University, USA / Terrain Data, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA / Terrain Data, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088386471","display_name":"Benjamin E. Grossman\u2010Ponemon","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benjamin Grossman-Ponemon","raw_affiliation_strings":["Stanford University, USA / Terrain Data, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA / Terrain Data, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5009413377"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.0695429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"14","last_page":"28"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9994000196456909,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.78582763671875},{"id":"https://openalex.org/keywords/garbage-collection","display_name":"Garbage collection","score":0.7405999898910522},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5099841356277466},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.4876369535923004},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.43811482191085815},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.3768952190876007},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3280850648880005},{"id":"https://openalex.org/keywords/garbage","display_name":"Garbage","score":0.3278326392173767},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.07674422860145569}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.78582763671875},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.7405999898910522},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5099841356277466},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.4876369535923004},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.43811482191085815},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3768952190876007},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3280850648880005},{"id":"https://openalex.org/C75403996","wikidata":"https://www.wikidata.org/wiki/Q5521979","display_name":"Garbage","level":2,"score":0.3278326392173767},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.07674422860145569}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3210563.3210569","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3210563.3210569","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 ACM SIGPLAN International Symposium on Memory Management","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1965601529","https://openalex.org/W1998663979","https://openalex.org/W2005907808","https://openalex.org/W2020961463","https://openalex.org/W2027137911","https://openalex.org/W2045255985","https://openalex.org/W2053914793","https://openalex.org/W2062730511","https://openalex.org/W2091789752","https://openalex.org/W2100357382","https://openalex.org/W2101464091","https://openalex.org/W2146340823","https://openalex.org/W2185068198"],"related_works":["https://openalex.org/W2132258996","https://openalex.org/W2245694847","https://openalex.org/W4381304378","https://openalex.org/W2188602196","https://openalex.org/W3174776489","https://openalex.org/W1700460898","https://openalex.org/W4387773637","https://openalex.org/W2808342711","https://openalex.org/W2034669405","https://openalex.org/W2785868435"],"abstract_inverted_index":{"We":[0],"present":[1],"FRC,":[2],"a":[3,73],"high-performance":[4,17,40],"concurrent":[5,25,43],"parallel":[6],"reference":[7],"counter":[8],"for":[9],"unmanaged":[10,35],"languages.":[11],"It":[12],"is":[13,82],"well":[14],"known":[15],"that":[16],"garbage":[18],"collectors":[19],"help":[20],"developers":[21],"write":[22],"memory-safe,":[23],"highly":[24],"systems":[26],"and":[27,33,63],"data":[28],"structures.":[29],"While":[30],"C++,":[31],"C,":[32],"other":[34],"languages":[36,48,55],"are":[37],"used":[38],"in":[39],"applications,":[41],"adding":[42],"memory":[44],"management":[45],"to":[46,51],"these":[47],"has":[49],"proven":[50],"be":[52],"difficult.":[53],"Unmanaged":[54],"like":[56],"C++":[57],"use":[58],"pointers":[59],"instead":[60],"of":[61],"references,":[62],"have":[64],"uncooperative":[65],"mutators":[66],"which":[67],"do":[68],"not":[69],"pause":[70],"easily":[71],"at":[72],"safe":[74],"point.":[75],"Thus,":[76],"scanning":[77],"mutator":[78],"stack":[79],"root":[80],"references":[81],"challenging.":[83]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}