{"title":"并行实现一种高效的微码压缩算法","authors":"S. U. Rao, G. P. Shattacharjee, A. Majumdar","doi":"10.1145/378741.378761","DOIUrl":null,"url":null,"abstract":"A derivation of parallel implementation of an efficient microcode compaction algorithm has been described. The serial algorithm is decomposed into four schedules of computations. Parallelism within a schedule and between the schedules is examined. The time complexity of the parallel implementation is of O(n2) when O(n3 processors are available. This initial attempt may motivate further investigations in designing efficient parallel algorithms for microcode compaction.","PeriodicalId":138968,"journal":{"name":"ACM Sigmicro Newsletter","volume":"129 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1986-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Parallel implementation of an efficient microcode compaction algorithm\",\"authors\":\"S. U. Rao, G. P. Shattacharjee, A. Majumdar\",\"doi\":\"10.1145/378741.378761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A derivation of parallel implementation of an efficient microcode compaction algorithm has been described. The serial algorithm is decomposed into four schedules of computations. Parallelism within a schedule and between the schedules is examined. The time complexity of the parallel implementation is of O(n2) when O(n3 processors are available. This initial attempt may motivate further investigations in designing efficient parallel algorithms for microcode compaction.\",\"PeriodicalId\":138968,\"journal\":{\"name\":\"ACM Sigmicro Newsletter\",\"volume\":\"129 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1986-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM Sigmicro Newsletter\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/378741.378761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM Sigmicro Newsletter","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/378741.378761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Parallel implementation of an efficient microcode compaction algorithm
A derivation of parallel implementation of an efficient microcode compaction algorithm has been described. The serial algorithm is decomposed into four schedules of computations. Parallelism within a schedule and between the schedules is examined. The time complexity of the parallel implementation is of O(n2) when O(n3 processors are available. This initial attempt may motivate further investigations in designing efficient parallel algorithms for microcode compaction.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
