Simulated annealing based VLSI circuit partitioning for delay minimization

MaRDI QIDQ3111765zbMATH OpenFDO

Authors

Publication date 13 January 2012

zbMATH Keywords

delaynetlistpartitioningsimulated annealingVLSI

Mathematics Subject Classification ID

Circuits, networks (94C99)

Recommendations

• Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
• scientific article; zbMATH DE number 193510
• Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout
• scientific article; zbMATH DE number 4064384
• A mixed heuristic for circuit partitioning

Cited in

(5)

• A mixed heuristic for circuit partitioning
• Application of the simulated annealing local search technique to problems of redundancy elimination in functional and parametric tests of integrated circuits
• Circuit partitioning using mean field annealing
• Hierarchical algorithm for a partition problem using simulated annealing: application to placement in VLSI layout
• scientific article; zbMATH DE number 193510 (Why is no real title available?)

This page was built for publication: Simulated annealing based VLSI circuit partitioning for delay minimization

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