Madhushika M. E. Karunarathna, Yu-Chu Tian, C. Fidge, R. Hayward
{"title":"Algorithm clustering for multi-algorithm processor design","authors":"Madhushika M. E. Karunarathna, Yu-Chu Tian, C. Fidge, R. Hayward","doi":"10.1109/ICCD.2013.6657080","DOIUrl":null,"url":null,"abstract":"An Application Specific Instruction-set Processor (ASIP) is a specialized processor tailored to run a particular application/s efficiently. However, when there are multiple candidate applications in the application's domain it is difficult and time consuming to find optimum set of applications to be implemented. Existing ASIP design approaches perform this selection manually based on a designer's knowledge. We help in cutting down the number of candidate applications by devising a classification method to cluster similar applications based on the special-purpose operations they share. This provides a significant reduction in the comparison overhead while resulting in customized ASIP instruction sets which can benefit a whole family of related applications. Our method gives users the ability to quantify the degree of similarity between the sets of shared operations to control the size of clusters. A case study involving twelve algorithms confirms that our approach can successfully cluster similar algorithms together based on the similarity of their component operations.","PeriodicalId":398811,"journal":{"name":"2013 IEEE 31st International Conference on Computer Design (ICCD)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE 31st International Conference on Computer Design (ICCD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCD.2013.6657080","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4
Abstract
An Application Specific Instruction-set Processor (ASIP) is a specialized processor tailored to run a particular application/s efficiently. However, when there are multiple candidate applications in the application's domain it is difficult and time consuming to find optimum set of applications to be implemented. Existing ASIP design approaches perform this selection manually based on a designer's knowledge. We help in cutting down the number of candidate applications by devising a classification method to cluster similar applications based on the special-purpose operations they share. This provides a significant reduction in the comparison overhead while resulting in customized ASIP instruction sets which can benefit a whole family of related applications. Our method gives users the ability to quantify the degree of similarity between the sets of shared operations to control the size of clusters. A case study involving twelve algorithms confirms that our approach can successfully cluster similar algorithms together based on the similarity of their component operations.
应用特定指令集处理器(Application Specific Instruction-set Processor, ASIP)是为高效运行特定应用程序而定制的专用处理器。然而,当应用程序的域中有多个候选应用程序时,找到要实现的最佳应用程序集是困难且耗时的。现有的ASIP设计方法根据设计人员的知识手动执行这种选择。我们设计了一种分类方法,根据它们共享的特殊目的操作对类似的应用程序进行聚类,从而帮助减少候选应用程序的数量。这大大减少了比较开销,同时产生了自定义的ASIP指令集,这可以使整个相关应用程序家族受益。我们的方法使用户能够量化共享操作集之间的相似程度,以控制集群的大小。一个涉及12种算法的案例研究证实,我们的方法可以基于其组件操作的相似性成功地将相似算法聚类在一起。