How good are slicing floorplans?

DOI10.1016/S0167-9260(97)00014-XMaRDI QIDQ3840896zbMATH OpenOpenAlexFDO

Authors F. Y. Young, D. F. Wong

Publication date 13 August 1998

Published in Integration (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-9260(97)00014-x

zbMATH Keywords

rectangle packingfloorplan designcircuit placementslicing floorplan

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• Computing and Combinatorics
• Sliceable Floorplanning by Graph Dualization
• Optimal module sizing in VLSI floorplanning by nonlinear programming
• Complexity and approximability results for slicing floorplan designs.
• Simple and efficient floor-planning

Cited in

(4)

• Maximum weight matching and genetic algorithm for fixed-shape facility layout problem
• Computing and Combinatorics
• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules
• Exact and approximation algorithms for a soft rectangle packing problem

This page was built for publication: How good are slicing floorplans?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840896)