逃离平地:一种用于使3D FPGA可行的布局流程
Escaping Flatland: A Placement Flow for Enabling 3D FPGAs
AI总结:
本文提出了一种针对3D FPGA的布局流程,通过改进的初始化、自适应成本调度、精细延迟估计和模拟退火移动集,提升了时序估计和层分配探索能力,实验结果显示在多个3D架构上实现了显著的延迟和布线长度减少。
摘要:
本文提出了一种针对3D FPGA的布局流程,通过改进的初始化、自适应成本调度、精细延迟估计和模拟退火移动集,提升了时序估计和层分配探索能力,实验结果显示在多个3D架构上实现了显著的延迟和布线长度减少。
英文摘要:
3D field-programmable gate arrays (FPGAs) promise higher performance through vertical integration. However, existing placement tools, largely inherited from 2D frameworks, fail to capture the unique delay characteristics and optimization dynamics of 3D fabrics. We introduce a 3D FPGA placement flow that integrates partitioning-based initialization, adaptive cost scheduling, refined delay estimation, and a simulated annealing move set -- all targeted at 3D FPGA architecture. Together, these enhancements improve timing estimates and the exploration of layer assignments during placement. Compared to Verilog-To-Routing (VTR), our experiments show geometric-mean (max) critical-path delay reductions of ~3% (~7%), ~2% (~4%), ~3% (~8%), and ~6% (~18%) for four 3D architectures: 3D CB, 3D CB-O, 3D CB-I, and 3D SB, respectively. We also achieve geometric-mean (max) routed wirelength reductions of ~1% (~3%), ~2% (~8%), < 1% (~5%), and ~5% (~10%), respectively. Our work will be permissively open-sourced on GitHub.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。