一种快速有效的自顶向下的领域特定设计方法

Ming Yan, Ziyu Yang, Sikun Li, Liu Yang
{"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}
引用次数: 0

摘要

可重构体系结构的领域特定设计是一项艰巨而耗时的工作。本文提出了一种快速有效的特定领域设计方法,主要包括自顶向下子图枚举算法和基于拓扑搜索的启发式识别算法。采用聚类分割算法枚举拓扑有序源数据流图的所有最大有效子图。然后对这些mvs进行拓扑搜索,以识别候选函数的所有凸子图。在识别过程中,使用启发式规则对搜索空间进行修剪。最后将候选凸子图分组成函数集进行功能单元设计。实验结果表明,在大多数情况下,子图的枚举速度都有所提高。将快速MVS枚举与拓扑搜索相结合,识别出少量候选函数,验证了该设计方法的实用性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信