报告时间：2025年03月27日 16：00开始
报 告 人：张晓岩（南京师范大学 教授）
报告地点：9-113
报告题目：New Routing Problem in FPGA Chip Design
报告摘要：The IC has developed rapidly as the birth of the first transistor in the world. The characteristics of small size, large density and high integration of modern chips make routing design more and more difficult. In the system level FPGA routing design problem, each edge has different time TDM ratios in different FPGA nets when using time division multiplexing technology, and unreasonable TDM ratio will lead to increasing signal delay of the whole system. In order to reduce the signal delay of the whole system, it is important to design a reasonable routing scheme considering the TDM ratio. For the task, we first propose a method of constructing approximate minimum Steiner tree based on shortest path and disjoint shortest path respectively, which is applied to find the specific routing path of signal transmission in dual FPGA net and multi-FPGA net respectively. Then, a time-sharing multiplexing ratio allocation scheme based on group sizes of FPGA networks is proposed to allocate the TDM ratio for each routing path of FPGA network.
报告人简介：张晓岩，先后在南开大学和荷兰特文特大学获得应用数学和理论计算机科学方向博士学位，现为南京师范大学数学科学学院及数学研究所教授、博士生导师，中国科学院深圳先进技术研究院数字所高性能计算中心客座研究员，国家重大人才计划领军人才入选者，江苏省六大人才高峰高层次人才入选者，江苏省智库青年人才计划入选者，中国运筹学图论与组合分会常务理事，中国运筹学数学规划分会理事，中国运筹学算法软件与应用分会理事，中国工业应用数学学会图论及组合应用专委会委员，中国计算机学会理论计算机科学专业委员会执行委员，研究成果发表在《SIAM J. Computing》、《SIAM J. Scientific Computing》、《SIAM J. Discrete Math》、《IEEE Transactions on information Theory》、《Science China Mathematics》等国内外著名期刊，著有英文学术论著两部及译著一部等。
