{"id":"https://openalex.org/W2039616222","doi":"https://doi.org/10.1109/tc.1983.1676136","title":"Global Compaction of Horizontal Microprograms Based on the Generalized Data Dependency Graph","display_name":"Global Compaction of Horizontal Microprograms Based on the Generalized Data Dependency Graph","publication_year":1983,"publication_date":"1983-10-01","ids":{"openalex":"https://openalex.org/W2039616222","doi":"https://doi.org/10.1109/tc.1983.1676136","mag":"2039616222"},"language":"en","primary_location":{"id":"doi:10.1109/tc.1983.1676136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676136","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-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/A5098194726","display_name":"Isoda","orcid":null},"institutions":[{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Isoda","raw_affiliation_strings":["Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation"],"affiliations":[{"raw_affiliation_string":"Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation","institution_ids":["https://openalex.org/I2251713219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103961972","display_name":"Ryuji Kobayashi","orcid":"https://orcid.org/0000-0001-9485-2877"},"institutions":[{"id":"https://openalex.org/I4210092597","display_name":"NTT (United States)","ror":"https://ror.org/004cn7092","country_code":"US","type":"company","lineage":["https://openalex.org/I2251713219","https://openalex.org/I4210092597"]},{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Kobayashi","raw_affiliation_strings":["Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation, Yokosuka, Japan","Nippon Telegraph & Telephone"],"affiliations":[{"raw_affiliation_string":"Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation, Yokosuka, Japan","institution_ids":["https://openalex.org/I2251713219"]},{"raw_affiliation_string":"Nippon Telegraph & Telephone","institution_ids":["https://openalex.org/I4210092597"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100678332","display_name":"Toru Ishida","orcid":"https://orcid.org/0000-0002-0479-4990"},"institutions":[{"id":"https://openalex.org/I4210092597","display_name":"NTT (United States)","ror":"https://ror.org/004cn7092","country_code":"US","type":"company","lineage":["https://openalex.org/I2251713219","https://openalex.org/I4210092597"]},{"id":"https://openalex.org/I2251713219","display_name":"NTT (Japan)","ror":"https://ror.org/00berct97","country_code":"JP","type":"company","lineage":["https://openalex.org/I2251713219"]}],"countries":["JP","US"],"is_corresponding":false,"raw_author_name":"Ishida","raw_affiliation_strings":["Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation","Nippon Telegraph & Telephone"],"affiliations":[{"raw_affiliation_string":"Yokosuka Electrical Communications Laboratory, Nippon Telegraph and Telephone Public Corporation","institution_ids":["https://openalex.org/I2251713219"]},{"raw_affiliation_string":"Nippon Telegraph & Telephone","institution_ids":["https://openalex.org/I4210092597"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5098194726"],"corresponding_institution_ids":["https://openalex.org/I2251713219"],"apc_list":null,"apc_paid":null,"fwci":16.5239,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.99103269,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"C-32","issue":"10","first_page":"922","last_page":"933"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9884999990463257,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T11159","display_name":"Manufacturing Process and Optimization","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9635000228881836,"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/computer-science","display_name":"Computer science","score":0.7728314995765686},{"id":"https://openalex.org/keywords/joins","display_name":"Joins","score":0.6301215887069702},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.5883542895317078},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5372647047042847},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5127075910568237},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4960220754146576},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.4947201907634735},{"id":"https://openalex.org/keywords/graph-rewriting","display_name":"Graph rewriting","score":0.4912208914756775},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.47809264063835144},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4770445227622986},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45714548230171204},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.44591617584228516},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19752487540245056},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16855937242507935},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.1137438714504242},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.0910375714302063}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7728314995765686},{"id":"https://openalex.org/C2778692605","wikidata":"https://www.wikidata.org/wiki/Q4041866","display_name":"Joins","level":2,"score":0.6301215887069702},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.5883542895317078},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5372647047042847},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5127075910568237},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4960220754146576},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.4947201907634735},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.4912208914756775},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.47809264063835144},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4770445227622986},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45714548230171204},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.44591617584228516},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19752487540245056},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16855937242507935},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1137438714504242},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0910375714302063}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.1983.1676136","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.1983.1676136","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W115472982","https://openalex.org/W160072735","https://openalex.org/W1771462325","https://openalex.org/W1830893350","https://openalex.org/W2022102618","https://openalex.org/W2057108708","https://openalex.org/W2071569284","https://openalex.org/W2088017390","https://openalex.org/W2096914045","https://openalex.org/W2110216881","https://openalex.org/W2122439715","https://openalex.org/W2129962996","https://openalex.org/W2144332475","https://openalex.org/W6606530839","https://openalex.org/W6681259748"],"related_works":["https://openalex.org/W178284250","https://openalex.org/W184125031","https://openalex.org/W2781641597","https://openalex.org/W2614382400","https://openalex.org/W4385767751","https://openalex.org/W6981529","https://openalex.org/W2296442979","https://openalex.org/W4283392482","https://openalex.org/W2148543908","https://openalex.org/W2185595643"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,23,53,66,71,83],"global":[4],"compaction":[5],"algorithm":[6,20,57],"which":[7,29,135],"can":[8,30,143],"produce":[9],"efficient":[10],"microprograms":[11],"with":[12],"respect":[13],"to":[14,89],"both":[15],"space":[16],"and":[17,37,75,130],"time.":[18],"The":[19,122],"depends":[21],"upon":[22],"generalized":[24],"data":[25],"dependency":[26],"graph":[27],"(GDDG),":[28],"integratedly":[31],"express":[32],"the":[33,41,49,56,90,109,126],"concurrency":[34],"of":[35,43,70,73,82,85,95,125,134],"microorders":[36,101,141],"their":[38],"mobility":[39],"past":[40],"boundaries":[42],"basic":[44,113,136,150],"blocks,":[45],"as":[46,48,117,120],"well":[47],"control":[50,127],"flow":[51],"for":[52],"microprogram.":[54],"In":[55],"an":[58],"initial":[59],"GDDG":[60],"is":[61,77],"first":[62],"built":[63],"up":[64],"from":[65],"source":[67],"microprogram":[68],"consisting":[69],"sequence":[72],"microorders,":[74],"this":[76],"transformed":[78],"by":[79],"repeated":[80],"application":[81],"set":[84],"microscopic":[86],"transformation":[87],"rules":[88],"graph's":[91],"edges":[92],"until":[93],"all":[94],"them":[96],"have":[97],"been":[98],"examined.":[99],"Then":[100],"are":[102],"packed":[103],"into":[104],"microinstruction":[105],"fields":[106],"so":[107],"that":[108,142],"more":[110,147],"frequently":[111],"executed":[112],"blocks":[114],"may":[115],"contain":[116],"few":[118],"microinstructions":[119],"possible.":[121],"intrinsic":[123],"nature":[124],"flow's":[128],"joins":[129],"forks":[131],"allows":[132],"determination":[133],"block":[137],"should":[138],"accommodate":[139],"those":[140],"be":[144],"placed":[145],"in":[146],"than":[148],"one":[149],"block.":[151]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}