{"id":"https://openalex.org/W2018031750","doi":"https://doi.org/10.1145/2688500.2688551","title":"CASTLE: fast concurrent internal binary search tree using edge-based locking","display_name":"CASTLE: fast concurrent internal binary search tree using edge-based locking","publication_year":2015,"publication_date":"2015-01-24","ids":{"openalex":"https://openalex.org/W2018031750","doi":"https://doi.org/10.1145/2688500.2688551","mag":"2018031750"},"language":"en","primary_location":{"id":"doi:10.1145/2688500.2688551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","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/A5051628289","display_name":"Arunmoezhi Ramachandran","orcid":"https://orcid.org/0000-0001-7532-8383"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arunmoezhi Ramachandran","raw_affiliation_strings":["University of Texas at Dallas, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103161933","display_name":"Neeraj Mittal","orcid":"https://orcid.org/0000-0002-8734-1400"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neeraj Mittal","raw_affiliation_strings":["University of Texas at Dallas, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Dallas, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5051628289"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.6641,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.85811251,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"281","last_page":"282"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.988099992275238,"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/T11478","display_name":"Caching and Content Delivery","score":0.9824000000953674,"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.8320373892784119},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6292087435722351},{"id":"https://openalex.org/keywords/lock","display_name":"Lock (firearm)","score":0.6009044051170349},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5477700233459473},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5403506755828857},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5380856990814209},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.5264647603034973},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.5014140605926514},{"id":"https://openalex.org/keywords/binary-search-algorithm","display_name":"Binary search algorithm","score":0.4991888999938965},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4779781699180603},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46636590361595154},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.40878236293792725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3897114396095276},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.1514967381954193},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1059272289276123},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08464357256889343},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07928603887557983}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8320373892784119},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6292087435722351},{"id":"https://openalex.org/C174839445","wikidata":"https://www.wikidata.org/wiki/Q1134386","display_name":"Lock (firearm)","level":2,"score":0.6009044051170349},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5477700233459473},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5403506755828857},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5380856990814209},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.5264647603034973},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.5014140605926514},{"id":"https://openalex.org/C121610932","wikidata":"https://www.wikidata.org/wiki/Q243754","display_name":"Binary search algorithm","level":3,"score":0.4991888999938965},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4779781699180603},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46636590361595154},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.40878236293792725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3897114396095276},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.1514967381954193},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1059272289276123},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08464357256889343},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07928603887557983},{"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/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2688500.2688551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","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":3,"referenced_works":["https://openalex.org/W2117572751","https://openalex.org/W2128896110","https://openalex.org/W2170146741"],"related_works":["https://openalex.org/W2363556447","https://openalex.org/W2384179084","https://openalex.org/W2539085113","https://openalex.org/W2092988444","https://openalex.org/W2354443135","https://openalex.org/W2582091787","https://openalex.org/W1499707946","https://openalex.org/W2374641630","https://openalex.org/W2016420340","https://openalex.org/W2107129281"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,10,37,57,82,104,123],"new":[3],"lock-based":[4,117],"algorithm":[5,34,74,118],"for":[6,122,128],"concurrent":[7,124],"manipulation":[8],"of":[9,28,32,71,81,103],"binary":[11,125],"search":[12,38,83,126],"tree":[13,84,127],"in":[14,68],"an":[15,47,78],"asynchronous":[16],"shared":[17],"memory":[18],"system":[19,110],"that":[20,115],"supports":[21],"search,":[22],"insert":[23,48],"and":[24,43,55,85,107,130],"delete":[25,58],"operations.":[26],"Some":[27],"the":[29,69,100,109,140],"desirable":[30],"characteristics":[31],"our":[33,116],"are:":[35],"(i)":[36],"operation":[39,49,59,106],"uses":[40],"only":[41,60],"read":[42],"write":[44,105],"instructions,":[45],"(ii)":[46],"does":[50],"not":[51],"acquire":[52],"any":[53],"locks,":[54],"(iii)":[56],"needs":[61],"to":[62,65,135],"lock":[63],"up":[64,134],"four":[66],"edges":[67],"absence":[70],"contention.":[72],"Our":[73,112],"is":[75],"based":[76],"on":[77],"internal":[79],"representation":[80],"it":[86],"operates":[87],"at":[88,94],"edge-level":[89],"(locks":[90,96],"edges)":[91],"rather":[92],"than":[93,139],"node-level":[95],"nodes);":[97],"this":[98],"minimizes":[99],"contention":[101],"window":[102],"improves":[108],"throughput.":[111],"experiments":[113],"indicate":[114],"outperforms":[119],"existing":[120],"algorithms":[121],"medium-sized":[129],"larger":[131],"trees,":[132],"achieving":[133],"59%":[136],"higher":[137],"throughput":[138],"next":[141],"best":[142],"algorithm.":[143]},"counts_by_year":[{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}