International Journal of Computational Intelligence Research

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

An Intelligent Solution Archive Based Evolutionary Approach for Digital Circuit Layout


Affiliations
1 School of Mathematics and Applications, Thapar University, Patiala–147004
2 University Computer Center, Punjabi University, Patiala–147701.
     

   Subscribe/Renew Journal


In recent years storing the visited solutions during evolutionary process is becoming one of leading topic in the area of research which guarantees that the algorithm will never get trapped to local optimum. This paper focuses on solving the min cut balanced partitioning problem for digital circuit layout using a solution archive which stores efficiently all visited solutions during the evolutionary process and at same time intelligently transforming the revisited solutions into yet unvisited feasible solutions giving balanced weighted partitions.

Keywords

Binary Trie, Partitioning, Hypergraph, Net Cut, Crossover
Subscription Login to verify subscription
User
Notifications
Font Size


  • D. Kolar, J. Divokovic Puksec and Ivan Branica, "VLSI Circuit partitioning using Simulated annealing Algorithm ", IEEE Melecon, Dubrovnik, Croatia, May 12-15,2004.

  • C. J. Alpert, L. W. Hagen, and A. B. Kahng, "A hybrid multilevel / genetic approach for circuit partitioning, " in Proc. ACM/SIGDA Physical Design Workshop, 1996, pp. 100–105.

  • Lingyu Sun, Ming Leng: "An Effective Refinement Algorithm Based on Swarm Intelligence for Graph Bipartitioning ", ESCAPE 2007, pp. 60-69.

  • T. N. Bui, B. R. Moon, "Genetic Algorithm and Graph Partitioning". In IEEE Transactions on Computers, Vol.45, No.7, July 1996, pp. 841-855.

  • U. Benlic and J.-K. Hao. "An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning ". In Proc. 22nd IEEE Intl Conf. Tools with Artificial Intelligence, 2010, pp. 121-128.

  • J. Kratica. "Improving performances of the genetic algorithm by caching". Computers and Artificial Intelligence, Vol., No. 18, 1999, pp. 271-283.

  • Kaur, M., Singh, Kawaljeet " On solving Mincut Balanced Circuit Partitioning Problem for Digital Circuit Layout using Evolutionary Approach with Solution Archive", International Journal of Computer Applications, Volume 62, No.14, January 2013 pp. 39-41.

  • S. J. Louis and G. Li. "Combining robot control strategies using genetic algorithms with memory". In Lecture Notes in Computer Science, Evolutionary Programming VI, Springer, 1997, pages 431-442.

  • S. Ronald. "Complex systems: Mechanism of adaption". In R. Stonier and X. H. Yu, editors, Complex Systems: Mechanism of Adaptation, Amsterdam, 1994 pp. 133-140.

  • S.Y. Yuen and C. K. Chow. "A non-revisiting genetic algorithm". In IEEE Congress on Evolutionary Computation (CEC 2007), IEEE Press, 2007 pp. 4583-4590.

  • http://vlsicad.ucsd.edu / GSRC / bookshelf / Slots / Partitioning.

  • C. J. Alpert, L. W. Hagen, and A. B. Kahng, "A hybrid multilevel/genetic approach for circuit partitioning, " in Proc. ACM/SIGDA Physical Design Workshop, 1996, pp. 100–105.

  • M. Sait, Aiman H. El-Maleh, Rush H. Al-Abuji: Simulated evolution algorithm for multiobjective VLSI netlist bi-partitioning. ISCAS (5) 2003, pp. 457-460.

  • S. Zaubzer. "A complete archive genetic algorithm for the multidimensional knapsack problem ". Master's thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms, Vienna, Austria, May 2008.


Abstract Views: 475

PDF Views: 0




  • An Intelligent Solution Archive Based Evolutionary Approach for Digital Circuit Layout

Abstract Views: 475  |  PDF Views: 0

Authors

Maninder Kaur
School of Mathematics and Applications, Thapar University, Patiala–147004
Kawaljeet Singh
University Computer Center, Punjabi University, Patiala–147701.

Abstract


In recent years storing the visited solutions during evolutionary process is becoming one of leading topic in the area of research which guarantees that the algorithm will never get trapped to local optimum. This paper focuses on solving the min cut balanced partitioning problem for digital circuit layout using a solution archive which stores efficiently all visited solutions during the evolutionary process and at same time intelligently transforming the revisited solutions into yet unvisited feasible solutions giving balanced weighted partitions.

Keywords


Binary Trie, Partitioning, Hypergraph, Net Cut, Crossover

References