A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete ...A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.The experimental results prove that the algorithms can run very fast with lower wiring resources consumption.As a result,the CAD tool based on these algorithms is able to cope with large-scale circuits.展开更多
A new randomized parallel B & B algorithm is presented based on the similarity between heuristic search and statistics, and tested on a transputer network. The test result proves that the algorithm has a high spee...A new randomized parallel B & B algorithm is presented based on the similarity between heuristic search and statistics, and tested on a transputer network. The test result proves that the algorithm has a high speedup ratio, reliability, flexibility and fault tolerance.展开更多
文摘A CAD tool based on a group of efficient algorithms to verify,design,and optimize power/ground networks for standard cell model is presented.Nonlinear programming techniques,branch and bound algorithms and incomplete Cholesky decomposition conjugate gradient method (ICCG) are the three main parts of our work.Users can choose nonlinear programming method or branch and bound algorithm to satisfy their different requirements of precision and speed.The experimental results prove that the algorithms can run very fast with lower wiring resources consumption.As a result,the CAD tool based on these algorithms is able to cope with large-scale circuits.
文摘A new randomized parallel B & B algorithm is presented based on the similarity between heuristic search and statistics, and tested on a transputer network. The test result proves that the algorithm has a high speedup ratio, reliability, flexibility and fault tolerance.
