Force directed mongrel with physical net constraints

Hur, Sung-Woo; Cao, Tung; Rajagopal, Karthikeyan; Parasuram, Yegna; Chowdhary, Amit; Tiourin, Vladimir; Halpin, Bill

doi:10.1145/775884.775888

Cited by 6 publications

(7 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…More recent publications (like [7] and [12]) using publicly available benchmarks only presented global placement results without any information about the amount of remaining overlap. Other works like [16], [10], and [9] used proprietary benchmarks to present results. Table 1 shows the comparison of [5] with our approach.…”

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Quadratic placement using an improved timing model

Obermeier

Johannes

2004

Proceedings of the 41st Annual Design Automation Conference

View full text Add to dashboard Cite

The performance of timing-driven placement methods depends strongly on the choice of the net model. In this paper a more precise net model is presented that does not increase numerical complexity. We introduce a method that replaces the clique model of a net by a tree model in the quadratic placement formulation. This improvement enables us to control the length of every tree segment separately. Furthermore, we present an analysis of the effects of every tree segment to the net delay. The result is in turn used to control the placement engine. Our presented results are based on legal placements. They show significant improvements over state-of-the art methods.

show abstract

Section: Resultsmentioning

confidence: 99%

“…Center of gravity constraints to distribute the cells over the placement area were also used by [7], the limitation of the bounding box of critical nets by linear constraints ensures that timing specifications are met. This has been extended in [9] by adding some techniques to map the cells to their final position.…”

Section: Introductionmentioning

confidence: 99%

Quadratic placement using an improved timing model

Obermeier

Johannes

2004

Proceedings of the 41st Annual Design Automation Conference

View full text Add to dashboard Cite

show abstract

“…Hu et al [9] introduced the idea of fixedpoint as a more general way to add forces for cell spreading. Hur et al [12] used the spreading force of [7] to direct and control the ripple move optimization of Mongrel [21] to spread the cells. Kahng et al [6] combined the cell spreading objective of [22] with a wirelength objective to achieve simultaneous cell spreading and wirelength optimization.…”

Section: Introductionmentioning

confidence: 99%

FastPlace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model

Viswanathan

Chu

2005

IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst.

183

212

View full text Add to dashboard Cite

Abstract-In this paper, we present FastPlace -a fast, iterative, flat placement algorithm for large-scale standard cell designs. FastPlace is based on the quadratic placement approach. The quadratic approach formulates the wirelength minimization problem as a convex quadratic program that can be solved efficiently by some analytical techniques. However it suffers from some drawbacks. First, the resulting placement has a lot of overlap among cells. Second, the resulting total wirelength may be long as the quadratic wirelength objective is only an indirect measure of the linear wirelength. Third, existing net models tend to create a lot of non-zero entries in the connectivity matrix that slows down the quadratic program solver. To handle the above problems we propose: (

show abstract

“…The forced-directed technique [4,5] is an example of numerical method where elements are connected to springs. In this technique, forces are applied to springs targeting the placement of the elements.…”

Section: Related Workmentioning

confidence: 99%

A Transistor Placement Technique Using Genetic Algorithm and Analytical Programming

Lazzari

Anghel

Reis

Vlsi-Soc: From Systems to Silicon

View full text Add to dashboard Cite

Abstract. New technologies present a widely range of challenges in the design of standard-cell libraries, layout generation and validation of macro-blocks. Thus, the development of new tools being able to deal with these challenges is mandatory. This work presents a transistor placement technique using genetic algorithm associated to analytical programming. The genetic algorithm is used to reduce the search space of possible solutions while analytical equations are used to find out the position of each transistor in the layout.

show abstract

Force directed mongrel with physical net constraints

Cited by 6 publications

References 0 publications

Quadratic placement using an improved timing model

Quadratic placement using an improved timing model

FastPlace: efficient analytical placement using cell shifting, iterative local refinement,and a hybrid net model

A Transistor Placement Technique Using Genetic Algorithm and Analytical Programming

Contact Info

Product

Resources

About