Determinstic VLSI block placement algorithm using less flexibility first principle

DOI10.1007/BF02945462MaRDI QIDQ1884306zbMATH OpenFDO

Authors J. Gu, Sheqin Dong, Xianlong Hong, Yu-Liang Wu

Publication date 28 October 2004

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02945462

zbMATH Keywords

NP-hardplacementVLSI floorplanningVLSI physical design

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)

Recommendations

• Algorithms for VLSI placement
• Linear placement algorithms and applications to VLSI design
• Theory and practice of VLSI placement
• VLSI Placement Using Quadratic Programming and Network Partitioning Techniques
• Algorithmic aspects of VLSI layout.
• A Constraint Satisfaction Approach for Programmable Logic Detailed Placement
• Balanced block spacing for VLSI layout
• A nonlinear optimization methodology for VLSI fixed-outline floorplanning
• An Array Layout Methodology for VLSI Circuits
• scientific article; zbMATH DE number 4133846

Cites work

• Multidimensional binary search trees used for associative searching
• Optimization by simulated annealing

Cited in

(2)

• Balanced block spacing for VLSI layout
• New perspectives in VLSI design automation: deterministic packing by sequence pair

This page was built for publication: Determinstic VLSI block placement algorithm using less flexibility first principle

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