{"id":"https://openalex.org/W2131192434","doi":"https://doi.org/10.1109/icpp.1996.537379","title":"A parallel algorithm for state assignment of finite state machines","display_name":"A parallel algorithm for state assignment of finite state machines","publication_year":2002,"publication_date":"2002-12-23","ids":{"openalex":"https://openalex.org/W2131192434","doi":"https://doi.org/10.1109/icpp.1996.537379","mag":"2131192434"},"language":"en","primary_location":{"id":"doi:10.1109/icpp.1996.537379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1996.537379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing","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/A5069880450","display_name":"Gagan Hasteer","orcid":null},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"G. Hasteer","raw_affiliation_strings":["Center for Reliable and High-Performance Computing Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","[Coordinated Sci. Lab, Illinois Univ., Urbana, IL, USA]"],"affiliations":[{"raw_affiliation_string":"Center for Reliable and High-Performance Computing Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[Coordinated Sci. Lab, Illinois Univ., Urbana, IL, USA]","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106232660","display_name":"P. Banerjee","orcid":"https://orcid.org/0009-0005-3184-6871"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"P. Banerjee","raw_affiliation_strings":["Center for Reliable and High-Performance Computing Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","[Coordinated Sci. Lab, Illinois Univ., Urbana, IL, USA]"],"affiliations":[{"raw_affiliation_string":"Center for Reliable and High-Performance Computing Coordinated Science Laboratory, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"[Coordinated Sci. Lab, Illinois Univ., Urbana, IL, USA]","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5069880450"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.4131,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59558527,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"37","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9998000264167786,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9998000264167786,"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"}},{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"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/mimd","display_name":"MIMD","score":0.9081652164459229},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8304165005683899},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.7151111364364624},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.691858172416687},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.602304220199585},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5644816160202026},{"id":"https://openalex.org/keywords/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.5574564337730408},{"id":"https://openalex.org/keywords/sequential-logic","display_name":"Sequential logic","score":0.5487374663352966},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.542100191116333},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5101611614227295},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5043174028396606},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.43791598081588745},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.430076539516449},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.18062874674797058},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.12622442841529846}],"concepts":[{"id":"https://openalex.org/C21032095","wikidata":"https://www.wikidata.org/wiki/Q1149237","display_name":"MIMD","level":2,"score":0.9081652164459229},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8304165005683899},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.7151111364364624},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.691858172416687},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.602304220199585},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5644816160202026},{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.5574564337730408},{"id":"https://openalex.org/C187075797","wikidata":"https://www.wikidata.org/wiki/Q173245","display_name":"Sequential logic","level":3,"score":0.5487374663352966},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.542100191116333},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5101611614227295},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5043174028396606},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.43791598081588745},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.430076539516449},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.18062874674797058},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.12622442841529846},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icpp.1996.537379","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icpp.1996.537379","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1490892972","https://openalex.org/W1511688816","https://openalex.org/W1530842973","https://openalex.org/W2062052521","https://openalex.org/W2082909013","https://openalex.org/W2105285196","https://openalex.org/W2120131052","https://openalex.org/W2128455960","https://openalex.org/W2131192434","https://openalex.org/W2148830996","https://openalex.org/W2158888072","https://openalex.org/W4251148314"],"related_works":["https://openalex.org/W2140735019","https://openalex.org/W2535130387","https://openalex.org/W2164472685","https://openalex.org/W4240835585","https://openalex.org/W2115632251","https://openalex.org/W2380486102","https://openalex.org/W2205347728","https://openalex.org/W2188166871","https://openalex.org/W2045651232","https://openalex.org/W1531819087"],"abstract_inverted_index":{"Optimization":[0],"of":[1,10,61,65,83],"huge":[2],"sequential":[3,76,93],"circuits":[4],"has":[5,38],"become":[6],"unmanageable":[7],"in":[8],"CAD":[9],"VLSI":[11],"due":[12],"to":[13,69,79,91],"enormous":[14],"time":[15],"and":[16,54],"memory":[17,55],"requirements.":[18],"In":[19],"this":[20],"paper,":[21],"we":[22],"report":[23],"a":[24,59],"parallel":[25,46],"algorithm":[26,37,47,77,94],"for":[27,32,86],"the":[28,75,84,92],"state":[29,34],"assignment":[30],"problem":[31,72],"finite":[33],"machines.":[35,52],"Our":[36],"three":[39],"significant":[40],"contributions:":[41],"It":[42],"is":[43,98],"an":[44],"asynchronous":[45],"portable":[48],"across":[49],"different":[50],"MIMD":[51],"Time":[53],"requirements":[56],"reduce":[57],"by":[58],"factor":[60],"P":[62],"(the":[63],"number":[64],"processors),":[66],"enabling":[67],"it":[68,97],"handle":[70],"large":[71],"sizes":[73],"which":[74,96],"fails":[78],"handle.":[80],"The":[81],"quality":[82],"results":[85],"multiprocessor":[87],"runs":[88],"remains":[89],"comparable":[90],"on":[95],"based.":[99]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}