首页> 外文会议>Conference on Asia South Pacific design automation >A buffer planning algorithm based on dead space redistribution
【24h】

A buffer planning algorithm based on dead space redistribution

机译:基于死空间重新分配的缓冲区规划算法

获取原文

摘要

This paper studies the buffer planning problem for interconnect-centric floorplanning for nanometer technologies. The dead-spaces are the spaces within a placement that are not held by any circuit block. In this paper, we proposed a buffer planning algorithm based on dead space redistribution to make good use of dead-spaces for buffer insertion. Associated with circuit blocks under topological representations, the dead space can be redistributed by freely moving some circuit blocks within their rooms in the placement. The total area and the topology of the placement keep unchanged while doing the dead space redistribution. The number of nets satisfying the delay constraint can be increased by redistributing the dead space all over the placement, which has been demonstrated by the experimental results. The increment of the number of nets that satisfy delay constraints is 9% on an average.
机译:本文研究了纳米技术中以互连为中心的平面规划的缓冲区规划问题。死区是放置内的任何电路块都不容纳的空间。在本文中,我们提出了一种基于死区重新分配的缓冲区规划算法,以充分利用死区来进行缓冲区插入。与拓扑表示下的电路块相关联,可以通过在放置中的房间内自由移动一些电路块来重新分配死区。进行死空间重新分配时,布局的总面积和拓扑结构保持不变。实验结果证明,可以通过在整个布局中重新分配死区来增加满足延迟约束条件的网络的数量。满足延迟约束的网络数量的增量平均为9%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号