{"id":"https://openalex.org/W2018097644","doi":"https://doi.org/10.1145/378741.378761","title":"Parallel implementation of an efficient microcode compaction algorithm","display_name":"Parallel implementation of an efficient microcode compaction algorithm","publication_year":1986,"publication_date":"1986-12-01","ids":{"openalex":"https://openalex.org/W2018097644","doi":"https://doi.org/10.1145/378741.378761","mag":"2018097644"},"language":"en","primary_location":{"id":"doi:10.1145/378741.378761","doi":"https://doi.org/10.1145/378741.378761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378741.378761","pdf_url":null,"source":{"id":"https://openalex.org/S81742775","display_name":"ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter","issn_l":"0163-5751","issn":["0163-5751","0892-3825","1050-916X","1558-0296"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMICRO Newsletter","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5103518037","display_name":"S. Upendra Rao","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Upendra Rao","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031985287","display_name":"G. P. Shattacharjee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. P. Shattacharjee","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003426629","display_name":"Arun Kumar Majumdar","orcid":"https://orcid.org/0000-0001-8248-0252","observed_orcids":["https://orcid.org/0000-0001-8248-0252"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. K. Majumdar","raw_affiliation_strings":[""],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"3","first_page":"13","last_page":"19"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9854000210762024,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9854000210762024,"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/T11269","display_name":"Algorithms and Data Compression","score":0.008500000461935997,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.0013000000035390258,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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/parallel-algorithms","display_name":"parallel algorithms","score":0.9810000061988831},{"id":"https://openalex.org/keywords/algorithm-decomposition","display_name":"algorithm decomposition","score":0.734000027179718},{"id":"https://openalex.org/keywords/computation-scheduling","display_name":"computation scheduling","score":0.5429999828338623},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.7889999747276306},{"id":"https://openalex.org/keywords/parallelism-analysis","display_name":"parallelism analysis","score":0.4860000014305115}],"concepts":[{"id":"https://openalex.org/C22174128","wikidata":"https://www.wikidata.org/wiki/Q175869","display_name":"Microcode","level":2,"score":0.9230602979660034},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8276938199996948},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7541913390159607},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.560160756111145},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5247214436531067},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.49873876571655273},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.47984999418258667},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.45587271451950073},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.11019575595855713},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/378741.378761","doi":"https://doi.org/10.1145/378741.378761","is_oa":false,"landing_page_url":"https://doi.org/10.1145/378741.378761","pdf_url":null,"source":{"id":"https://openalex.org/S81742775","display_name":"ACM SIGMICRO newsletter/SIGMICRO newsletter/SIGMICRO, TCMICRO newsletter","issn_l":"0163-5751","issn":["0163-5751","0892-3825","1050-916X","1558-0296"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM SIGMICRO Newsletter","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W75076678","https://openalex.org/W1586380695","https://openalex.org/W1977119258","https://openalex.org/W1978615272","https://openalex.org/W2050733479","https://openalex.org/W2069446854"],"related_works":["https://openalex.org/W2291074646","https://openalex.org/W4234495277","https://openalex.org/W4249842786","https://openalex.org/W3151999169","https://openalex.org/W2542022801","https://openalex.org/W2063225621","https://openalex.org/W4235477902","https://openalex.org/W1830893350","https://openalex.org/W2118315626","https://openalex.org/W1978493002"],"abstract_inverted_index":{"A":[0],"derivation":[1],"of":[2,5,22,37,42],"parallel":[3,39,62],"implementation":[4,40],"an":[6],"efficient":[7,61],"microcode":[8,65],"compaction":[9],"algorithm":[10,16],"has":[11],"been":[12],"described.":[13],"The":[14,34],"serial":[15],"is":[17,32,41],"decomposed":[18],"into":[19],"four":[20],"schedules":[21,31],"computations.":[23],"Parallelism":[24],"within":[25],"a":[26],"schedule":[27],"and":[28],"between":[29],"the":[30,38],"examined.":[33],"time":[35],"complexity":[36],"O(n":[43,47],"2":[44],")":[45],"when":[46],"3":[48],"processors":[49],"are":[50],"available.":[51],"This":[52],"initial":[53],"attempt":[54],"may":[55],"motivate":[56],"further":[57],"investigations":[58],"in":[59],"designing":[60],"algorithms":[63],"for":[64],"compaction.":[66]},"counts_by_year":[],"updated_date":"2026-09-22T06:50:58.402377","created_date":"2016-06-24T00:00:00"}