{"id":"https://openalex.org/W2151395819","doi":"https://doi.org/10.1145/2145816.2145837","title":"A speculation-friendly binary search tree","display_name":"A speculation-friendly binary search tree","publication_year":2012,"publication_date":"2012-02-25","ids":{"openalex":"https://openalex.org/W2151395819","doi":"https://doi.org/10.1145/2145816.2145837","mag":"2151395819"},"language":"en","primary_location":{"id":"doi:10.1145/2145816.2145837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2145816.2145837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00618995/document","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019040760","display_name":"Tyler Crain","orcid":null},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Tyler Crain","raw_affiliation_strings":["IRISA, Rennes, France"],"affiliations":[{"raw_affiliation_string":"IRISA, Rennes, France","institution_ids":["https://openalex.org/I2802519937"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036969849","display_name":"Vincent Gramoli","orcid":"https://orcid.org/0000-0001-5632-8572"},"institutions":[{"id":"https://openalex.org/I5124864","display_name":"\u00c9cole Polytechnique F\u00e9d\u00e9rale de Lausanne","ror":"https://ror.org/02s376052","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I5124864"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Vincent Gramoli","raw_affiliation_strings":["EPFL, Lausanne, Switzerland"],"affiliations":[{"raw_affiliation_string":"EPFL, Lausanne, Switzerland","institution_ids":["https://openalex.org/I5124864"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001545243","display_name":"Michel Raynal","orcid":"https://orcid.org/0000-0002-3355-8719"},"institutions":[{"id":"https://openalex.org/I2802519937","display_name":"Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires","ror":"https://ror.org/00myn0z94","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I205703379","https://openalex.org/I2802204017","https://openalex.org/I2802519937","https://openalex.org/I28221208","https://openalex.org/I4210127572","https://openalex.org/I4210159245","https://openalex.org/I56067802"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michel Raynal","raw_affiliation_strings":["IRISA, Rennes, France"],"affiliations":[{"raw_affiliation_string":"IRISA, Rennes, France","institution_ids":["https://openalex.org/I2802519937"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5019040760"],"corresponding_institution_ids":["https://openalex.org/I2802519937"],"apc_list":null,"apc_paid":null,"fwci":12.6659,"has_fulltext":true,"cited_by_count":60,"citation_normalized_percentile":{"value":0.98938306,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"161","last_page":"170"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":1.0,"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":1.0,"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.9890000224113464,"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.9876000285148621,"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.7860497236251831},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.6822347640991211},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.6652035117149353},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6249129176139832},{"id":"https://openalex.org/keywords/binary-search-tree","display_name":"Binary search tree","score":0.5982544422149658},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.5887577533721924},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5729013085365295},{"id":"https://openalex.org/keywords/binary-tree","display_name":"Binary tree","score":0.5457465648651123},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5342705845832825},{"id":"https://openalex.org/keywords/speculation","display_name":"Speculation","score":0.5311936736106873},{"id":"https://openalex.org/keywords/transactional-memory","display_name":"Transactional memory","score":0.5192368626594543},{"id":"https://openalex.org/keywords/software-transactional-memory","display_name":"Software transactional memory","score":0.5014593601226807},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4674072563648224},{"id":"https://openalex.org/keywords/random-binary-tree","display_name":"Random binary tree","score":0.4169695973396301},{"id":"https://openalex.org/keywords/self-balancing-binary-search-tree","display_name":"Self-balancing binary search tree","score":0.41014888882637024},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3289254903793335},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.30830109119415283},{"id":"https://openalex.org/keywords/database-transaction","display_name":"Database transaction","score":0.28590089082717896},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.22906771302223206},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20655813813209534},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1305883824825287}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7860497236251831},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.6822347640991211},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.6652035117149353},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6249129176139832},{"id":"https://openalex.org/C91154448","wikidata":"https://www.wikidata.org/wiki/Q623818","display_name":"Binary search tree","level":3,"score":0.5982544422149658},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.5887577533721924},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5729013085365295},{"id":"https://openalex.org/C197855036","wikidata":"https://www.wikidata.org/wiki/Q380172","display_name":"Binary tree","level":2,"score":0.5457465648651123},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5342705845832825},{"id":"https://openalex.org/C47941915","wikidata":"https://www.wikidata.org/wiki/Q107885","display_name":"Speculation","level":2,"score":0.5311936736106873},{"id":"https://openalex.org/C134277064","wikidata":"https://www.wikidata.org/wiki/Q878206","display_name":"Transactional memory","level":3,"score":0.5192368626594543},{"id":"https://openalex.org/C167149655","wikidata":"https://www.wikidata.org/wiki/Q1189004","display_name":"Software transactional memory","level":4,"score":0.5014593601226807},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4674072563648224},{"id":"https://openalex.org/C11829167","wikidata":"https://www.wikidata.org/wiki/Q751292","display_name":"Random binary tree","level":3,"score":0.4169695973396301},{"id":"https://openalex.org/C135593954","wikidata":"https://www.wikidata.org/wiki/Q245955","display_name":"Self-balancing binary search tree","level":5,"score":0.41014888882637024},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3289254903793335},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.30830109119415283},{"id":"https://openalex.org/C75949130","wikidata":"https://www.wikidata.org/wiki/Q848010","display_name":"Database transaction","level":2,"score":0.28590089082717896},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.22906771302223206},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20655813813209534},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1305883824825287},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"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/C139719470","wikidata":"https://www.wikidata.org/wiki/Q39680","display_name":"Macroeconomics","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2145816.2145837","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2145816.2145837","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:inria-00618995v2","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00618995","pdf_url":"https://inria.hal.science/inria-00618995/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] PI-1984, 2011, pp.21","raw_type":"Reports"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.220.8229","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.220.8229","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://lpd.epfl.ch/gramoli/doc/pubs/ppo243-gramoli-preprint.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00764358v1","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-00764358","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP 2012, 2012, New Orleans, United States","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00618995v2","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00618995","pdf_url":"https://inria.hal.science/inria-00618995/document","source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"[Research Report] PI-1984, 2011, pp.21","raw_type":"Reports"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.44999998807907104,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2151395819.pdf","grobid_xml":"https://content.openalex.org/works/W2151395819.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W659821","https://openalex.org/W172574161","https://openalex.org/W1542975293","https://openalex.org/W1552340129","https://openalex.org/W1557189078","https://openalex.org/W1972027649","https://openalex.org/W1972955159","https://openalex.org/W1973610879","https://openalex.org/W1984825199","https://openalex.org/W2007049062","https://openalex.org/W2021615496","https://openalex.org/W2028764399","https://openalex.org/W2061863279","https://openalex.org/W2092911542","https://openalex.org/W2095825766","https://openalex.org/W2101545021","https://openalex.org/W2105055683","https://openalex.org/W2113010030","https://openalex.org/W2113751407","https://openalex.org/W2119251905","https://openalex.org/W2129458440","https://openalex.org/W2129990308","https://openalex.org/W2134682929","https://openalex.org/W2140034113","https://openalex.org/W2149089882","https://openalex.org/W2155500238","https://openalex.org/W2158525816","https://openalex.org/W2163048888","https://openalex.org/W2163654949","https://openalex.org/W2166266685","https://openalex.org/W2914061328","https://openalex.org/W4243534587","https://openalex.org/W6600029208"],"related_works":["https://openalex.org/W2026697457","https://openalex.org/W2364382882","https://openalex.org/W2361906991","https://openalex.org/W2022598760","https://openalex.org/W2038309235","https://openalex.org/W2371680642","https://openalex.org/W2501849745","https://openalex.org/W2093708041","https://openalex.org/W2047446047","https://openalex.org/W3169685561"],"abstract_inverted_index":{"We":[0],"introduce":[1],"the":[2,45],"first":[3],"binary":[4],"search":[5],"tree":[6,16,39,47],"algorithm":[7],"designed":[8,20],"for":[9,21,67],"speculative":[10,68],"executions.":[11],"Prior":[12],"to":[13,26,33],"this":[14],"work,":[15],"structures":[17,40,63],"were":[18],"mainly":[19],"their":[22],"pessimistic":[23],"(non-speculative)":[24],"accesses":[25],"have":[27],"a":[28],"bounded":[29],"complexity.":[30],"Researchers":[31],"tried":[32],"evaluate":[34],"transactional":[35],"memory":[36],"using":[37],"such":[38,62],"whose":[41,70],"prominent":[42],"example":[43],"is":[44,54],"red-black":[46],"library":[48],"developed":[49],"by":[50],"Oracle":[51],"Labs":[52],"that":[53],"part":[55],"of":[56],"multiple":[57],"benchmark":[58],"distributions.":[59],"Although":[60],"well-engineered,":[61],"remain":[64],"badly":[65],"suited":[66],"accesses,":[69],"step":[71],"complexity":[72],"might":[73],"raise":[74],"dramatically":[75],"with":[76],"contention.":[77]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":9},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":8},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}