缓冲全局路由的多商品流算法
Multicommodity Flow Algorithms for Buffered Global Routing
摘要：
在本文中，我们描述了一个新的算法，缓冲全局布线根据一个指定的缓冲区网站地图。具体而言，我们描述了一个可证明良好的多商品流为基础的算法，找到一个全球性的路由最小化缓冲区和电线拥塞的路由区域（线长和缓冲区的数量）和水槽延迟的约束。我们的算法允许计算布线面积和线/缓冲区拥塞之间的权衡曲线下的延迟和容量约束的任何组合，并同时执行缓冲区/线的大小，以及层和引脚分配。实验结果表明，接近最优的结果与实际的运行时间。
英文摘要：
In this paper we describe a new algorithm for buffered global routing according to a prescribed buffer site map. Specifically, we describe a provably good multi-commodity flow based algorithm that finds a global routing minimizing buffer and wire congestion subject to given constraints on routing area (wirelength and number of buffers) and sink delays. Our algorithm allows computing the tradeoff curve between routing area and wire/buffer congestion under any combination of delay and capacity constraints, and simultaneously performs buffer/wire sizing, as well as layer and pin assignment. Experimental results show that near-optimal results are obtained with a practical runtime.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
