Recent directions in netlist partitioning: a survey

In this paper, we present a new multilevel k-way hypergraph partitioning algorithm that substantially outperforms the existing state-of-the-art K-PM/LR algorithm for multi-way partitioning, both for optimizing local as well as global objectives. Experiments on the ISPD98 benchmark suite show that the partitionings produced by our scheme are on the average 15% to 23% better than those produced by the K-PM/LR algorithm, both in terms of the hyperedge cut as well as the (K-1) metric. Furthermore, our algorithm is significantly faster, requiring 4 to 5 times less time than that required by K-PM/LR.

/pdf/multilevel-k-way-hypergraph-partitioning-590cpwdpl2.pdf

Multilevel k-way hypergraph partitioning

A system for determining an affinity associated with relocating a cell located on a surface of a semiconductor chip to a different location on the surface is disclosed herein. Each cell may be part of a cell net containing multiple cells. The system initially defines a bounding box containing all cells in the net which contains the cell. The system then establishes a penalty vector based on the bounding box and borders of a region containing the cell, computes a normalized sum of penalties for all nets having the cell as a member, and calculates the affinity based on the normalized sum of penalties. Also included in the disclosed system are methods and apparatus for capacity and utilization planning of the use of the floor, or the surface area, and the methods and apparatus for parallelizing the process of affinity based placements using multiple processors. Finally, method and apparatus for connecting the cells based on a Steiner Tree method is disclosed.

Advanced modular cell placement system

Considers a problem of network design of personal communication services (PCS). The problem is to assign cells to the switches of a PCS network in an optimum manner. The authors consider two types of costs. One is the cost of handoffs between cells. The other is the cost of cabling (or trunking) between a cell site and its associated switch. The problem is constrained by the call volume that each switch can handle. The authors formulate the problem exactly as an integer programming problem. They also propose a heuristic solution for this problem and show that it performs extremely well. >

Assignment of cells to switches in PCS networks

We present a new top-down quadrisection-based global placer for standard-cell layout. The key contribution is a new general gain update scheme for partitioning that can exactly capture detailed placement objectives on a per-net basis. We use this gain update scheme, along with an e cient multilevel partitioner, as the basis for a new quadrisection-based placer called QUAD. Even though QUAD is a global placer, it can achieve signi cant improvements in wirelength and congestion distribution over GORDIAN-L/DOMINO [SDJ91] [DJS94] (a leading quadratic placer with linear wirelength objective and detailed placement improvement). QUAD can be easily extended to capture various practical considerations; our timing-driven placement can obtain wirelength savings (as well as small cycle time improvements) versus the SPEED [RE95].

/pdf/partitioning-based-standard-cell-global-placement-with-an-cvgeubyij6.pdf

Partitioning-based standard-cell global placement with an exact objective

An adaptation to multiple blocks of a two-block network partitioning algorithm by Krishnamurthy was previously presented and analyzed by the author (see ibid., vol.38, p.62-81, 1989). The algorithm assumed one of several possible generalizations of two-way partitioning to multiple-way partitioning. The problem of adapting this algorithm to work with different generalizations more suitable for other types of applications of network partitioning is considered. It is shown that certain portions of the algorithm must be revised in order to maintain a relatively low time complexity for the modified algorithms. Experimental results are given. >

L.A. Sanchis

Papers

Multiple-way network partitioning with different cost functions