A discrete dynamic convexized method for VLSI circuit partitioning

References

• Aleksandar , T. and William , J. K. 2008 . Parallel multilevel algorithms for hypergraph partitioning . J. Parallel Distrib. Comput. , 68 ( 5 ) : 563 – 581 . (doi:10.1016/j.jpdc.2007.11.002)
   Web of Science ®Google Scholar
• Alpert , C. J. 1998 . The ISPD-98 circuit benchmark suite . Proceedings of the IEEE/ACM International Symposium on Physical Design . 1998 , Monterey , CA , USA. pp. 80 – 85 .
   Google Scholar
• Areibi , S. and Yang , Z. 2004 . Effective memetic algorithms for VLSI design=genetic algorithms+local search+ multi-level clustering . J. Evol. Comput., Spec. Issue Memet. Evol. Algorithms , 12 ( 3 ) : 327 – 353 .
   PubMed Web of Science ®Google Scholar
• Benlic , U. and Hao , J. K. 2011 . An effective multilevel tabu search approach for balanced graph partitioning . Comput. Oper. Res. , 38 ( 7 ) : 1066 – 1075 . (doi:10.1016/j.cor.2010.10.007)
   Web of Science ®Google Scholar
• Caldwell , A. E. , Kahng , A. B. and Markov , I. L. Improved algorithms for hypergraph bipartitioning . Proceedings of the Asia and South Pacific Design Automation Conference . Yokohama , Japan. pp. 661 – 666 .
   Google Scholar
• Chardaire , P. , Barake , M. and McKeown , G. P. 2007 . A PROBE-based heuristic for graph partitioning . IEEE Trans. Comput. , 56 ( 12 ) : 1707 – 1720 . (doi:10.1109/TC.2007.70760)
   Web of Science ®Google Scholar
• Cong , J. and Lim , S. K. Multiway partitioning with pairwise movement . Proceedings of the IEEE/ACM International Conference on Computer-Aided Design . San Jose , CA , USA. pp. 512 – 516 .
   Google Scholar
• Cong , J. and Lim , S. K. 2004 . Edge separability-based circuit clustering with application to multilevel circuit partitioning . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. , 23 ( 3 ) : 346 – 357 . (doi:10.1109/TCAD.2004.823353)
   Web of Science ®Google Scholar
• Dasdan , A. and Aykanat , C. 1997 . Two novel multiway circuit partitioning algorithms using relaxed locking . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. , 16 ( 2 ) : 169 – 177 . (doi:10.1109/43.573831)
   Web of Science ®Google Scholar
• Dutt , S. and Deng , W. 2002 . Cluster-aware iterative improvement techniques for partitioning large VLSI circuits . ACM Trans. Des. Autom. Electron. Syst. , 7 ( 1 ) : 91 – 121 . (doi:10.1145/504914.504918)
   Web of Science ®Google Scholar
• Fiduccia , C. M. and Mattheyses , R. M. A linear time heuristic for improving network partitions . Proceedings of 19th IEEE Design Automation Conference . Las Vegas , NV , USA. pp. 175 – 181 .
   Google Scholar
• Garey , M. R. and Johnson , D. S. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , 223 San Francisco , CA : Freeman .
   Google Scholar
• Karypis , G. 2002 . “ Multilevel hypergraph partitioning ” . Minneapolis , MN : University of Minnesota . Tech. Rep. 02-025
   Google Scholar
• Kernighan , B. W. and Lin , S. 1970 . An efficient heuristic procedure for partitioning graphs . Bell Syst. Tech. J. , 49 ( 2 ) : 291 – 307 .
   Google Scholar
• kucar , D. 2009 . “ Handbook of Algorithms for Physical Design Automation ” . 109 – 134 . Boca Raton , FL : CRC Press .
   Google Scholar
• Li , J. and Behjat , L. 2006 . A connectivity based clustering algorithm with application to VLSI circuit partitioning . IEEE Trans. Circuits Syst. II: Express Briefs , 53 ( 5 ) : 384 – 388 . (doi:10.1109/TCSII.2005.862174)
   Web of Science ®Google Scholar
• Li , J. and Behjat , L. 2007 . Net cluster: A net-reduction-based clustering preprocessing algorithm for partitioning and placement . IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. , 26 ( 4 ) : 669 – 679 . (doi:10.1109/TCAD.2007.892339)
   Web of Science ®Google Scholar
• Moraglio , A. , Kim , Y. H. , Yoon , Y. and Moon , B.-R. 2007 . Geometric crossovers for multiway graph partitioning . Evol. Comput. , 15 ( 4 ) : 445 – 474 . (doi:10.1162/evco.2007.15.4.445)
   PubMed Web of Science ®Google Scholar
• Papa , D. A. and Markov , I. L. 2007 . “ Hypergraph partitioning and clustering ” . In Handbook of Approximation Algorithms and Metaheuristics , Edited by: Gonzalez , T. F. 61-1 – 61-19 . Boca Raton , FL : CRC Press .
   Google Scholar
• Saab , Y. G. 2004 . An effective multilevel algorithm for bisecting graphs and hypergraphs . IEEE Trans. Comput. , 53 ( 6 ) : 641 – 652 . (doi:10.1109/TC.2004.3)
   Web of Science ®Google Scholar
• Sait , S. M. , El-Maleh , A. H. and Al-Abaji , R. H. 2006 . Evolutionary algorithms for VLSI multi-objective netlist partitioning . Eng. Appl. Artif. Intell. , 19 ( 3 ) : 257 – 268 . (doi:10.1016/j.engappai.2005.09.008)
   Web of Science ®Google Scholar
• Selvakkumaran , N. and Karypis , G. Multi-objective hypergraph partitioning algorithms for cut and maximum subdomain degree minimization . Proceedings of IEEE/ACM International Conference on Computer Aided Design . San Jose , CA , USA. pp. 726 – 733 .
   Google Scholar
• Soper , W. J. , Walshaw , C. and Cross , M. 2004 . A combined evolutionary search and multilevel optimisation approach to graph-partitioning . J. Global Optim. , 29 ( 2 ) : 225 – 241 . (doi:10.1023/B:JOGO.0000042115.44455.f3)
   Web of Science ®Google Scholar
• Venayagamoorthy , G. K. , Smith , S. C. and Singhal , G. 2007 . Particle swarm-based optimal partitioning algorithm for combinational CMOS circuits . Eng. Appl. Artif. Intell. , 20 ( 2 ) : 177 – 184 . (doi:10.1016/j.engappai.2006.06.011)
   Web of Science ®Google Scholar
• Zhan , Q. Q. and Zhu , W. X. 2007 . Improved GRASP based circuit partitioning algorithm . J. Zhejiang Univ. Eng. Sci. , 41 ( 10 ) : 1679 – 1683 .
   Google Scholar
• Zhu , W. X. and Ali , M. M. 2009 . Discrete dynamic convexized method for nonlinearly constrained nonlinear integer programming . Comput. Oper. Res. , 36 ( 10 ) : 2723 – 2728 . (doi:10.1016/j.cor.2008.12.002)
   Web of Science ®Google Scholar
• Zhu , W. X. and Fan , H. 2009 . A discrete dynamic convexized method for nonlinear integer programming . J. Comput. Appl. Math. , 223 ( 1 ) : 356 – 373 . (doi:10.1016/j.cam.2008.01.023)
   Web of Science ®Google Scholar