首页> 外文会议>International workshop on system level interconnect prediction >Perimeter-Degree: A Priori Metric for Directly Measuring and Homogenizing Interconnection Complexity in Multilevel Placement
【24h】

Perimeter-Degree: A Priori Metric for Directly Measuring and Homogenizing Interconnection Complexity in Multilevel Placement

机译:周边学位:在多级放置中直接测量和均匀化互连复杂度的先验度量

获取原文
获取外文期刊封面目录资料

摘要

In this paper, we describe an accurate metric (perimeter-degree) for measuring interconnection complexity and effective use of it for controlling congestion in a multilevel framework. Perimeter-degree is useful for uniformly spreading interconnection density. In modern designs interconnects consume significant area and power. By making interconnect spread homogeneous, it is possible to improve routability as well as power dissipation distribution. Most of the existing congestion minimization heuristics are posteriori. In this work, we extend and complement our previous work on priori congestion minimization techniques. In [16], we identified and used perimeter-degree for constructing congestion friendly clusters. This paper extends that work by unveiling perimeter-degree based whitespace allocation techniques. We show why "number of external nets" is not a desirable candidate for identifying potential regions of high interconnect density and provide perimeter-degree as a possible alternative. We also provide empirical evidence for the effectiveness of perimeter-degree in effectively identifying congested regions even before they are formed. By implicitly allocating resources to these potential high interconnect density regions, 19% reduction in congestion was achieved. Traditionally, bin capacity bounds are expressed in units of area. In a true interconnect centric approach we ignore area and instead use interconnect complexity as weights for clusters and capacity bounds for bins. This technique creates a placement with homogeneous interconnect density, but slightly unbalanced utilization. On average, this novel interconnect complexity driven scheme reduces congestion by 26%.
机译:在本文中,我们描述了一种精确的公制(周长度),用于测量互连复杂度和有效使用它来控制多级框架中的拥塞。周边度可用于均匀地扩散互连密度。在现代设计中,互连消耗了显着的区域和功率。通过使互连扩散均匀,可以提高可排水性以及功耗分布。大多数现有拥塞最小化启发式是后验。在这项工作中,我们延长并补充了我们以前的工作,以先验拥塞最小化技术。在[16]中,我们识别和使用周边程度来构建拥堵友好群集。本文通过揭示基于周边的空白分配技术来扩展该工作。我们展示了为什么“外网数”不是用于识别高互连密度的潜在区域的理想候选,并提供周边度作为可能的替代方案。我们还提供了甚至在形成之前有效识别拥挤区域的周边程度的经验证据。通过隐含地分配给这些潜在的高互连密度区域,实现了拥塞的19%。传统上,箱容量界限以区域为单位表示。在真正的互连中心方法中,我们忽略区域,而是使用互连复杂度作为群体的集群和容量界限的权重。该技术创造了具有均匀互连密度的放置,但利用略微不平衡。平均而言,这种新颖的互连复杂性驱动方案可降低26%的拥塞。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号