VLSI Design

VLSI Design / 2008 / Article

Research Article | Open Access

Volume 2008 |Article ID 517919 | https://doi.org/10.1155/2008/517919

Jarrod A. Roy, David A. Papa, Igor L. Markov, "Fine Control of Local Whitespace in Placement", VLSI Design, vol. 2008, Article ID 517919, 10 pages, 2008. https://doi.org/10.1155/2008/517919

Fine Control of Local Whitespace in Placement

Academic Editor: Spyros Tragoudas
Received01 Nov 2007
Revised16 May 2008
Accepted04 Aug 2008
Published23 Sep 2008


In modern design methodologies, a large fraction of chip area during placement is left unused by standard cells and allocated as “whitespace." This is done for a variety of reasons including the need for subsequent buffer insertion, as a means to ensure routability, signal integrity, and low coupling capacitance between wires, and to improve yield through DFM optimizations. To this end, layout constraints often require a certain minimum fraction of whitespace in each region of the chip. Our work introduces several techniques for allocation of whitespace in global, detail, and incremental placement. Our experiments show how to efficiently improve wirelength by reallocating whitespace in legal placements at the large scale. Additionally, for the first time in the literature, we empirically demonstrate high-precision control of whitespace in designs with macros and obstacles. Our techniques consistently improve the quality of whitespace allocation of top-down as well as analytical placement methods and achieve low penalties on designs from the ISPD 2006 placement contest with minimal interconnect increase.

1. Introduction

At the 65 nm technology node and below, many systematic manufacturing problems that arise can only be effectively mitigated in the physical design portion of the computer-aided design (CAD) flow [1, 2]. Issues such as parasitics variability induced by chemical mechanical polishing (CMP) yield loss due to increased shorts, via failures, forbidden pitches, and forbidden polygonal shapes greatly affect yield. Techniques to handle these problems are known collectively as design for manufacturing (DFM) and are important to routing tools targeting 65 nm designs [3].

An important factor in many DFM issues is design density, determined by local whitespace (also known as free space). Wire density is critical as too much wiring congestion has notable performance impact due to (i) longer wires resulting from routing detours, (ii) increased crosstalk which reduces reliability and degrades timing, and (iii) increased via counts which lengthen signal propagation time and can decrease yield [4]. Conversely, too little wiring density will increase the likelihood that CMP will erode parts of wires, greatly increasing their resistance or leaving their connection open entirely [3]. While metal fill can mitigate harmful CMP effects, it does so at the cost of negative performance impact of additional crosstalk. Achieving the right balance of wire density through whitespace management avoids the performance impact of too much congestion while reducing the need for metal fill.

     Input: placement bin 𝐵 , whitespace target targetWS
     Output: partitioned child bins
(1) SetTentativeCutline( 𝐵 )
(2) if (BinWhitespace( 𝐵 ) > targetWS and targetWS SafeWS)
(3)then SetPartToleranceSafe( 𝐵 , targetWS)
(4)CallPartitioner( 𝐵 )
(5)ShiftCutlineToMaintainTargetWS( 𝐵 , targetWS)
(6)else if (BinWhitespace( 𝐵 ) > targetWS
     and targetWS minLocalWS)
(7)then SetPartToleranceMinLocal( 𝐵 , targetWS)
(8)CallPartitioner( 𝐵 )
(9)ShiftCutlineToMaintainTargetWS( 𝐵 , targetWS)
(10)else SetPartToleranceUniform( 𝐵 )
(11)CallPartitioner( 𝐵 )
(12)ShiftCutlineToEqualizeWS( 𝐵 )
(13) FinalizeCutline( 𝐵 )
(14) CreateChildBins( 𝐵 )

In addition to wire density concerns, poor whitespace allocation during physical synthesis can increase total cell area due to buffer insertion and gate sizing [5]. One must reserve space locally to accommodate these operations to meet timing constraints, but reserving too much is wasteful [6]. In particular, a design that is placed too densely may have increased wirelength due to routing detours, and may be unable to close timing by inserting buffers into full regions of the chip. However, a design that is placed too sparsely will also have increased wirelength and suffers both timing degradation and increased power consumption from more buffers. Therefore, accurate modeling of whitespace and precise cell density control are important concerns during the global and detail placement phases of a physical synthesis flow.

The literature includes several techniques to optimize whitespace distributions [69]. A natural scheme for managing whitespace in top-down placement, uniform whitespace allocation, was rigorously analyzed in [8]. The authors derived expressions for the tolerance to be given to a min-cut partitioner such that whitespace would be allocated as uniformly as possible given the discrete nature of the problem.

A technique for nonuniform whitespace allocation presented in [7] adds disconnected standard cells to the design before placement using uniform whitespace allocation and removes them immediately after. Care must be taken not to add too many cells to the design which complicates the work of many placement algorithms, increasing interconnect length or leading to overlapping circuit modules [10]. In [6], analytical methods are used to allocate whitespace in sparse designs for min-cut placement. Before calls to partitioning, the design is placed quickly with an analytical algorithm. Cell area that is placed on either side of a proposed cut-line is used as an area target for min-cut partitioning. After floorplanning, [9] provides min-cost network-flow formulations to optimally redistribute floorplan whitespace to reduce interconnect length.

    Input: initial placement 𝑃 , grid of density targets 𝐺
    Output: optimized placement 𝑃
(1) 𝑏 𝑒 𝑠 𝑡 𝐼 𝑚 𝑝 𝑟 𝑜 𝑣 𝑒 𝑚 𝑒 𝑛 𝑡 0 , 𝑐 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 1
(2) foreach cell 𝐶
(3)do Search 𝐺 for a legal location of 𝐶 that best
               improves density violations and does not increase HPWL
               by more than HpwlLimit% (break ties using HPWL)
(4)        Store the best location of 𝐶
(5)        if (density improvement of 𝐶 > bestImprovement)
(6)            then 𝑏 𝑒 𝑠 𝑡 𝐼 𝑚 𝑝 𝑟 𝑜 𝑣 𝑒 𝑚 𝑒 𝑛 𝑡 density improvment of C
(7) 𝑐 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 𝐶
(8) while (cellToMove 1 )
(9)do Move cellToMove to its best location
(10)    Fix cellToMove
(11)     𝑏 𝑒 𝑠 𝑡 𝐼 𝑚 𝑝 𝑟 𝑜 𝑣 𝑒 𝑚 𝑒 𝑛 𝑡 0 , 𝑛 𝑒 𝑤 𝐶 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 1
(12)    foreach cell 𝐶 cellToMove
(13)            do if (best location of 𝐶 overlaps with cellToMove)
(14)    then Search 𝐺 for the best location of 𝐶
(15)    else if ( 𝐶 is connected to cellToMove)
(16)  then Recalculate the density improvement of moving 𝐶
    to its best location
(17)if (density improvement of 𝐶 0 )
(18)then Search 𝐺 for the best location of 𝐶
(19)      if (density improvement of 𝐶 > bestImprovement)
(20)then 𝑏 𝑒 𝑠 𝑡 𝐼 𝑚 𝑝 𝑟 𝑜 𝑣 𝑒 𝑚 𝑒 𝑛 𝑡 density improvment of 𝐶
(21) 𝑛 𝑒 𝑤 𝐶 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 𝐶
(22) 𝑐 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 𝑛 𝑒 𝑤 𝐶 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒
(23)if (density improvement of cellToMove < improvementCutoff)
(24)    then 𝑐 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 1
(25)if (moving cellToMove to its best location increases HPWL
    beyond HpwlCap)
(26)    then 𝑐 𝑒 𝑙 𝑙 𝑇 𝑜 𝑀 𝑜 𝑣 𝑒 1

There are relatively few techniques in the literature for respecting whitespace constraints imposed by a designer while still optimizing interconnect. Such constraints are helpful as they are typically imposed to improve routability, allow for effective buffer insertion, and so forth. In many cases, these constraints come in the form of cell density restrictions. One trivial way to ensure sparser cell densities in a placement is by artificially increasing cell sizes before placement (bloating) and shrinking them back to normal size afterward [11]. For the bloating to be effective, the majority of the original whitespace of the design must be consumed. This reduces the amount of whitespace available to the placer which is undesirable for reasons stated above. Bloating also makes density control in detail placement more difficult as standard cells can only be bloated in discrete steps. Widening a standard cell by a single cell site often increases cell width by 20% or more whereas density control requires much finer precision.

In this paper, we propose several methods for top-down whitespace allocation to satisfy whitespace constraints. Our key contributions are the following.

(i)We introduce three user-controlled whitespace allocation techniques which allow for fine control of whitespace allocation in top-down global placement.(ii)We outline several detail placement techniques which enforce density constraints while simultaneously improving interconnect length.(iii)We quantify the difficulty in satisfying density constraints and show why so many of the best solutions to the ISPD 2006 contest benchmarks [12] did not satisfy these constraints.

This paper is organized as follows. Whitespace terminology and previous work are covered in Section 2. Section 3 describes top-down whitespace allocation techniques and illustrates using them to satisfy density constraints in global placement. Whitespace allocation in detail placement is discussed in Section 4. Section 5 provides empirical evaluation of our whitespace allocation techniques, and we conclude in Section 6.

2. Background and Previous Work

Below, we review fundamental whitespace terminology and techniques for top-down placement as well as existing work on allocating whitespace for goals such as improved mixed-size placement and routability. Our choice of the top-down placement framework is motivated by the fact that a top-down technique has been used to improve the routability of analytical placements [13], and the top-down placer Capo is currently producing the smallest via counts for the IBMv2 and IWLS 2005 benchmark suites [14].

2.1. Whitespace Fundamentals

Optimal uniform whitespace allocation techniques for top-down bisection-based placement were derived in [8]. Let a placement bin which is going to be partitioned have site area , cell area , absolute whitespace and relative whitespace . A bi-partitioning divides the bin into two-child bins with site areas and such that and cell areas and such that . A partitioner is given cell area targets and as well as a tolerance for a particular bi-partitioning instance. In many cases of bi-partitioning, , but this is not always true [6]. defines the maximum percentage by which and are allowed to differ from and , respectively.

The work in [8] bases its whitespace allocation techniques on whitespace deterioration: the phenomenon that discreteness in partitioning and placement does not allow for exact uniform whitespace distribution. The whitespace deterioration for a bi-partitioning is the largest , such that each child bin has at least relative whitespace. Assuming nonzero relative whitespace in the placement bin, should be restricted such that [8]. The authors note that may be overly restrictive in practice because it induces zero tolerance on the partitioning instance but may not be restrictive enough as it allows for child bins with zero whitespace, which can improve wirelength but impair routability [8].

For a given block, feasible ranges for partition capacities are uniquely determined by . The partitioning tolerance for splitting a block with relative whitespace is [8]. The challenge is to determine a proper value for . First assume that a bin is to be partitioned horizontally times more during the placement process. can be calculated as where is the number of rows in the placement bin [8]. Assuming end-case bins have since they are not further partitioned, , the relative whitespace of an end-case bin, is determined to be , where is the tolerance of partitioning in the end-case bin [8].

Making the practical assumption that remains constant over all partitionings, we find [8]. can be eliminated from the equation for and a closed form for using only and is derived to be [8].

2.2. Whitespace in Mixed-Size Placement

Industrial floorplacement problems are increasingly difficult due to factors such as an increasing number of movable modules and a wide variation of module sizes. To address these issues, SCalable Advanced Macro Placement Improvements (SCAMPIs) [15] modify the top-down partitioning flow to selectively place large macros, while smaller macros are clustered into soft modules that will be placed later. The robustness of the flow is also improved by employing fast look-ahead simulated annealing on large macros of newly created bins. This allows early detection of bins difficult to floorplan and alerts the placer to backtrack and seek a different partitioning solution.

There is also insufficient cohesion for whitespace allocation between top-down methods and macroplacement algorithms. For example, a partitioner may approximate the area required by a set of macros and incorrectly allocate whitespace. While uniform whitespace distribution is sufficient in many cases, the authors of SCAMPI observe that in certain cases, one of two-child bins may require more whitespace than its sibling. By redistributing whitespace from easy-to-pack child bins to those hard to pack, a floorplacer becomes more robust and runtime improves [15].

2.3. Whitespace Allocation for Routability

It is well known that a placement with small HPWL may be unroutable due to uneven routing demand and ensuing wiring congestion. For this reason, modern placers must explicitly account for routing congestion in order to produce routable placements. In [16], congestion maps are built after global placement, and annealing moves are applied to minimize a congestion metric. Another technique known as WSA [17] is applied after detail placement. WSA uses congestion maps to identify areas with high congestion and injects whitespace into these areas in a top-down fashion. After whitespace allocation, cells typically overlap each other, and legalization is required. After legalization, window-based detail placement techniques are applied to reduce wirelength that was increased during whitespace allocation and legalization. ROOSTER [14] builds congestion maps during top-down placement. Based on the congestion estimates, whitespace is allocated preferentially to areas of high congestion through cutline shifting. Unlike WSA, no additional legalization is necessary in ROOSTER as whitespace allocation is done before detail placement. Cell bloating [11] and cell spreading [17] have been used to tie whitespace to specific cells, rather than to fixed regions as in techniques based on congestion maps. Bloating reduces the amount of whitespace available to the placer which can impair solution quality significantly [10]. Bloating also makes fine density control in detail placement more difficult as standard cells can only be bloated in discrete steps that correspond to site widths and row heights. Widening a standard cell by one cell site often increases cell width by more than 20% whereas density control requires precision on the order of single percents.

3. Whitespace Allocation

Top-down min-cut placement proceeds by successively dividing placement bins, the first of which contains the entire core area and all movable objects, until the bins are small enough to be optimally placed. Whitespace allocation is done per placement bin and in this section we describe three techniques: uniform, minimum local, and safe whitespace allocation. Any one of these options can be chosen per bin based on the bin's whitespace and user-configurable options. Pseudocode in Algorithm 1 shows how these three techniques are used together to satisfy whitespace constraints.

3.1. Uniform Whitespace

If a bin has a user-defined “small” amount of whitespace or less, partitioning attempts to divide the cell area approximately in half, within a given tolerance. The appropriate partitioning tolerance is chosen based on whitespace deterioration and is calculated as described in Section II above. After a partitionnement (i.e., a partitioning solution) is computed, the geometric cut-line for the bin is positioned so that each side of the cutline has an equal percentage of whitespace. As tolerance is calculated assuming a fixed cutline, the cutline is shifted to make whitespace more uniform. Such whitespace allocation generally produces routable placements, at the cost of increased wirelength.

3.2. Minimum Local Whitespace

If a bin has more than a user-defined minimum local whitespace ( ), partitioning will define a tentative cutline that divides the bin's placement area in half. Partitioning targets an equal division of cell area, but is given more freedom to deviate from its target. Tolerance is computed so that with whitespace deterioration, each descendant bin of the current bin will have at least .

The assumption that the whitespace deterioration in end-case bins is 0 made in [8] and presented in Section 2 no longer applies, so the calculation of must change. Since we want all child bins of the current bin to have relative whitespace, in particular end case bins must have at least and thus we may set , instead of a function of . With the assumption that remains constant, is calculated as a function of , and as shown in Section 2. Knowing .

After a partitionnement is calculated, the cutline is shifted to ensure that is preserved on both sides of the cutline. If the minimum local whitespace is chosen to be small, the placer can produce tightly packed placements which greatly improves wirelength.

3.3. Safe Whitespace

The last whitespace allocation mode is designed for bins with “large” quantities of whitespace. In safe whitespace allocation, as with minimum local whitespace allocation, a tentative geometric cutline of the bin is chosen, and the target of partitioning is an equal bisection of the cell area. The difference in safe whitespace allocation mode is that the partitioning tolerance is much higher. Essentially, any partitioning solution that leaves at least on either side of the cutline is considered legal. This allows for very tight packing and reduces wirelength, but is not recommended for congestion-driven placement.

4. Whitespace in Detail Placement

Placement tools use several techniques to further reduce HPWL after global placement, such as the sliding window optimizer RowIroning [18], but these techniques usually do not respect density constraints. To have finer control of whitespace than the sliding-window scheme, we present two-detail placement techniques that focus on whitespace allocation in addition to improvement of HPWL: a greedy cell-movement scheme and optimal whitespace allocation that preserves relative cell ordering by solving min-cost network-flow problems [9, 19].

4.1. Greedy Cell Movement

A gridded greedy movement technique can improve both wirelength and whitespace distribution. Pseudocode for our technique is shown in Algorithm 2. An arbitrary grid is imposed on the placement region to analyze local placement density. Density targets are set for each of the grid regions individually and can be nonuniform. For standard cells that are in regions with density violations, location candidates are found in areas of lower density violation. Candidate moves are ranked by how well they alleviate violations as well as how they affect wirelength. We allow moves that increase HPWL, but only a fixed amount per move. Moves are made until a threshold of density improvement or a limit on increased HPWL is reached.

A similar greedy movement technique can reclaim HPWL while leaving whitespace distribution unchanged. In this technique, pairs and triples of cells of approximately the same size are examined. The number of pairs and triples of cells in any modern design is intractable, so to keep runtime feasible our technique only considers pairs and triples of cells that are directly connected to each other by 2-pin nets. After pairs and triples are collected, the HPWL gain is evaluated for swapping pairs of cells and the five nontrivial permutations of triples of cells. As the cells are of approximately the same size, no overlap is produced by these swapping moves and whitespace distribution is largely unaffected. These cell-swapping moves are applied until a HPWL improvement threshold is reached.

4.2. Optimal Whitespace Redistribution

Optimal whitespace allocation in row-based placement [19] and floorplanning [9] given a fixed cell-ordering has previously been described in the literature. Unfortunately, [19] only considered optimal whitespace allocation for the -direction of a single row of a placement at a time while [9] was limited to relatively small floorplanning solutions generated using sequence-pairs. We extract the best of these techniques and generate min-cost network-flow problems for generic floorplacement instances whose solutions optimally redistribute whitespace and snap cells to row/site boundaries.

Let the set of cells and macros be denoted
𝐶 = 𝑐 1 , 𝑐 2 , , 𝑐 𝑖 ,
and let the set of nets be denoted
𝑁 = 𝑛 1 , 𝑛 2 , , 𝑛 𝑗 .
Using the variables:
𝑥 𝑘 𝐿 f o r 1 𝑘 𝑖 , 𝑥 𝑘 , 𝑈 𝑥 𝑘 f o r 1 𝑘 𝑗 ,
and constants:
𝑙 𝑒 𝑓 𝑡 _ 𝑏 𝑜 𝑢 𝑛 𝑑 𝑎 𝑟 𝑦 , 𝑟 𝑖 𝑔 𝑡 _ 𝑏 𝑜 𝑢 𝑛 𝑑 𝑎 𝑟 𝑦 , 𝑝 𝑙 𝑎 𝑐 𝑒 𝑚 𝑒 𝑛 𝑡 ( 𝑘 ) . 𝑥 f o r 1 𝑘 𝑖 , 𝑤 𝑖 𝑑 𝑡 ( 𝑘 ) f o r 1 𝑘 𝑖 ,
we minimize
𝑗 𝑘 = 1 𝑈 𝑥 𝑘 𝐿 𝑥 𝑘
subject to constraints:
𝐿 𝑥 𝑛 𝑥 𝑘 𝑈 𝑥 𝑛 w h e r e c e l l 𝑘 𝑖 𝑠 o n n e t 𝑛 , 𝑙 𝑒 𝑓 𝑡 _ 𝑏 𝑜 𝑢 𝑛 𝑑 𝑎 𝑟 𝑦 𝑥 𝑘 𝑥 f o r 1 𝑘 𝑖 , 𝑘 𝑥 + 𝑤 𝑖 𝑑 𝑡 ( 𝑘 ) 𝑟 𝑖 𝑔 𝑡 _ 𝑏 𝑜 𝑢 𝑛 𝑑 𝑎 𝑟 𝑦 f o r 1 𝑘 𝑖 , 𝑘 𝑥 = 𝑝 𝑙 𝑎 𝑐 𝑒 𝑚 𝑒 𝑛 𝑡 ( 𝑘 ) . 𝑥 w h e r e c e l l 𝑘 𝑖 𝑠 x e d , 𝑘 + 𝑤 𝑖 𝑑 𝑡 ( 𝑘 ) 𝑥 𝑙 w h e r e c e l l 𝑘 i s d i r e c t l y t o t h e l e f t o f c e l l 𝑙

Our technique builds upon the well-known linear programming formulations used, for example, in [9, 20] in that we impose linear constraints for movable objects based on their relative positions with respect to core boundaries and other movable objects. We include additional linear inequalities to account for fixed obstacles and region constraints. One major difference from previous work is that we guarantee that the and locations found align to legal sites and rows, as explained below.

We handle reallocation of whitespace separately for the horizontal and vertical directions and preserve local relative ordering of movables in each direction. In other words, movable objects may not jump over each other or any fixed obstacles when whitespace is being reallocated. Unlike global-placement [20], we start with legal or nearly-legal locations. This simplifies our selection of relative constraints to include into the LP formulation as follows. In the horizontal case, we examine each row individually. For each cell or macro that intersects the row, we determine its immediate neighbors to the left and to the right (those objects with which the current object could feasibly overlap if it would slide to the left or right). These neighbors include movable objects, row, or region boundaries as well as fixed obstacles. After the neighborhood relations are determined, we constrain an object to lie between its left- and right-hand neighbors. Construction of constraints for the vertical case is analogous where rows are replaced with columns, and site width is replaced by row height. Lastly, to preserve global whitespace allocation characteristics, we add constraints to limit the amount of movement of any individual cell from its initial position. Unlike the formulation from [20], ours guarantees an overlap-free placement and needs to be solved only once. In contrast with [9], we include only several constraints per movable object rather than a quadratic number of constraints read from a sequence-pair. This significantly improves scalability and allows one to pack more tightly.

In addition to the constraints above, we minimize HPWL. This is done by adding variables for each net, and the terms and to the objective function. The LP formulation for the horizontal case is enumerated in Algorithm 3. To solve the entire LP efficiently, we dualize it as in [9] and cast the dual as a min-cost max-flow instance. The latter is solved using the scaling push-relabeling algorithm of Goldberg [21]. Nets from the original LP formulation become directed edges with unit capacity and zero cost in the dualized flow instance, and distance constraints become directed edges with costs and unlimited capacity. Goldberg's implementation of push-relabeling in C uses integer variables for both costs and capacities. Thus, the algorithm naturally produces integer solutions when the input is encoded in integers. We use this integrality to produce solutions that are row- and site-aligned–-we scale coordinates so that integer values correspond to legal sites and integer values correspond to standard-cell rows. Thus, our solutions need no further legalization.

Empirically, this technique is extremely fast and provides nontrivial interconnect length improvement. Entire placements of up to 50 000 cells can have their whitespace reallocated in 60 seconds or less. We have found that 50 000 cells is a good tradeoff between quality and runtime, so we break the placement area into a regular grid with a target of 50 000 cells per grid cell and allocate whitespace in each region separately. We generally see interconnect length improvement of 2-3% with a runtime cost less than 10% of placement runtime.

5. Empirical Results

We have implemented these whitespace allocation techniques in the open-source academic placer Capo 10.5 [24]. Our use of Capo as an implementation platform is justified by Capo's competitive results on difficult mixed-size instances [15] and all routability-driven placement benchmarks reported in the literature. In particular, Capo's routed solutions have best published via counts [14], which is very important for DFM and yield. Vias also significantly impact timing and may complicate routing by blocking routing tracks [4]. In this section, we evaluate our techniques in the contexts of satisfying density constraints and optimizing HPWL on a wide variety of publicly available benchmarks.

5.1. Whitespace Reallocation

We combine our whitespace allocation techniques with the ECO-system [13] mode of Capo 10.5 to reallocate whitespace in ISPD 2006 contest solutions from the mPL6 placer [23]. mPL6 uses a multilevel analytical technique for global placement with cell bloating to help meeting the target densities [25] and the XDP detail placer [26] which legalizes and applies sliding window techniques to recover wirelength. At the ISPD 2006 placement contest, mPL6 produced the best solutions when not considering runtime, but as shown in Table 1 the solutions did not satisfy the density constraints imposed by the competition. These density violations can be significantly improved using our technique, but only at the cost of significantly increased wirelength. It is important to note that the coefficients in the ISPD 2006 penalty formula were chosen rather arbitrarily, while the effective cost of violations greatly depends on the types of problems caused by violations, such as increased crosstalk noise and need for DFM fix ups. In the smaller benchmarks, newblue1 and newblue2, the cost in HPWL is approximately 12%. On newblue3 and newblue4, the increase in HPWL is much lower at 5% and 4%, respectively. This shows, especially on the larger benchmarks, that density violations can be improved dramatically with a reasonable increase to HPWL. These reallocated placements outperform all but one placer on one benchmark from the ISPD 2006 contest (only Dragon's placement of newblue4 has a lower density penalty) and have extremely competitive HPWL.

BenchmarkLocal WS targetHPWL (e6)Density violation


5.2. Density Constraint Satisfaction

We implemented all of our proposed whitespace allocation techniques in the Capo 10.5 framework and test uniform and nonuniform whitespace allocation on the ISPD 2005 contest benchmark adaptec1 (57.34% utilization) with 60% and 90% target whitespace densities. The HPWL for the uniform and nonuniform placements is 10.69e7 and 9.03e7, respectively. Uniform whitespace produces almost no violations when the target is 90% and relatively few when the target is 60%. The nonuniform placement has more violations when compared to the uniform placement, especially when the target is 60%, but remains largely legal with a 90% target density. This shows that uniform whitespace allocation is appropriate when target density is near the total amount of whitespace in a design, otherwise nonuniform allocation can be used to improve wirelength.

In Figure 1, we show histograms of grid cell densities across the ethernet benchmark [22] when given local whitespace constraints of (a) 25%, (b) 30%, and (c) 35%. The ethernet design has 38% total whitespace, and our techniques are able to achieve completely legal solutions when 25% local whitespace is requested, but the constraints become more difficult to satisfy at 30% and 35%. Despite the difficulty, our techniques are successful in producing solutions that are legal or nearly-legal for the vast majority of grid cells.

The inherent difficulty in satisfying minimum whitespace constraints as the requested whitespace approaches the total amount of whitespace in the design is also apparent from Figure 2. Here, we place selected benchmarks from the ISPD 2006 placement contest with a wide range of requested local whitespace values. We use our whitespace allocation methods to match the requested amount of local whitespace for each of the instances and evaluate the legality of our solutions with the ISPD 2006 placement contest density penalty function [12]. The penalty is calculated based on the total amount of density constraint violations in the placement. Our solutions generally have very small penalties (always less than 1.5%) suggesting that our techniques satisfy density constraints well. Note how the density penalty grows more quickly as the amount of requested whitespace approaches the total amount of whitespace in the design.

5.3. Greedy Cell Movement

Table 3 shows the effectiveness of greedy movement techniques in removing density violations. Benchmarks are selected from the IWLS 2005 benchmark suite and each has 38% total whitespace [22]. Size characteristics of these benchmarks are shown in Table 2. Density violations are reported as the percentage of total cell area that violates density constraints. Greedy cell movement corrects all density violations when requested local whitespace is 25% or less and in many cases improves HPWL as well. As the requested local whitespace approaches the total whitespace, greedy movement is not able to remove all of the density violations without making HPWL increase more than 0.5%. With a higher limit on HPWL increase, greedy movement can apply more moves and further reduce density violations.

Benchmark # MovablesGrid size

aes_core20795 1 4 × 1 4
ethernet46771 3 0 × 3 0
mem_ctrl11440 1 2 × 1 2
pci_bridge3216816 1 7 × 1 7
usb_funct12808 1 4 × 1 4
vga_lcd124031 4 1 × 4 1

BenchmarkLocal WS targetDensity violationHPWL impactRuntime (s)

aes_core25%0.042%0%−1.699% 43

ethernet20%0.002%0%−0.534% 163
ethernet25%0.036%0% +0.501% 174

mem_ctrl30%0.008%0%−0.023% 3

pci_bridge3220%0.002%0%−1.167% 25
pci_bridge3225%0.061%0%−1.182% 31

usb_funct30%0.030%0%−0.547% 16

vga_lcd20%0.0002%0%−0.440% 622
vga_lcd25%0.045%0% +0.132% 743

5.4. Flow-Based Whitespace Redistribution

We test optimal whitespace redistribution based on min-cost network flows on the ICCAD 2004 IBM-MSwPins benchmark suite [27]. Table 4 gives detailed runtime and HPWL improvement results for each of the IBM-MSwPins benchmarks. We do not provide overflow statistics on these designs since our flow-based whitespace redistribution maintains global whitespace characteristics. On average, HPWL on these benchmarks is improved by 2.86% and runtimes scale nearly linearly with benchmark size. Figure 3 depicts a placement of the ibm01 mixed-size design before (left) and after (right) whitespace optimization with flows.

Benchmark # MovablesRuntime (s)Improvement



6. Conclusions

In this paper, we have introduced methods for satisfying whitespace constraints in top-down placement while also optimizing interconnect. These constraints take the form of cell density limits on a placement. A followup to the Rooster work on routability-driven placement [14] has found that cell density limits can be extremely useful for promoting routability, decreasing metal fill, improving yield, and so forth [28]. Our techniques consistently improve the quality of whitespace allocation of top-down as well as analytical placement methods and achieve low penalties on designs from the ISPD 2006 placement contest with minimal interconnect increase.

All of our techniques for whitespace allocation in both global and detail placement are implemented in the Capo 10.5 academic min-cut placer [14, 15, 24]. Capo 10.5 is freely available for all uses as part of the UMpack (http://vlsicad.eecs.umich.edu/BK/PDtools/).


This work was partially supported by the DARPA/MARCO Gigascale Systems Research Center, the National Science Foundation, Synplicity, Inc., Calif, USA, as well as equipment donations from Intel, Calif, USA.


  1. P. Azzoni, M. Bertoletti, N. Dragone, F. Fummi, C. Guardiani, and W. Vendraminetto, “Yield-aware placement optimization,” in Proceedings of Design, Automation & Test in Europe (DATE '07), pp. 1232–1237, Nice, France, April 2007. View at: Publisher Site | Google Scholar
  2. S. Hu and J. Hu, “Pattern sensitive placement for manufacturability,” in Proceedings of International Symposium on Physical Design (ISPD '07), pp. 27–34, Austin, Tex, USA, March 2007. View at: Publisher Site | Google Scholar
  3. M. Cho, D. Z. Pan, H. Xiang, and R. Puri, “Wire density driven global routing for CMP variation and timing,” in Proceedings of International Conference on Computer-Aided Design (ICCAD '06), pp. 487–492, San Jose, Calif, USA, November 2006. View at: Publisher Site | Google Scholar
  4. “TSMC: Silicon Success,” http://www.tsmc.com/download/enliterature/html-newsletter/September03/InDepth/index.html. View at: Google Scholar
  5. C. J. Alpert, S. K. Karandikar, Z. Li et al., “Techniques for fast physical synthesis,” Proceedings of the IEEE, vol. 95, no. 3, pp. 573–599, 2007. View at: Publisher Site | Google Scholar
  6. C. J. Alpert, G.-J. Nam, and P. G. Villarrubia, “Effective free space management for cut-based placement via analytical constraint generation,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 10, pp. 1343–1353, 2003. View at: Publisher Site | Google Scholar
  7. S. N. Adya, I. L. Markov, and P. G. Villarrubia, “On whitespace and stability in mixed-size placement and physical synthesis,” in Proceedings of International Conference on Computer-Aided Design (ICCAD '03), pp. 311–318, San Jose, Calif, USA, November 2003. View at: Publisher Site | Google Scholar
  8. A. E. Caldwell, A. B. Kahng, and I. L. Markov, “Hierarchical whitespace allocation in top-down placement,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 11, pp. 716–724, 2003. View at: Google Scholar
  9. X. Tang, R. Tian, and M. D. R. Wong, “Optimal redistribution of white space for wire length minimization,” in Proceedings of Asia and South Pacific Design Automation Conference (ASP-DAC '05), vol. 1, pp. 412–417, Shanghai, China, January 2005. View at: Publisher Site | Google Scholar
  10. J. Cong, M. Romesis, and J. R. Shinnerl, “Robust mixed-size placement under tight white space constraints,” in Proceedings of International Conference on Computer-Aided Design (ICCAD '05), pp. 165–172, San Jose, Calif, USA, November 2005. View at: Publisher Site | Google Scholar
  11. N. Selvakkumaran, P. N. Parakh, and G. Karypis, “Perimeter-degree: a priori metric for directly measuring and homogenizing interconnection complexity in multilevel placement,” in Proceedings of the 5th International Workshop on System-Level Interconnect Prediction (SLIP '03), pp. 53–59, Monterey, Calif, USA, April 2003. View at: Google Scholar
  12. G.-J. Nam, “ISPD 2006 placement contest: benchmark suite and results,” in Proceedings of International Symposium on Physical Design (ISPD '06), p. 167, San Jose, Calif, USA, April 2006. View at: Google Scholar
  13. J. A. Roy and I. L. Markov, “ECO-system: embracing the change in placement,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 12, pp. 2173–2185, 2007. View at: Publisher Site | Google Scholar
  14. J. A. Roy and I. L. Markov, “Seeing the forest and the trees: steiner wirelength optimization in placement,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 26, no. 4, pp. 632–644, 2007. View at: Publisher Site | Google Scholar
  15. A. N. Ng, I. L. Markov, R. Aggarwal, and V. Ramachandran, “Solving hard instances of floorplacement,” in Proceedings of International Symposium on Physical Design (ISPD '06), pp. 170–177, San Jose, Calif, USA, April 2006. View at: Google Scholar
  16. X. Yang, B.-K. Choi, and M. Sarrafzadeh, “Routability driven white space allocation for fixed-die standard-cell placement,” in Proceedings of International Symposium on Physical Design (ISPD '02), pp. 42–47, Del Mar, Calif, USA, April 2002. View at: Google Scholar
  17. C. Li, M. Xie, C.-K. Koh, J. Cong, and P. H. Madden, “Routability-driven placement and white space allocation,” in Proceedings of International Conference on Computer-Aided Design (ICCAD '04), pp. 394–401, San Jose, Calif, USA, November 2004. View at: Google Scholar
  18. A. E. Caldwell, A. B. Kahng, and I. L. Markov, “Optimal partitioners and end-case placers for standard-cell layout,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19, no. 11, pp. 1304–1313, 2000. View at: Publisher Site | Google Scholar
  19. U. Brenner and J. Vygen, “Faster optimal single-row placement with fixed ordering,” in Proceedings of Design, Automation & Test in Europe (DATE '00), pp. 117–121, Paris, France, March 2000. View at: Publisher Site | Google Scholar
  20. S. Reda and A. Chowdhary, “Effective linear programming based placement methods,” in Proceedings of International Symposium on Physical Design (ISPD '06), pp. 186–191, San Jose, Calif, USA, April 2006. View at: Google Scholar
  21. A. V. Goldberg, “An efficient implementation of a scaling minimum-cost flow algorithm,” Journal of Algorithms, vol. 22, no. 1, pp. 1–29, 1997. View at: Google Scholar
  22. C. Albrecht, “IWLS 2005 Benchmarks,” June 2005, http://iwls.org/iwls2005/benchmarks.html. View at: Google Scholar
  23. T. F. Chan, J. Cong, J. R. Shinnerl, K. Sze, and M. Xie, “mPL6: enhanced multilevel mixed-size placement,” in Proceedings of International Symposium on Physical Design (ISPD '06), pp. 212–214, San Jose, Calif, USA, April 2006. View at: Publisher Site | Google Scholar
  24. J. A. Roy, S. N. Adya, D. A. Papa, and I. L. Markov, “Min-cut floorplacement,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 7, pp. 1313–1326, 2006. View at: Publisher Site | Google Scholar
  25. J. Cong and G. Luo, “Highly efficient gradient computation for density-constrained analytical placement methods,” in Proceedings of International Symposium on Physical Design (ISPD '08), pp. 39–46, Portland, Ore, USA, April 2008. View at: Publisher Site | Google Scholar
  26. J. Cong and M. Xie, “A robust detailed placement for mixed-size IC designs,” in Proceedings 11th Asia and South Pacific Design Automation Conference (ASP-DAC '06), pp. 188–194, Yokohama, Japan, January 2006. View at: Google Scholar
  27. S. N. Adya, S. Chaturvedi, J. A. Roy, D. A. Papa, and I. L. Markov, “Unification of partitioning, placement and floorplanning,” in Proceedings of International Conference on Computer-Aided Design (ICCAD '04), pp. 550–557, San Jose, Calif, USA, November 2004. View at: Google Scholar
  28. T.-C. Chen, M. Cho, D. Z. Pan, and Y.-W. Chang, “Metal-density driven placement for CMP variation and routability,” in Proceedings of International Symposium on Physical Design (ISPD '08), pp. 31–38, Portland, Ore, USA, April 2008. View at: Publisher Site | Google Scholar

Copyright © 2008 Jarrod A. Roy et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

More related articles

 PDF Download Citation Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly as possible. We will be providing unlimited waivers of publication charges for accepted research articles as well as case reports and case series related to COVID-19. Review articles are excluded from this waiver policy. Sign up here as a reviewer to help fast-track new submissions.