Abstract
Partitioning is a technique to divide a circuit or system into a collection of smaller parts (components). Circuit partitioning problem is a well-known NP hard problem and requires efficient heuristic algorithms to solve it. The problem involves dividing the circuit net list into two subsets. The balanced constraint is an important constraint that obtains an area-balanced layout without compromising the min-cut objective. The number of edges belonging to two different partitions is the cut-cost of a partition. This chapter deals with multi-objective genetic algorithms for the optimization of two objectives: area imbalance and cut cost. The objective is to separate the cells into two partitions so that the number of interconnections between the partitions can be minimized and the cells are evenly distributed across the layout surface. MCNC benchmark circuits are used to validate the performance of the multi-objective evolutionary algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Al-Abaji RH (2002) Evolutionary techniques for multi-objective VLSI net list partitioning. Dissertation, King Fahd University of Petroleum and Minerals, Dhahran, Kingdom of Saudi Arabia
Ababei C, Selvakumaran N, Bazargan K, Karypis G (2002) Multi objective circuit partitioning for cut size and path-based delay minimization. In: Proceedings of the 2002 IEEE/ACM international conference on computer-aided design, 10–14 Nov, Sanjose, USA, pp 181–185
Areibi S, Vannelli A (1993) A combined eigenvector tabu search approach for circuit partitioning. In: Proceedings of IEEE custom integrated circuits conference, San Diego, 09–12 May 1993, pp 9.7.1–9.7.4
Bergh F, Engelbrecht A (2002) A new locally convergent particle swarm optimizer. In: Proceedings of conference on systems, man and cybernetics, Hammamet-Tunisia, pp 96–101
Brandstatter B, Baumgartner U (2002) Particle swarm optimization – mass-spring system analog. IEEE Trans Magn 38:997–1002
Carlisle A, Dozier G (2000) Adaptive particle swarm optimization to dynamic environment. In: Proceedings of international conference on artificial intelligence, Mexico, pp 429–443
Clarc M, Kennedy J (2002) The particle swarm – explosion, stability, and convergence in a multidimensional complex space. IEEE Trans Evol Comput 6(1):58–73
Deb K (2002) Multi-objective optimization using evolutionary algorithms. John Wiley & Sons, USA
Drechsler R, Gunther W, Eschbach T, Linhard L, Angst G (2003) Recursive bi-partitioning of net lists for large number of partitions. J Syst Architect 49(12–15):521–528
Fiduccia CM, Mattheyses RM (1982) A linear time heuristic for improving network partitions. In: Proceedings of nineteenth design automation conference, IEEE Press, Piscataway, pp 175–181
Gajski DD, Vahid F, Narayau S, Gong J (1994) Specification and design of embedded system. Prentice Hall, NJ, USA
Gerez SH (1999) Algorithm for VLSI design automation. John Wiley & Sons, USA
Glover F (1989) Tabu search – Part I. ORSA. J Comput 1(3):190–206
Hassan R, Cohanim B, de Weck O (2004) A comparison of particle swarm optimization and the genetic algorithm. American Institute of Aeronautics and Astronautics, pp 1–13
Jagadeeswari M, Bhuvaneswari MC (2010) Application of evolutionary algorithms for partitioning in VLSI and Embedded Systems. Dissertation, Anna University, Chennai, 2010
Johnson DS, Aragon CR, McGeoch LA, Schevon C (1989) Optimization by simulated annealing: an experimental evaluation, part I, graph partitioning. Operat Res 37(6):865–892
Kennedy J, Eberhart RC (1995) Particle swarm optimization. In: Proceedings of IEEE international conference on neural networks IV, July 1995, Piscataway, pp 1942–1948
Kennedy J, Eberhart, R (1997) A discrete binary version of the particle swarm algorithm. In: Proceedings of international conference on systems man and cybernetics, 12–15 Oct 1997, Orlando, pp 4104–4109
Kennedy J, Eberhart RC, Shi Y (2001) Swarm intelligence. Morgan Kaufmann Publishers, San Francisco
Kernighan BW, Lin S (1970) An efficient heuristic procedure for partitioning graphs. Bell Syst Techn J 49(2):291–307
Khan JA, Sait SM, Minhas MR (2002) Fuzzy bias less simulated evolution for multi-objective VLSI placement. In: IEEE CEC 2002, Hawaii, USA, 12–17 May 2002, pp 1642–1647
Mardhana E, Ikeguchi T (2003) Neuro search: a program library for neural network driven search meta-heuristics. In: Proceedings of 2003 international symposium on circuits and systems, 25–28 May 2003, Bangkok, Thailand, pp V-697–V-700
Mazumder P, Rudnick EM (1999) Genetic algorithms for VLSI design layout and test automation. Prentice Hall, New York
Ouyang M, Toulouse M, Thulasiraman K, Glover F, Deogun JS (2002) Multilevel cooperative search for the circuit/hyper graph partitioning problem. IEEE Trans Comput-Aided Des Integr Circuits Syst 21(6):685–693
Sait SM, El-Maleh AH, Al-Abaji RH (2003) General iterative heuristics for VLSI multi-objective partitioning. In Proceedings of the 2003 international symposium on circuits and systems, ISCAS’03, 25–28 May 2003, Bangkok, Thailand, pp V-497–V-500
Sait SM, El-Maleh AH, Al-Abaji RH (2006) Evolutionary algorithms for VLSI multi-objective net list partitioning. Int J Eng Appl Artif Intell, 19(3):257–268
Salman A, Ahmad I, Al-Madani S (2002) Particle swarm optimization for task assignment problem. Microprocess Microsyst 26:363–371
Shi Y, Eberhart R (1998) Parameter selection in particle swarm optimization. In: Proceedings of 7th annual conference evolutionary programming, 25–27 Mar 1998, San Deigo, pp 591–600
Sipakoulis GC, Karafyllidis I, Thanailakis A (1999) Genetic partitioning and placement for VLSI circuits. In Proceedings of sixth IEEE international conference on electronics, circuits and systems ICECS’99, 05–08 Sept 1999, Pafos, Cyprus, pp 1647–1650
Srinivasan V, Govindarajan S, Vemuri R (2001) Fine-grained and coarse-grained behavioral partitioning with effective utilization of memory and design space exploration for multi-FPGA architectures. IEEE Trans VLSI Syst 9(1):140–158
Sudholt D, Witt C (2008) Run time analysis of binary PSO. In: Proceedings of the 10th annual conference on genetic and evolutionary computation, 16 July 2008, New York, pp 135–142
Tsou CS, Fang HH, Chang HH, Kao CH (2006) An improved particle swarm pareto optimizer with local search and clustering. In: Proceedings of sixth international conference SEAL, China, 15–18 Oct 2006, pp 400–406
Wang K, Huang L, Zhou C, Pang W (2003) Particle swarm optimization for traveling salesman problem. In: Proceedings of the second international conference on machine learning and cybermetics, 24–27 Aug 2003, Xi-an, China, pp 1583–1585
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer India
About this chapter
Cite this chapter
Bhuvaneswari, M.C., Jagadeeswari, M. (2015). Circuit Partitioning for VLSI Layout. In: Bhuvaneswari, M. (eds) Application of Evolutionary Algorithms for Multi-objective Optimization in VLSI and Embedded Systems. Springer, New Delhi. https://doi.org/10.1007/978-81-322-1958-3_3
Download citation
DOI: https://doi.org/10.1007/978-81-322-1958-3_3
Published:
Publisher Name: Springer, New Delhi
Print ISBN: 978-81-322-1957-6
Online ISBN: 978-81-322-1958-3
eBook Packages: EngineeringEngineering (R0)