{"id":"https://openalex.org/W2963921206","doi":"https://doi.org/10.1145/3293611.3331580","title":"How Fast Reads Affect Multi-Valued Register Simulations","display_name":"How Fast Reads Affect Multi-Valued Register Simulations","publication_year":2019,"publication_date":"2019-07-16","ids":{"openalex":"https://openalex.org/W2963921206","doi":"https://doi.org/10.1145/3293611.3331580","mag":"2963921206"},"language":"en","primary_location":{"id":"doi:10.1145/3293611.3331580","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331580","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331580","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331580","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5060797696","display_name":"S.K. Chaudhuri","orcid":"https://orcid.org/0000-0002-6241-2428"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Soma Chaudhuri","raw_affiliation_strings":["Iowa State University, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053737606","display_name":"Reginald Frank","orcid":"https://orcid.org/0000-0002-0423-1071"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Reginald Frank","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5014894919","display_name":"Jennifer L. Welch","orcid":"https://orcid.org/0000-0001-7164-1436"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jennifer L. Welch","raw_affiliation_strings":["Texas A&M University, College Station, TX, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University, College Station, TX, USA","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060797696"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.09818957,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"215","last_page":"217"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991999864578247,"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/T12288","display_name":"Optimization and Search Problems","score":0.9973999857902527,"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/register","display_name":"Register (sociolinguistics)","score":0.7251265645027161},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6847862601280212},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6768262386322021},{"id":"https://openalex.org/keywords/base","display_name":"Base (topology)","score":0.6440359950065613},{"id":"https://openalex.org/keywords/register-allocation","display_name":"Register allocation","score":0.6420912742614746},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.553644597530365},{"id":"https://openalex.org/keywords/shift-register","display_name":"Shift register","score":0.5095437169075012},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4735274314880371},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4624299108982086},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.45120346546173096},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22330594062805176},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08467873930931091}],"concepts":[{"id":"https://openalex.org/C2779235478","wikidata":"https://www.wikidata.org/wiki/Q286576","display_name":"Register (sociolinguistics)","level":2,"score":0.7251265645027161},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6847862601280212},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6768262386322021},{"id":"https://openalex.org/C42058472","wikidata":"https://www.wikidata.org/wiki/Q810214","display_name":"Base (topology)","level":2,"score":0.6440359950065613},{"id":"https://openalex.org/C128916667","wikidata":"https://www.wikidata.org/wiki/Q1343660","display_name":"Register allocation","level":3,"score":0.6420912742614746},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.553644597530365},{"id":"https://openalex.org/C49654631","wikidata":"https://www.wikidata.org/wiki/Q746165","display_name":"Shift register","level":3,"score":0.5095437169075012},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4735274314880371},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4624299108982086},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.45120346546173096},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22330594062805176},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08467873930931091},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.0},{"id":"https://openalex.org/C165005293","wikidata":"https://www.wikidata.org/wiki/Q1074500","display_name":"Chip","level":2,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3293611.3331580","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331580","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331580","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3293611.3331580","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3293611.3331580","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3293611.3331580","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1145247066","display_name":null,"funder_award_id":"1816922","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963921206.pdf","grobid_xml":"https://content.openalex.org/works/W2963921206.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1976075610","https://openalex.org/W2010521470","https://openalex.org/W2049936847","https://openalex.org/W2058618358","https://openalex.org/W2081800690","https://openalex.org/W2091642429","https://openalex.org/W2803565035"],"related_works":["https://openalex.org/W4297672591","https://openalex.org/W4390073573","https://openalex.org/W3013232686","https://openalex.org/W2159458033","https://openalex.org/W1844463772","https://openalex.org/W2010347046","https://openalex.org/W2494420798","https://openalex.org/W1515086489","https://openalex.org/W4250137176","https://openalex.org/W2943428598"],"abstract_inverted_index":{"We":[0,22,91],"consider":[1],"the":[2,41,45,52,63,68,74,106,112],"problem":[3],"of":[4,48,109],"simulating":[5],"a":[6,10,35],"k-valued":[7,37,101],"register":[8,38,76,102],"in":[9,39,62,95],"wait-free":[11],"manner":[12],"using":[13,28],"binary":[14,30],"registers":[15,32],"as":[16],"building":[17],"blocks,":[18],"where":[19],"k":[20,60],"2.":[21],"show":[23,83,93],"that":[24,84,94],"for":[25,103,111],"any":[26],"simulation":[27],"atomic":[29,100],"base":[31],"to":[33,97],"simulate":[34,98],"safe":[36],"which":[40],"read":[42,113],"algorithm":[43,54,114],"takes":[44],"optimal":[46,107],"number":[47,108],"steps":[49,61,110],"(log2":[50],"k),":[51],"write":[53],"must":[55,115],"take":[56],"at":[57],"least":[58],"log2":[59,120],"worst":[64],"case.":[65],"A":[66],"fortiori,":[67],"same":[69],"lower":[70,87],"bound":[71],"applies":[72],"when":[73],"simulated":[75],"should":[77],"be":[78,116],"regular.":[79],"Previously":[80],"known":[81],"algorithms":[82],"both":[85],"these":[86],"bounds":[88],"are":[89],"tight.":[90],"also":[92],"order":[96],"an":[99],"two":[104],"readers,":[105],"strictly":[117],"larger":[118],"than":[119],"k.":[121]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}