首页> 外文会议>IEEE/ACM International Conference on Computer-Aided Design >Blockage-aware terminal propagation for placement wirelength minimization
【24h】

Blockage-aware terminal propagation for placement wirelength minimization

机译:可感知阻塞的终端传播,可最大程度地减小布线长度

获取原文

摘要

Wirelength is the most fundamental objective in placement because it also affects various placement metrics (routability, timing, etc.). Half-perimeter wirelength (HPWL) is a pervasive metric for circuit placement. However, preplaced blocks (i.e., blockages) might misguide an HPWL-based placer to generate a placement solution that incurs significant routing detours. Consequently, it is desirable to develop an effective method to resolve the HPWL-rooted routing detour problem for placement optimization. This paper presents an efficient, generic, yet effective terminal propagation algorithm as a pre-placement process which can readily be integrated into a traditional placement flow to improve wirelength (and routability). Our algorithm identifies a region for each preplaced terminal according to its connectivity, and applies a minimum-cost maximum flow algorithm to propagate all preplaced terminals to their feasible propagation locations with the minimum total propagation length. Experimental results show that our flow with terminal propagation can reduce both global routed wirelength and routing congestion by 4% on average, compared with one without terminal propagation. In particular, our work also provides a long unnoticed insight into placement optimization with blockages, which can be addressed with an efficient, generic, yet effective scheme.
机译:线长是放置的最基本目标,因为它也会影响各种放置度量(可布线性,时序等)。半周线长(HPWL)是电路布置的普遍指标。但是,预先放置的块(即,障碍物)可能会误导基于HPWL的布局器,以生成会导致明显绕线的布局解决方案。因此,期望开发一种有效的方法来解决基于HPWL的路由绕行问题,以进行布局优化。本文提出了一种有效,通用但有效的端子传播算法,作为预放置过程,可以很容易地将其集成到传统的放置流程中,以改善线长(和可布线性)。我们的算法会根据每个预先放置的终端的连通性为其确定一个区域,并应用最低成本的最大流量算法以最小的总传播长度将所有预先放置的终端传播到其可行的传播位置。实验结果表明,与没有终端传播的流相比,具有终端传播的流平均可以减少4%的全局路由线长和路由拥塞。特别是,我们的工作还提供了对带有障碍物的布局优化的长期未引起注意的洞察力,可以使用有效,通用但有效的方案来解决这一问题。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号