{"title":"一种快速有效的自顶向下的领域特定设计方法","authors":"Ming Yan, Ziyu Yang, Sikun Li, Liu Yang","doi":"10.1109/ICISA.2011.5772316","DOIUrl":null,"url":null,"abstract":"Domain specific design of reconfigurable architecture is a hard and time-consuming job. In this paper, a fast and effective domain-specific design method is proposed which mainly concludes a top-down subgraph enumeration algorithm and a heuristic identification process based on topological searching. A clustering and splitting algorithm is used to enumerate all the maximal valid subgraphs (MVSs) of the topological ordered source dataflow graph. These MVSs are then searched topologically to identify all the convex subgraphs for candidate functions. During the identification, heuristic rules are used for search space pruning. Candidate convex subgraphs are finally grouped into function sets for function unit design. Experiment results show that the subgraph enumeration speed is improved in most cases. With the combination of fast MVS enumeration and topological searching, a small number of candidate functions are identified, which shows that the proposed design method is practical and effective.","PeriodicalId":425210,"journal":{"name":"2011 International Conference on Information Science and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Fast and Effective Domain-Specific Design Method with a Top-Down Scheme\",\"authors\":\"Ming Yan, Ziyu Yang, Sikun Li, Liu Yang\",\"doi\":\"10.1109/ICISA.2011.5772316\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Domain specific design of reconfigurable architecture is a hard and time-consuming job. In this paper, a fast and effective domain-specific design method is proposed which mainly concludes a top-down subgraph enumeration algorithm and a heuristic identification process based on topological searching. A clustering and splitting algorithm is used to enumerate all the maximal valid subgraphs (MVSs) of the topological ordered source dataflow graph. These MVSs are then searched topologically to identify all the convex subgraphs for candidate functions. During the identification, heuristic rules are used for search space pruning. Candidate convex subgraphs are finally grouped into function sets for function unit design. Experiment results show that the subgraph enumeration speed is improved in most cases. With the combination of fast MVS enumeration and topological searching, a small number of candidate functions are identified, which shows that the proposed design method is practical and effective.\",\"PeriodicalId\":425210,\"journal\":{\"name\":\"2011 International Conference on Information Science and Applications\",\"volume\":\"26 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-04-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 International Conference on Information Science and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICISA.2011.5772316\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Information Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICISA.2011.5772316","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Fast and Effective Domain-Specific Design Method with a Top-Down Scheme
Domain specific design of reconfigurable architecture is a hard and time-consuming job. In this paper, a fast and effective domain-specific design method is proposed which mainly concludes a top-down subgraph enumeration algorithm and a heuristic identification process based on topological searching. A clustering and splitting algorithm is used to enumerate all the maximal valid subgraphs (MVSs) of the topological ordered source dataflow graph. These MVSs are then searched topologically to identify all the convex subgraphs for candidate functions. During the identification, heuristic rules are used for search space pruning. Candidate convex subgraphs are finally grouped into function sets for function unit design. Experiment results show that the subgraph enumeration speed is improved in most cases. With the combination of fast MVS enumeration and topological searching, a small number of candidate functions are identified, which shows that the proposed design method is practical and effective.