On the integration of partitioning and global routing for rectilinear placement problems

Abstract

Rectilinear placement is an important process for mixed macro block/standard cells design due to frequent presence of preplaced macro blocks. A prevailing solution to this problem is to divide the rectilinear region into rectangular sub-regions and partition cells into these sub-regions before applying standard placement algorithms. For such a strategy to work, the partitioning objective must closely correlate with the global routing objective. In this paper, we propose a new method to integrate global routing with partitioning. The salient features of our approach consist of (1) a new edge cost model and its computation using an incremental assignment technique; (2) a resistive network analogy for net cost modeling and a randomized algorithm for resistance computation; (3) a robust partitioning framework that combines the ideas of (1) and (2). Also, a dynamic strategy is proposed to evaluate the performance of the algorithm. Our method has been tested on several benchmark circuits and displayed excellent results in terms of both wire length and routability.