<i>DeFer</i>: Deferred Decision Making Enabled Fixed-Outline Floorplanning Algorithm

Yan, Jackey; Chu, Chris

doi:10.1109/tcad.2010.2041850

Cited by 75 publications

(64 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As a result, to minimize yn+1 we can only shape blocks in subset IV. Similarly, we conclude 3 Please refer to Theorem 1 in [14] for the proof of these observations. that whenever we need to reduce xn+1 we can only shape blocks in subset VI.…”

Section: Observation 4 If Block I ∈ Subset Vi or Vii Then I Is On Ssupporting

confidence: 68%

See 1 more Smart Citation

Optimal slack-driven block shaping algorithm in fixed-outline floorplanning

Yan

Chu

2012

Proceedings of the 2012 ACM International Symposium on International Symposium on Physical Design

Self Cite

View full text Add to dashboard Cite

This paper presents an efficient, scalable and optimal slack-driven shaping algorithm for soft blocks in non-slicing floorplan. The proposed algorithm is called SDS. Different from all previous approaches, SDS is specifically formulated for fixed-outline floorplanning. Given a fixed upper bound on the layout width, SDS minimizes the layout height by only shaping the soft blocks in the design. Iteratively, SDS shapes some soft blocks to minimize the layout height, with the guarantee that the layout width would not exceed the given upper bound. Rather than using some simple heuristic as in previous work, the amount of change on each block is determined by systematically distributing the global total amount of available slack to individual block. During the whole shaping process, the layout height is monotonically reducing, and eventually converges to an optimal solution. We also propose two optimality conditions to check the optimality of a shaping solution. To validate the efficiency and effectiveness of SDS, comprehensive experiments are conducted on MCNC and HB benchmarks. Compared with previous work, SDS is able to achieve the best experimental result with significantly faster runtime.

show abstract

Section: Observation 4 If Block I ∈ Subset Vi or Vii Then I Is On Ssupporting

confidence: 68%

“…In [2], Zimmermann extended the shape curve representation by considering both slicing line directions when combining two blocks. Yan et al [3] generalized the notion of slicing tree [4] and extended the shape curve operations. Consequently, one shape curve captures significantly more shaping and floorplan solutions.…”

Section: Previous Workmentioning

confidence: 99%

Optimal slack-driven block shaping algorithm in fixed-outline floorplanning

Yan

Chu

2012

Proceedings of the 2012 ACM International Symposium on International Symposium on Physical Design

Self Cite

View full text Add to dashboard Cite

show abstract

“…Research work to combine CAG in a hierarchical floorplanning framework, e.g. [16], is expected to be done in the future to fully utilize its advantages as an adjacency graph.…”

Section: Discussionmentioning

confidence: 99%

Exploring adjacency in floorplanning

Wang¹,

Zhou²

2009

2009 Asia and South Pacific Design Automation Conference

View full text Add to dashboard Cite

Abstract-This paper describes a new floorplanning approach called Constrained Adjacency Graph (CAG) that helps exploring adjacency in floorplans. CAG extends the previous adjacency graph approaches by adding explicit adjacency constraints to the graph edges. After sufficient and necessary conditions of CAG are developed based on dissected floorplans, CAG is extended to handle general floorplans in order to improve area without changing the adjacency relations dramatically. These characteristics are currently utilized in a randomized greedy improvement heuristic for wire length optimization. The results show that better floorplans are found with much less running time for problems with 100 to 300 modules in comparison to a simulated annealing floorplanner based on sequence pairs.

show abstract

“…Zimmermann [2] extended the shape curve representation by considering both slicing line directions when combining two blocks. Yan et al [3] generalized the notion of slicing tree [4] and extended the shape curve operations. Consequently, one shape curve captures significantly more shaping and floorplan solutions.…”

Section: A Previous Workmentioning

confidence: 99%

SDS: An Optimal Slack-Driven Block Shaping Algorithm for Fixed-Outline Floorplanning

Yan

Chu

2013

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

Self Cite

View full text Add to dashboard Cite

Abstract-This paper presents an efficient, scalable, and optimal slack-driven shaping algorithm for soft blocks in nonslicing floorplan. The proposed algorithm is called SDS. SDS is specifically formulated for fixed-outline floorplanning. Given a fixed upper bound on the layout width, SDS minimizes the layout height by only shaping the soft blocks in the design. Iteratively, SDS shapes some soft blocks to minimize the layout height with the guarantee that the layout width would not exceed the given upper bound. Rather than using some simple heuristic as in previous work, the amount of change on each block is determined by systematically distributing the global total amount of available slack to individual block. During the whole shaping process, the layout height monotonically reduces and eventually converges to an optimal solution. Two optimality conditions are presented to check the optimality of a shaping solution for fixedoutline floorplanning. In practice, to terminate the process of convergence early, we propose two different stopping criteria. We also extend SDS to handle other floorplanning problems, e.g., classical floorplanning. To validate the efficiency and effectiveness of SDS, comprehensive experiments are conducted on MCNC and HB benchmarks. Compared with previous work, SDS achieves the best experimental result with a significantly faster runtime.Index Terms-Block shaping, fixed-outline floorplanning, very large scale integration physical design.

show abstract

DeFer: Deferred Decision Making Enabled Fixed-Outline Floorplanning Algorithm

Cited by 75 publications

References 18 publications

Optimal slack-driven block shaping algorithm in fixed-outline floorplanning

Optimal slack-driven block shaping algorithm in fixed-outline floorplanning

Exploring adjacency in floorplanning

SDS: An Optimal Slack-Driven Block Shaping Algorithm for Fixed-Outline Floorplanning

Contact Info

Product

Resources

About