Table of Contents Author Guidelines Submit a Manuscript
VLSI Design
Volume 2011 (2011), Article ID 896241, 9 pages
http://dx.doi.org/10.1155/2011/896241
Research Article

Wirelength Minimization in Partitioning and Floorplanning Using Evolutionary Algorithms

1Department of Electronics and Communication, M. V. J. College of Engineering, Bangalore 560067, India
2Vivekanandha College of Engineering for Women, Trichengode 637205, Tamilnadu, India

Received 16 December 2010; Revised 23 April 2011; Accepted 6 July 2011

Academic Editor: Zhuo Li

Copyright © 2011 I. Hameem Shanavas and Ramaswamy Kannan Gnanamurthy. 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. N. Sherwani, Algorithms for VLSI Physical Design Automation, Kluwer Academic Publishers, Boston, Mass, USA, 1999.
  2. I. Hameem Shanavas, R. K. Gnanamurthy, and T. Stephen Thangaraj, “Hybrid algorithmical approach for VLSI physical design—floorplanning,” International Journal of Recent Trends in Engineering, vol. 2, no. 4, 2009. View at Google Scholar
  3. M. Tang and X. Yao, “A memetic algorithm for VLSI floor planning,” IEEE Transactions on Systems, Man, and Cyber Net, vol. 37, no. 1, 2007. View at Google Scholar
  4. P. Subbaraj, K. Sivasundari, and P. Siva Kumar, “An effective memetic algorithm for VLSI partitioning problem,” in Proceedings of the International Conference on ICTES, pp. 667–670, Chennai, India, 2007.
  5. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” The Bell System Technical Journal, pp. 291–307, 1970. View at Google Scholar
  6. C. M. Fiduccia and R. M. Mattheyses, “A linear-time heuristic for improving network partitions,” in Proceedings of the 19th ACM IEEE Design Automation Conference, pp. 175–181, 1982.
  7. T. W. Manikas and J. T. Cain, “Genetic algorithms vs simulated annealing:a comparison of approaches for solving the circuit partitioning problem,” Tech. Rep. 96-101, The University of Pittsburgh, 1996. View at Google Scholar
  8. Y. Yodtean and P. Chantngarm, “Hybrid algorithm for circuit partitioning,” in Proceedings of IEEE Region 10 Conference, vol. 4, November 2004. View at Publisher · View at Google Scholar
  9. G.-F. Nan and M.-Q. Li, “Two novel encoding strategies based genetic algorithms for circuit partitioning,” in Proceedings of the 3rd IEEE International Conference on Machine Learning, vol. 4, pp. 2182–2188, Shangai, 2005.
  10. G. C. Sipakoulis, I. Karafyllidis, and A. Thanailkis, “Genetic partition and placement for VLSI circuits,” in Proceedings of the 6th IEEE Conference on Electronics Circuits and Systems, vol. 3, pp. 1647–1650, 1999. View at Publisher · View at Google Scholar
  11. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to Theory of NP-Completeness, Freeman, San Francisco, Calif, USA, 1979.
  12. G. Tumbush and D. Bhatia, “Partitioning under timing and area constraints,” in Proceedings of the International Conference on Computer Design, pp. 614–620, October 1997. View at Scopus
  13. C. J. Augeri and H. H. Ali, “New graph-based algorithms for partitioning VLSI circuits,” in Proceedings of the IEEE International Symposium on Cirquits and Systems, pp. V-521–V-524, May 2004. View at Scopus
  14. S. M. Sait, A. H. El-Maleh, and R. H. Al-Abaji, “General iterative heuristics for VLSI multiobjective partitioning,” in Proceedings of the 2003 IEEE International Symposium on Circuits and Systems (ISCAS '03), pp. V497–V500, May 2003. View at Scopus
  15. F. M. Johannes, “Partitioning of VLSI circuits and systems,” in Proceedings of the 1996 33rd Annual Design Automation Conference, pp. 83–87, June 1996. View at Scopus
  16. A. Cincotti, V. Cuttelo, and M. Pavone, “Graph partitioning using genetic algorithms with OPDX,” in Proceedings of IEEE World Congress on Computational Intelligence, pp. 402–406, 2002.
  17. I. Hameem Shanavas and R. K. Gnanamurthy, “Evolutionary algorithmical approach on VLSI Floorplanning problem,” International Journal of Computer Theory and Engineering, vol. 1, no. 4, pp. 461–464, 2009. View at Google Scholar
  18. N. Krasnogor and J. Smith, “A tutorial for competent memetic algorithms: model, taxonomy, and design issues,” IEEE Transactions on Evolutionary Computation, vol. 9, no. 5, pp. 474–488, 2005. View at Publisher · View at Google Scholar · View at Scopus
  19. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at Scopus
  20. V. Cerny, “Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm,” Journal of Optimization Theory and Applications, vol. 45, no. 1, pp. 41–51, 1985. View at Publisher · View at Google Scholar · View at Scopus
  21. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Google Scholar · View at Scopus
  22. L. Ingber, “Very fast simulated re-annealing,” Mathematical and Computer Modelling, vol. 12, no. 8, pp. 967–973, 1989. View at Google Scholar · View at Scopus