## Multi-Center Congestion Estimation And Minimization During Placement (2000)

Venue: | In International Symposium on Physical Design |

Citations: | 10 - 3 self |

### BibTeX

@INPROCEEDINGS{Wang00multi-centercongestion,

author = {Maogang Wang and Xiaojian Yang and Kenneth Eguro and Majid Sarrafzadeh},

title = {Multi-Center Congestion Estimation And Minimization During Placement},

booktitle = {In International Symposium on Physical Design},

year = {2000},

pages = {147--152},

publisher = {ACM}

}

### OpenURL

### Abstract

As technology advances, more and more issues need to be considered in the placement stage, e.g., wirelength, congestion, timing, coupling. It is very hard to consider all of them together at the same time. Thus it is good if we can optimize one cost function without affecting others. In this paper, we will study methods to optimize congestion in placement without inflicting degradations/violations in other objectives or constraint. We give a mathematical equation to predict the overflow within a region using a normal distribution approximation. According to experiments, this equation does give a good estimation of overflow. We used this equation to find the smallest regions which have enough routing resource to alleviate the congestion and propose the flexible expansion scheme in our multi-center congestion reduction (MC 2 R) algorithm. Experimental results show that generally there is a correlation between the amount of reduction in congestion and the amount of change made to the pl...

### Citations

418 |
Combinatorial Algorithms for Integrated Circuit Layout
- Lengauer
(Show Context)
Citation Context ...gth implies that placement is changed. This change may result in violations in other performance constraint such as timing and coupling. Timing and coupling issues in placement are very hard problems =-=[6, 13, 4, 12, 11, 2, 9, 3]-=-. It could be very difficult and time consuming to find a placement to meet all the performance constraint. Thus we do not want the congestion reduction process to cause any trouble in this area. One ... |

223 |
Algorithms for VLSI Physical Design Automation
- Sherwani
- 2005
(Show Context)
Citation Context ...gth implies that placement is changed. This change may result in violations in other performance constraint such as timing and coupling. Timing and coupling issues in placement are very hard problems =-=[6, 13, 4, 12, 11, 2, 9, 3]-=-. It could be very difficult and time consuming to find a placement to meet all the performance constraint. Thus we do not want the congestion reduction process to cause any trouble in this area. One ... |

72 | Timing driven placement for large standard cell circuits
- Swartz, Sechen
- 1995
(Show Context)
Citation Context ...gth implies that placement is changed. This change may result in violations in other performance constraint such as timing and coupling. Timing and coupling issues in placement are very hard problems =-=[6, 13, 4, 12, 11, 2, 9, 3]-=-. It could be very difficult and time consuming to find a placement to meet all the performance constraint. Thus we do not want the congestion reduction process to cause any trouble in this area. One ... |

65 |
Generation of performance constraints for layout
- Nair, Berman, et al.
- 1989
(Show Context)
Citation Context |

52 | Congestion minimization during placement
- Wang, Yang, et al.
- 2000
(Show Context)
Citation Context ...s also essential to consider other performance related issue such as timing, coupling in placement. The congestion problem in placement is not well studied. There are not many results on this problem =-=[5, 7, 14, 15]-=-. In [14, 15], Wang and Sarrafzadeh pointed out that the congestion objective is very ill behaved such that directly using it will not produce low congestion placement. Congestion and wirelength are g... |

42 |
An Introduction to VLSI Physical Design
- Sarrafzadeh, Wong
- 1996
(Show Context)
Citation Context ...gth implies that placement is changed. This change may result in violations in other performance constraint such as timing and coupling. Timing and coupling issues in placement are very hard problems =-=[6, 13, 4, 12, 11, 2, 9, 3]-=-. It could be very di cult and time consuming to nd a placement to meet all the performance constraint. Thus we do not want the congestion reduction process to cause any trouble in this area. One way ... |

30 |
Noise in digital dynamic cmos circuits
- Larsson, Svensson
- 1994
(Show Context)
Citation Context |

30 | Congestion Driven Quadratic Placement
- Parakh, Brown, et al.
- 1998
(Show Context)
Citation Context ...s also essential to consider other performance related issue such as timing, coupling in placement. The congestion problem in placement is not well studied. There are not many results on this problem =-=[5, 7, 14, 15]-=-. In [14, 15], Wang and Sarrafzadeh pointed out that the congestion objective is very ill behaved such that directly using it will not produce low congestion placement. Congestion and wirelength are g... |

27 |
Congestion-driven placement using a new multi-partitioning heuristic
- Mayrhofer
(Show Context)
Citation Context ...s also essential to consider other performance related issue such as timing, coupling in placement. The congestion problem in placement is not well studied. There are not many results on this problem =-=[5, 7, 14, 15]-=-. In [14, 15], Wang and Sarrafzadeh pointed out that the congestion objective is very ill behaved such that directly using it will not produce low congestion placement. Congestion and wirelength are g... |

27 | Harmony: Static noise analysis of deep submicron digital integrated circuits
- Shepard, Narayanan, et al.
- 1999
(Show Context)
Citation Context |

19 |
NRG: Global and Detailed Placement
- Sanafiadeh, Wang
- 1997
(Show Context)
Citation Context ...y different number of routing layers or different white space alocation, etc.. The input placement to the MC 2 R algorithm is a wirelength optimized placement obtained by using the NRG placement tool =-=[8]-=-. In this paper, we will not set actual perCircuit Be- Af(routing fore ter % % % supply) OF OF (\DeltaOF) (\DeltaWL) (\DeltajWLj) h2-v1(5) 4 4 0% 0% 0% fract-v1(5) 21 21 0% 0.72% 0.72% P1-v1(12) 58 55... |

18 | Modeling and minimization of routing congestion - Wang, Sarrafzadeh - 2000 |

11 |
Stochastic models for wireability analysis of gate arrays
- Sastry, Parker
- 1986
(Show Context)
Citation Context ...ical function which fits a lot of natural distributions. We approximate the wiring distribution in the layout as a normal distribution because of its simplicity (more complexed models can be found in =-=[10, 1]-=-). Fig. 1 shows the real congestion distributions and the fitted normal distribution curves for circuit Primary2, biomed, avqs and avql. The x-axis of the figure is the number of nets at each global b... |

10 |
A fractal analysis of interconnection complexity
- Christie
- 1993
(Show Context)
Citation Context ...ical function which fits a lot of natural distributions. We approximate the wiring distribution in the layout as a normal distribution because of its simplicity (more complexed models can be found in =-=[10, 1]-=-). Fig. 1 shows the real congestion distributions and the fitted normal distribution curves for circuit Primary2, biomed, avqs and avql. The x-axis of the figure is the number of nets at each global b... |

9 |
An Introduction to VLSI Physical Design
- Saraffzadeh, Wong
- 1996
(Show Context)
Citation Context |

7 |
Issues in timing driven layout
- MAREK-SADOWSKA
- 1993
(Show Context)
Citation Context |

7 | Modeling and minimization of routing congestion - Wang, Sarrafzadeh - 2000 |