VLSI Physical Design: From Graph Partitioning to Timing Closure

DOI10.1007/978-3-030-96415-3MaRDI QIDQ6060787zbMATH OpenOpenAlexFDO

Authors Andrew B. Kahng, Jens Lienig, Igor L. Markov, Jin Hu

Publication date 6 November 2023

Full work available at URL https://doi.org/10.1007/978-3-030-96415-3

zbMATH Keywords

chip planningdesign automationelectronic design automation (EDA)electronicspartitioningphysical design algorithmsplacementroutingtime closureVLSI design

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computer system organization (68M99) Graph theory (including graph drawing) in computer science (68R10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Recommendations

• VLSI physical design. From graph partitioning to timing closure
• Handbook of Algorithms for Physical Design Automation
• Algorithmic aspects of VLSI layout.
• scientific article; zbMATH DE number 802995
• scientific article; zbMATH DE number 719746

Cited in

(1)

• Eigenvalue bounds of saddle point matrix from mixed-cell-height integrated circuit legalization problem

This page was built for publication: VLSI Physical Design: From Graph Partitioning to Timing Closure

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