蝴蝶
现场可编程门阵列
树(集合论)
计算机科学
不对称
数学
组合数学
生物
嵌入式系统
生态学
物理
粒子物理学
作者
Dongjoon Park,Zhijing Yao,Yuanlong Xiao,André DeHon
标识
DOI:10.1109/icfpt59805.2023.00030
摘要
Among various topologies for FPGA overlay Network-on-Chip (NoC), the Butterfly Fat Tree (BFT) is known to be fast and lightweight. The BFT has a hierarchical structure that allows the routing capacity of each level to be configured with bandwidth-reducing t switches and bandwidth-preserving $\pi$ switches, and this configuration can be exploited to customize the NoC resources, spending area as needed to match the bandwidth requirements of the application. However, a traditional BFT is symmetric: switch types in all subtrees in the same level are identical; this does not fully exploit the customization offered by the FPGA. We evaluate asymmetric BFTs that have different bandwidth in their subtrees, and we develop a converging switch built with t switches that connects subtrees with different bandwidths. Given the same resource budget, asymmetric BFTs perform better than symmetric BFTs when NoC traffic is highly unbalanced. In realistic workloads and statistical traffic patterns, asymmetric BFTs achieve up to 32% and 76% more throughput than symmetric BFTs, respectively.
科研通智能强力驱动
Strongly Powered by AbleSci AI