{"id":"https://openalex.org/W7154743914","doi":"https://doi.org/10.48550/arxiv.2604.14530","title":"Fast Concurrent Primitives Despite Contention","display_name":"Fast Concurrent Primitives Despite Contention","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154743914","doi":"https://doi.org/10.48550/arxiv.2604.14530"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.14530","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14530","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.14530","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133856860","display_name":"Michael A. Bender","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bender, Michael A.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033930662","display_name":"Guy E. Blelloch","orcid":"https://orcid.org/0000-0003-0224-9187"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Blelloch, Guy E.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133857311","display_name":"Martin Farach-Colton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Farach-Colton, Martin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133841399","display_name":"Yang Hu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hu, Yang","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133903124","display_name":"Rob Johnson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johnson, Rob","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Oshman, Rotem","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5088368179","display_name":"Renfei Zhou","orcid":"https://orcid.org/0000-0002-0095-0626"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhou, Renfei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.6430000066757202,"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.6430000066757202,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.23520000278949738,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.031199999153614044,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6128000020980835},{"id":"https://openalex.org/keywords/principle-of-compositionality","display_name":"Principle of compositionality","score":0.5669999718666077},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4821999967098236},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.47049999237060547},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.4560000002384186},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4059999883174896},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.3481000065803528},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.33899998664855957}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8445000052452087},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6128000020980835},{"id":"https://openalex.org/C121375916","wikidata":"https://www.wikidata.org/wiki/Q936559","display_name":"Principle of compositionality","level":2,"score":0.5669999718666077},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5526999831199646},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4821999967098236},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.47049999237060547},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.4560000002384186},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4059999883174896},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.3481000065803528},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3456000089645386},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.33899998664855957},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3384000062942505},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.33629998564720154},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.3343000113964081},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.3334999978542328},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.3255000114440918},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.32429999113082886},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.313400000333786},{"id":"https://openalex.org/C186799414","wikidata":"https://www.wikidata.org/wiki/Q3494571","display_name":"Logical address","level":4,"score":0.29739999771118164},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.28459998965263367},{"id":"https://openalex.org/C150495011","wikidata":"https://www.wikidata.org/wiki/Q128392","display_name":"Concurrent computing","level":2,"score":0.28220000863075256},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.27970001101493835},{"id":"https://openalex.org/C141141315","wikidata":"https://www.wikidata.org/wiki/Q2379942","display_name":"Guard (computer science)","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.25929999351501465}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.14530","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14530","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.14530","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.14530","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,48],"study":[1],"the":[2,70,106,135,207],"problem":[3],"of":[4,108,138,206],"constructing":[5],"concurrent":[6],"objects":[7],"in":[8,15,105],"a":[9,20,60,75,182,188],"setting":[10],"where":[11,65],"$P$":[12],"processes":[13,66],"run":[14,67],"parallel":[16],"and":[17,56,86,145,174,192,215],"interact":[18],"through":[19],"shared":[21],"memory":[22],"that":[23,36,44,89,130,185,203,209],"is":[24,31,131],"subject":[25,38],"to":[26,32,39,74,133,151],"write":[27,40],"contention.":[28],"Our":[29,116],"goal":[30],"transform":[33],"hardware":[34,101,113],"primitives":[35,208],"are":[37,124],"contention":[41,46],"into":[42],"ones":[43],"handle":[45],"gracefully.":[47],"give":[49,181],"contention-resolution":[50],"algorithms":[51,117],"for":[52],"several":[53,166],"basic":[54],"primitives,":[55],"analyze":[57],"them":[58,150],"under":[59,95,187],"relaxed,":[61],"roughly-synchronous":[62],"stochastic":[63],"scheduler,":[64],"at":[68,218,228],"roughly":[69],"same":[71],"rate":[72],"up":[73],"constant":[76],"factor":[77],"with":[78,221],"high":[79,222],"probability.":[80],"Specifically,":[81],"we":[82,164,180,210],"construct":[83],"read/write":[84,102],"registers":[85,88,103],"CAS":[87,110,114],"have":[90,225],"latency":[91,217,227],"$O(\\log":[92],"P)$":[93],"w.h.p.":[94],"our":[96,109,178],"scheduler":[97],"model,":[98],"using":[99,160],"$O(1)$":[100],"and,":[104],"case":[107],"construction,":[111],"one":[112,199],"register.":[115],"guarantee":[118],"performance":[119],"even":[120,186,193],"when":[121],"their":[122,143],"operations":[123,139],"invoked":[125],"by":[126],"an":[127],"adaptive":[128],"adversary":[129],"able":[132],"see":[134],"entire":[136],"history":[137],"so":[140],"far,":[141],"including":[142],"timing":[144],"return":[146],"values.":[147],"This":[148],"allows":[149],"be":[152],"used":[153],"as":[154],"building":[155],"blocks":[156],"inside":[157],"larger":[158],"programs;":[159],"this":[161],"compositionality":[162],"property,":[163],"obtain":[165],"other":[167],"constructions":[168],"(LL/SC,":[169],"fetch-and-increment,":[170],"bounded":[171],"max":[172],"registers,":[173],"counters).":[175],"To":[176],"complement":[177],"constructions,":[179],"trade-off":[183],"showing":[184],"perfectly":[189],"synchronous":[190],"schedule":[191],"if":[194],"each":[195],"process":[196],"only":[197],"executes":[198],"operation,":[200],"any":[201,205],"algorithm":[202],"implements":[204],"consider,":[211],"uses":[212],"space":[213],"$M$,":[214],"has":[216],"most":[219],"$L$":[220],"probability":[223],"must":[224],"expected":[226],"least":[229],"$\u03a9(\\log_{ML}":[230],"P)$.":[231]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-18T00:00:00"}