We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placmeent problem, the cell order is fixed within the row; all cells in other rows are also fixed. We give the first solutions to the single-row problem: (i) a dynamic programming technique with time complexity O(m~2) where m is the number of nets incident to cells in the given row, and (ii) an O(m log m) technique that exploits the convexity of the wirelength objective. We also propose an iterative heuristic for improving cell ordering within a row; this can be run optionally before applying either (i) or (ii). Experimetnal results show an average of 6.5
展开▼
机译：我们研究在存在空白（额外位点）的情况下，给定单元格行的详细放置优化中产生的一种线性放置问题。在此单行解决问题中，单元顺序在行内固定；其他行中的所有单元格也都固定。我们给出单行问题的第一个解决方案：（i）具有时间复杂度O（m〜2）的动态编程技术，其中m是入射到给定行中的单元的网的数量，以及（ii）O（ m log m）技术，利用线长物镜的凸度。我们还提出了一种迭代试探法，以改善行内的单元排序；在应用（i）或（ii）之前，可以选择运行此命令。实验结果显示平均6.5
展开▼
