|
| 基于粗粒度可重构体系结构映射的Petri网时延特性分析 |
| Analysis of Time Delay Characteristics of Petri Nets Based on Coarse Grained Reconfigurable Architecture Mapping |
| |
| DOI：10.16018/j.cnki.cn32-1650/n.202403008 |
| 中文关键词: Petri网 时延特性分析 粗粒度可重构体系结构 映射 |
| 英文关键词: Petri net time delay characteristics analysis coarse grained reconfigurable architecture mapping |
| 基金项目: |
|
| 摘要点击次数: 47 |
| 全文下载次数: 48 |
| 中文摘要: |
| 针对多约束下粗粒度可重构计算阵列数据流图的映射问题，进行了时间Petri网的分析与建模，并提出了宽度映射和宽度贪心映射两种算法；基于一组实验基准和随机选取的处理单元阵列PEA4×4和PEA5×5对这两种算法进行测试。结果表明，相比于宽度映射算法，宽度贪心映射算法在映射块数、执行时延、输入输出访存成本等方面均获得了优化，平均总时延降低了24. 5%。 |
| 英文摘要: |
| Aiming at the mapping problem of data flow graph of coarse-grained reconfigurable computing array under multiple constraints, the time Petri net is analyzed and modeled, and two algorithms, width mapping and width greedy mapping, are proposed. These two algorithms are tested based on a set of experimental benchmarks and randomly selected processing unit arrays PEA4×4 and PEA5×5. The results show that compared with the width mapping algorithm, the width greedy mapping algorithm is optimized in the number of mapping blocks, execution delay, input and output memory access costs, and the average total delay is reduced by 24. 5%. |
|
查看全文
查看/发表评论 下载PDF阅读器 |
| 关闭 |