{"id":"https://openalex.org/W2073407658","doi":"https://doi.org/10.1145/1989493.1989549","title":"A highly-efficient wait-free universal construction","display_name":"A highly-efficient wait-free universal construction","publication_year":2011,"publication_date":"2011-06-04","ids":{"openalex":"https://openalex.org/W2073407658","doi":"https://doi.org/10.1145/1989493.1989549","mag":"2073407658"},"language":"en","primary_location":{"id":"doi:10.1145/1989493.1989549","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","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/A5019462315","display_name":"Panagiota Fatourou","orcid":"https://orcid.org/0000-0002-6265-6895"},"institutions":[{"id":"https://openalex.org/I4210121775","display_name":"FORTH Institute of Computer Science","ror":"https://ror.org/02tf48g55","country_code":"GR","type":"facility","lineage":["https://openalex.org/I4210121775","https://openalex.org/I8901234"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Panagiota Fatourou","raw_affiliation_strings":["FORTH ICS, Heraklion, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"FORTH ICS, Heraklion, Greece","institution_ids":["https://openalex.org/I4210121775"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014109076","display_name":"Nikolaos D. Kallimanis","orcid":"https://orcid.org/0000-0002-0331-1475"},"institutions":[{"id":"https://openalex.org/I194019607","display_name":"University of Ioannina","ror":"https://ror.org/01qg3j183","country_code":"GR","type":"education","lineage":["https://openalex.org/I194019607"]}],"countries":["GR"],"is_corresponding":false,"raw_author_name":"Nikolaos D. Kallimanis","raw_affiliation_strings":["Department of Compuer Science, University of Ioannina, Ioannina, Greece"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Compuer Science, University of Ioannina, Ioannina, Greece","institution_ids":["https://openalex.org/I194019607"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":12.7994,"has_fulltext":false,"cited_by_count":112,"citation_normalized_percentile":{"value":0.98885908,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":95,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"325","last_page":"334"},"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.9998999834060669,"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.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9959999918937683,"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.9937999844551086,"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/computer-science","display_name":"Computer science","score":0.577575147151947}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.577575147151947}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1989493.1989549","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1989493.1989549","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5199999809265137,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W78253466","https://openalex.org/W1502418172","https://openalex.org/W1550037295","https://openalex.org/W1555246147","https://openalex.org/W1964252984","https://openalex.org/W1976439674","https://openalex.org/W1981393723","https://openalex.org/W1991869998","https://openalex.org/W1996931099","https://openalex.org/W1998458999","https://openalex.org/W2001738739","https://openalex.org/W2015065468","https://openalex.org/W2037683502","https://openalex.org/W2040078625","https://openalex.org/W2061197210","https://openalex.org/W2066792155","https://openalex.org/W2085407655","https://openalex.org/W2101939036","https://openalex.org/W2108253266","https://openalex.org/W2124525591","https://openalex.org/W2128274900","https://openalex.org/W2131887253","https://openalex.org/W2132159669","https://openalex.org/W2132220514","https://openalex.org/W2138404963","https://openalex.org/W2167680229","https://openalex.org/W2399983654","https://openalex.org/W4249713879"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W2382290278","https://openalex.org/W2478288626","https://openalex.org/W2350741829","https://openalex.org/W2530322880","https://openalex.org/W1596801655"],"abstract_inverted_index":{"We":[0,28],"present":[1],"a":[2,13,21,33,80],"new":[3],"simple":[4],"wait-free":[5],"universal":[6],"construction,":[7],"called":[8,45],"Sim,":[9],"that":[10,60,72,77],"uses":[11],"just":[12],"Fetch&Add":[14],"and":[15,19,66,69],"an":[16],"LL/SC":[17],"object":[18],"performs":[20],"constant":[22],"number":[23],"of":[24,43],"shared":[25],"memory":[26],"accesses.":[27],"have":[29],"implemented":[30],"SIM":[31],"in":[32,54],"real":[34],"shared-memory":[35],"machine.":[36],"In":[37],"theory":[38],"terms,":[39],"our":[40],"practical":[41],"version":[42],"SIM,":[44],"P-SIM,":[46],"has":[47],"worse":[48],"complexity":[49],"than":[50,84],"its":[51],"theoretical":[52],"analog;":[53],"practice":[55],"though,":[56],"we":[57],"experimentally":[58],"show":[59],"P-SIM":[61],"outperforms":[62],"several":[63],"state-of-the-art":[64],"lock-based":[65],"lock-free":[67],"techniques,":[68],"this":[70],"given":[71],"it":[73,78,88],"is":[74],"wait-free,":[75],"i.e.,":[76],"satisfies":[79],"stronger":[81],"progress":[82],"condition":[83],"all":[85],"the":[86],"algorithms":[87],"outperforms.":[89]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":10},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":14},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":10}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}