{"id":"https://openalex.org/W3082778821","doi":"https://doi.org/10.1109/async49171.2020.00011","title":"Recursive Formulations for N Input Asynchronous First Come First Served Arbiters","display_name":"Recursive Formulations for N Input Asynchronous First Come First Served Arbiters","publication_year":2020,"publication_date":"2020-05-01","ids":{"openalex":"https://openalex.org/W3082778821","doi":"https://doi.org/10.1109/async49171.2020.00011","mag":"3082778821"},"language":"en","primary_location":{"id":"doi:10.1109/async49171.2020.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/async49171.2020.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)","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/A5048939792","display_name":"Lindsay Kleeman","orcid":"https://orcid.org/0000-0002-3629-0666"},"institutions":[{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":true,"raw_author_name":"Lindsay Kleeman","raw_affiliation_strings":["Department of Electrical and Computer Systems Engineering, Monash University, Melboume, Australia"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Systems Engineering, Monash University, Melboume, Australia","institution_ids":["https://openalex.org/I56590836"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048939792"],"corresponding_institution_ids":["https://openalex.org/I56590836"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13164255,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"20","last_page":"27"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","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/T10829","display_name":"Interconnection Networks and Systems","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.9994999766349792,"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/T11005","display_name":"Radiation Effects in Electronics","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/arbiter","display_name":"Arbiter","score":0.9533624649047852},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7460468411445618},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.6294792890548706},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.47385528683662415},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4422702193260193},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.43416163325309753},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4262947738170624},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3531632423400879},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3336656093597412},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32103079557418823},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.20806747674942017},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20716193318367004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15108060836791992}],"concepts":[{"id":"https://openalex.org/C2779971761","wikidata":"https://www.wikidata.org/wiki/Q629872","display_name":"Arbiter","level":2,"score":0.9533624649047852},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7460468411445618},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.6294792890548706},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.47385528683662415},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4422702193260193},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.43416163325309753},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4262947738170624},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3531632423400879},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3336656093597412},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32103079557418823},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.20806747674942017},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20716193318367004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15108060836791992},{"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.1109/async49171.2020.00011","is_oa":false,"landing_page_url":"https://doi.org/10.1109/async49171.2020.00011","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 26th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.800000011920929,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1484446818","https://openalex.org/W1515165357","https://openalex.org/W2007675081","https://openalex.org/W2069313656","https://openalex.org/W2101633626","https://openalex.org/W2116976760","https://openalex.org/W2312784726","https://openalex.org/W2511894128","https://openalex.org/W2908386730","https://openalex.org/W4235991615"],"related_works":["https://openalex.org/W2884038052","https://openalex.org/W2135481122","https://openalex.org/W2115668703","https://openalex.org/W2982348224","https://openalex.org/W3161858668","https://openalex.org/W4230671735","https://openalex.org/W143296170","https://openalex.org/W2129720900","https://openalex.org/W2138266884","https://openalex.org/W3124125590"],"abstract_inverted_index":{"A":[0],"First":[1,3],"Come":[2],"Served":[4],"(FCFS)":[5],"arbiter":[6,46],"services":[7],"requests":[8,63],"in":[9,55,114,168,202],"order":[10],"of":[11,22,29,62,120,129,177,200,225],"their":[12],"arrival,":[13],"thereby":[14],"achieving":[15],"fairness":[16],"defined":[17],"by":[18,66],"a":[19,42,67,75,217],"minimum":[20],"variance":[21],"waiting":[23],"times.":[24],"For":[25,148],"example,":[26,149],"the":[27,81,130,134,145,156,190,198],"performance":[28,231],"multiprocessor":[30],"architectures":[31],"depends":[32],"on":[33,50],"fair":[34],"access":[35],"to":[36,99,139,173,179,207,210],"shared":[37],"memory.":[38],"This":[39,161],"paper":[40,132,195],"proposes":[41],"new":[43,191],"asynchronous":[44],"FCFS":[45,203],"hardware":[47],"design":[48],"based":[49],"recursive":[51,135,162,192],"formulations":[52,136],"that":[53,137],"result":[54],"efficient":[56,141],"and":[57,103,107,112,185,216,227],"fast":[58],"implementations.":[59],"Each":[60],"pair":[61],"is":[64,84,97,133,187],"ordered":[65],"metastable":[68],"robust":[69],"mutual":[70],"exclusion":[71],"element":[72],"(ME).":[73],"When":[74],"request":[76,95],"arrives":[77],"before":[78,101,105,109],"all":[79],"others,":[80],"corresponding":[82],"acknowledge":[83,181],"asserted.":[85],"However,":[86],"close":[87],"arrivals":[88],"can":[89,164,182],"cause":[90],"cycles":[91,117,178,228],"such":[92],"as":[93,124],"when":[94],"0":[96],"deemed":[98],"arrive":[100],"1":[102,104],"2":[106,108],"0.":[110],"Dike":[111],"Ostler":[113],"1992":[115],"resolve":[116],"using":[118],"groups":[119],"4":[121],"requests,":[122,152],"known":[123],"an":[125],"M4.":[126],"One":[127],"contribution":[128],"current":[131],"lead":[138],"more":[140],"simpler":[142],"logic":[143,169,215],"than":[144,154],"M4":[146],"approach.":[147,193],"with":[150,170,229],"N=4":[151],"fewer":[153],"half":[155],"CMOS":[157],"transistors":[158],"are":[159],"required.":[160],"approach":[163],"still":[165],"be":[166,183],"expressed":[167],"delay":[171],"proportional":[172],"log(N).":[174],"The":[175,194],"allocation":[176],"each":[180,211],"configured":[184],"this":[186],"analysed":[188],"for":[189],"also":[196],"discusses":[197],"occurrence":[199],"hazards":[201],"resolution":[204,214],"logic,":[205],"due":[206],"multiple":[208],"paths":[209],"output.":[212],"Monotonic":[213],"simple":[218],"gated":[219],"ME":[220],"override":[221],"structure":[222],"allow":[223],"removal":[224],"glitches":[226],"minimal":[230],"impact.":[232]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}