{"id":"https://openalex.org/W4220813164","doi":"https://doi.org/10.1145/3503221.3508410","title":"PathCAS","display_name":"PathCAS","publication_year":2022,"publication_date":"2022-03-28","ids":{"openalex":"https://openalex.org/W4220813164","doi":"https://doi.org/10.1145/3503221.3508410"},"language":"en","primary_location":{"id":"doi:10.1145/3503221.3508410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503221.3508410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2212.09851","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101944739","display_name":"Trevor Brown","orcid":"https://orcid.org/0000-0002-0074-1031"},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Trevor Brown","raw_affiliation_strings":["University of Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021355405","display_name":"William Sigouin","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"William Sigouin","raw_affiliation_strings":["University of Waterloo, Canada"],"affiliations":[{"raw_affiliation_string":"University of Waterloo, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083822059","display_name":"Dan Alistarh","orcid":"https://orcid.org/0000-0003-3650-940X"},"institutions":[{"id":"https://openalex.org/I157556583","display_name":"Institute of Science and Technology Austria","ror":"https://ror.org/03gnh5541","country_code":"AT","type":"education","lineage":["https://openalex.org/I157556583"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Dan Alistarh","raw_affiliation_strings":["Institute of Science and Technology, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Science and Technology, Austria","institution_ids":["https://openalex.org/I157556583"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101944739"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":null,"apc_paid":null,"fwci":0.5684,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66521904,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"385","last_page":"399"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9778000116348267,"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.9656999707221985,"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.8801736831665039},{"id":"https://openalex.org/keywords/software-portability","display_name":"Software portability","score":0.6557966470718384},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6062840223312378},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.6005356907844543},{"id":"https://openalex.org/keywords/ternary-search-tree","display_name":"Ternary search tree","score":0.5950879454612732},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5389611721038818},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5074054598808289},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.497682124376297},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4652332663536072},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.4510691165924072},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4152640104293823},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.39269137382507324},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3639822006225586},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.286043643951416},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27990269660949707},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.20609307289123535},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1450316309928894}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8801736831665039},{"id":"https://openalex.org/C63000827","wikidata":"https://www.wikidata.org/wiki/Q3080428","display_name":"Software portability","level":2,"score":0.6557966470718384},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6062840223312378},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.6005356907844543},{"id":"https://openalex.org/C136519935","wikidata":"https://www.wikidata.org/wiki/Q2859802","display_name":"Ternary search tree","level":5,"score":0.5950879454612732},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5389611721038818},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5074054598808289},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.497682124376297},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4652332663536072},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.4510691165924072},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4152640104293823},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.39269137382507324},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3639822006225586},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.286043643951416},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27990269660949707},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.20609307289123535},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1450316309928894},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3503221.3508410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3503221.3508410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2212.09851","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.09851","pdf_url":"https://arxiv.org/pdf/2212.09851","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2212.09851","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2212.09851","pdf_url":"https://arxiv.org/pdf/2212.09851","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1495128589","https://openalex.org/W1542975293","https://openalex.org/W1964252984","https://openalex.org/W1971661928","https://openalex.org/W2043676248","https://openalex.org/W2055100610","https://openalex.org/W2069398819","https://openalex.org/W2085407655","https://openalex.org/W2092707863","https://openalex.org/W2092911542","https://openalex.org/W2096181137","https://openalex.org/W2113751407","https://openalex.org/W2117572751","https://openalex.org/W2119251905","https://openalex.org/W2128896110","https://openalex.org/W2135026800","https://openalex.org/W2139559481","https://openalex.org/W2145795182","https://openalex.org/W2155500238","https://openalex.org/W2170146741","https://openalex.org/W2261964959","https://openalex.org/W2734941459","https://openalex.org/W3000335563","https://openalex.org/W3012979297","https://openalex.org/W3133445000","https://openalex.org/W3138153268"],"related_works":["https://openalex.org/W2501849745","https://openalex.org/W3169685561","https://openalex.org/W2146997899","https://openalex.org/W2026697457","https://openalex.org/W2914983903","https://openalex.org/W2910653847","https://openalex.org/W4231913352","https://openalex.org/W1837592468","https://openalex.org/W2003946312","https://openalex.org/W2135212710"],"abstract_inverted_index":{"To":[0],"maximize":[1],"the":[2,72,164,168],"performance":[3,46,82,178],"of":[4,58,176],"concurrent":[5,171,187],"data":[6,131,188],"structures,":[7],"researchers":[8],"have":[9,44,62],"often":[10,27],"turned":[11],"to":[12,29,50,79,127,147,194],"highly":[13],"complex":[14],"fine-grained":[15,52],"techniques,":[16],"resulting":[17],"in":[18,159,174],"efficient":[19,129],"and":[20,31,100,112,196],"elegant":[21],"algorithms,":[22],"which":[23],"can":[24,43,124,185],"however":[25],"be":[26,125],"difficult":[28],"understand":[30],"prove":[32,197],"correct.":[33],"While":[34],"simpler":[35],"techniques":[36],"exist,":[37],"such":[38],"as":[39,141],"transactional":[40,113],"memory,":[41],"they":[42],"limited":[45],"or":[47],"portability":[48],"relative":[49],"their":[51],"counterparts.":[53],"Approaches":[54],"at":[55],"both":[56],"ends":[57],"this":[59,93,97,146],"complexity-performance":[60],"spectrum":[61],"been":[63],"extensively":[64],"explored,":[65],"but":[66],"relatively":[67,133,192],"less":[68],"is":[69],"known":[70,170],"about":[71],"middle":[73,98],"ground:":[74],"approaches":[75],"that":[76,105,183,190],"are":[77,191],"willing":[78],"sacrifice":[80],"some":[81],"for":[83],"simplicity,":[84],"while":[85,116,199],"remaining":[86],"competitive":[87],"with":[88],"state-of-the-art":[89],"handcrafted":[90,156],"designs.":[91],"In":[92],"paper,":[94],"we":[95],"explore":[96],"ground,":[99],"present":[101],"PathCAS,":[102],"a":[103],"primitive":[104],"combines":[106],"ideas":[107],"from":[108],"multi-word":[109],"CAS":[110],"(KCAS)":[111],"memory":[114],"approaches,":[115],"carefully":[117],"avoiding":[118],"overhead.":[119],"We":[120],"show":[121],"how":[122],"PathCAS":[123,184],"used":[126],"implement":[128],"search":[130,139,157,177],"structures":[132,189],"simply,":[134],"using":[135],"an":[136,142,148],"internal":[137],"binary":[138,172],"tree":[140,166,173],"example,":[143],"then":[144],"extending":[145],"AVL":[149],"tree.":[150],"Our":[151,180],"best":[152],"implementations":[153],"outperform":[154],"many":[155],"trees:":[158],"search-heavy":[160],"workloads,":[161],"it":[162],"rivals":[163],"BCCO":[165],"[5],":[167],"fastest":[169],"terms":[175],"[3].":[179],"results":[181],"suggest":[182],"yield":[186],"easy":[193],"build":[195],"correct,":[198],"offering":[200],"surprisingly":[201],"high":[202],"performance.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2022-04-03T00:00:00"}