A tight area upper bound for slicing floorplans

Peixoto, H.P.; Jacome, Margarida F.; Royo, Alejandro Sancho

doi:10.1109/icvd.2000.812622

Cited by 5 publications

(1 citation statement)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Early results also suggest that further refinements of the ZDS algorithm may render it useful in and of itself as a component in floorplanning and placement algorithms. Previous works on this subject ( [23], [19]) analyzed the theoretical upper bounds on the total area achieved by slicing floorplans of soft blocks.…”

Section: Introductionmentioning

confidence: 99%

An area-optimality study of floorplanning

Cong

Nataneli

Romesis

et al. 2004

Proceedings of the 2004 International Symposium on Physical Design

View full text Add to dashboard Cite

A novel algorithm for rectangular floorplanning with guaranteed 100% area utilization is used to construct new sets of floorplanning benchmarks. By minimizing the maximum block aspect ratio subject to a zero-dead-space constraint, example zero-dead-space (ZDS) floorplans matching the area profiles of any existing floorplanning benchmark circuits can be constructed. A mathematical analysis shows that the aspect ratios of the ZDS benchmarks' blocks are uniformly bounded within [1, 3] in most cases. Block packings produced by the Parquet, B*-tree, TCG-S, and BloBB packages on these new benchmarks are compared to the optimal-area floorplans produced by the ZDS algorithm.

show abstract

Section: Introductionmentioning

confidence: 99%

An area-optimality study of floorplanning

Cong

Nataneli

Romesis

et al. 2004

Proceedings of the 2004 International Symposium on Physical Design

View full text Add to dashboard Cite

show abstract

A Theoretical Upper Bound for IP-Based Floorplanning

Yang

Song

Yang

et al. 2005

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Floorplan is a crucial estimation task in the modern layout design of systems on chips. The paper presents a novel theoretical upper bound for slicing floorplans with soft modules. We show that, given a set of soft modules of total area A total , maximum area A max , and shape flexibility r ≥ 2.25, there exists a slicing floorplan F of these modules such that Area(F) ≤ min{1.131, (1 + β)}A total , where β = A max 2rA total . Our results ameliorate the existing best results.

show abstract

An upper bound for 3D slicing floorplans

Salewski¹,

Barke²

Proceedings of ASP-DAC/VLSI Design 2002. 7th Asia and South Pacific Design Automation Conference and 15h International Conferen

View full text Add to dashboard Cite

show abstract

A tight area upper bound for slicing floorplans

Cited by 5 publications

References 5 publications

An area-optimality study of floorplanning

An area-optimality study of floorplanning

A Theoretical Upper Bound for IP-Based Floorplanning

An upper bound for 3D slicing floorplans

Contact Info

Product

Resources

About