首页> 外文会议>2019 56th ACM/IEEE Design Automation Conference >A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing *
【24h】

A DAG-Based Algorithm for Obstacle-Aware Topology-Matching On-Track Bus Routing *

机译:基于DAG的障碍物感知拓扑匹配的轨道公交车路线选择算法*

获取原文
获取原文并翻译 | 示例

摘要

As clock frequencies increase, topology-matching bus routing is desired to provide an initial routing result which facilitates the following buffer insertion to meet the timing constraints. Our algorithm consists of three main techniques: (1) a bus clustering method to reduce the routing complexity, (2) a DAG-based algorithm to connect a bus in the specific topology, and (3) a rip-up and re-route scheme to alleviate the routing congestion. Experimental results show that our proposed algorithm outperforms all the participating teams of the 2018 CAD Contest at ICCAD, where the top-3 routers result in 145%, 158%, and 420% higher costs than ours.CCS CONCEPTS. Hardware → Electronic design automation;
机译:随着时钟频率的增加,需要拓扑匹配的总线路由来提供初始路由结果,从而促进后续缓冲器的插入以满足时序约束。我们的算法包含三种主要技术:(1)总线聚类方法以降低路由复杂性;(2)基于DAG的算法以特定拓扑连接总线;(3)翻录和重新路由缓解路由拥塞的方案。实验结果表明,我们提出的算法优于所有参加ICCAD 2018年CAD竞赛的团队,其中前三名路由器的成本比我们的CCS CONCEPTS高145%,158%和420%。硬件→电子设计自动化;

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号