Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2015, Article ID 162050, 8 pages
http://dx.doi.org/10.1155/2015/162050
Research Article

Accounting for Recent Changes of Gain in Dealing with Ties in Iterative Methods for Circuit Partitioning

1Department of Computer Science & Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 139-701, Republic of Korea
2Department of Computer Engineering, College of Information Technology, Gachon University, 1342 Seongnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 461-701, Republic of Korea

Received 14 May 2015; Accepted 9 September 2015

Academic Editor: Alicia Cordero

Copyright © 2015 Yong-Hyuk Kim and Yourim Yoon. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. J. Alpert, J.-H. Huang, and A. B. Kahng, “Multilevel circuit partitioning,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 8, pp. 655–667, 1998. View at Publisher · View at Google Scholar · View at Scopus
  2. C. J. Alpert and A. B. Kahng, “Recent directions in netlist partitioning: a survey,” Integration, the VLSI Journal, vol. 19, no. 1-2, pp. 1–81, 1995. View at Publisher · View at Google Scholar
  3. S. Dutt and W. Deng, “Probability-based approaches to VLSI circuit partitioning,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 19, no. 5, pp. 534–549, 2000. View at Publisher · View at Google Scholar · View at Scopus
  4. S. Dutt and W. Deng, “Cluster-aware iterative improvement techniques for partitioning large VLSI circuits,” ACM Transactions on Design Automation of Electronic Systems, vol. 7, no. 1, pp. 91–121, 2002. View at Publisher · View at Google Scholar · View at Scopus
  5. T. N. Bui and B.-R. Moon, “GRCA: a hybrid genetic algorithm for circuit ratio-cut partitioning,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 17, no. 3, pp. 193–204, 1998. View at Publisher · View at Google Scholar · View at Scopus
  6. J.-P. Kim, Y.-H. Kim, and B.-R. Moon, “A hybrid genetic approach for circuit bipartitioning,” in Genetic and Evolutionary Computation—GECCO 2004: Genetic and Evolutionary Computation Conference, Seattle, WA, USA, June 26–30, 2004. Proceedings, Part II, vol. 3103 of Lecture Notes in Computer Science, pp. 1054–1064, Springer, Berlin, Germany, 2004. View at Publisher · View at Google Scholar
  7. S. K. Lodha and D. Bhatia, “Bipartitioning circuits using TABU search,” in Proceedings of the 11th Annual IEEE International ASIC Conference, pp. 223–227, Rochester, NY, USA, September 1998. View at Publisher · View at Google Scholar
  8. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Publisher · View at Google Scholar
  9. D. G. Schweikert and B. W. Kernighan, “A proper model for the partitioning of electrical circuits,” in Proceedings of the Proceedings of the 9th Design Automation Workshop (DAC '72), pp. 57–62, June 1972. View at Publisher · View at Google Scholar
  10. C. M. Fiduccia and R. M. Mattheyses, “A linear-time heuristic for improving network partitions,” in Proceedings of the 19th ACM/IEEE Conference on Design Automation, pp. 175–181, IEEE, Las Vegas, Nev, USA, June 1982. View at Publisher · View at Google Scholar
  11. Y.-H. Kim and B.-R. Moon, “Lock-gain based graph partitioning,” Journal of Heuristics, vol. 10, no. 1, pp. 37–57, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Transactions on Computers, vol. 33, no. 5, pp. 438–446, 1984. View at Publisher · View at Google Scholar · View at Scopus
  13. L. W. Hagen, D. J.-H. Huang, and A. B. Kahng, “On implementation choices for iterative improvement partitioning algorithms,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 16, no. 10, pp. 1199–1205, 1997. View at Publisher · View at Google Scholar · View at Scopus
  14. Y. Yoon and Y.-H. Kim, “New bucket managements in iterative improvement partitioning algorithms,” Applied Mathematics & Information Sciences, vol. 7, no. 2, pp. 529–532, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. A. Moraglio, Y.-H. Kim, Y. Yoon, and B.-R. Moon, “Geometric crossovers for multiway graph partitioning,” Evolutionary Computation, vol. 15, no. 4, pp. 445–474, 2007. View at Publisher · View at Google Scholar · View at Scopus