Abstract
Genetic algorithm, an effective methodology for solving combinatorial optimization problems, is a very computationally expensive algorithm and, as such, numerous researchers have undertaken efforts to improve it. In this paper, we presented the partial mapped crossover and cell move or cells exchange mutation operators in the genetic algorithm when applied to cell placement problem. Traditional initially placement method may cause overlaps between two or more cells, so a heuristic initial placement approach and method of timely updating the coordinates of cells involved were used in order to eliminate overlaps between cells, meanwhile, considering the characters of different circuits to be placed, the punishment item in objective function was simplified. This algorithm was applied to test a set of benchmark circuits, and experiments reveal its advantages in placement results and time performance when compared with the traditional simulated annealing algorithm.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Kumar, R., Luo, Z.: Optimizing The Operation Sequence of A Chip Placement Machine Using TSP Model. IEEE Transactions on Electronics Packaging Manufacturing 26(1), 14–21 (2003)
Ishizuka, M., Aida, M.: Achieving Power-law Placement in Wireless Sensor Networks. In: Autonomous Decentralized Systems, 2005. Pro. ISADS 2005, pp. 661–666 (2005)
Alrabady, A.L., Mahud, S.M., Chaudhary, V.: Placement of Resources in the Star Network. In: IEEE Second International Conference on Algorithms and Architectures for Parallel Processing ICAPP (1996)
Qiu, L., Padmanabhan, V.N., Voelker, G.M.: On the Placement of Web Server Replicas. In: Pro. Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM 2001), pp. 1587–1596 (2001)
John, A.C., Sungho, K.: An Evaluation of Parallel Simulated Annealing Strategies with Application to Standard Cell Placement. IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems 16(3), 398–410 (1997)
Terai, M., Takahashi, K., Sato, K.: A New Min-cut Placement Algorithm for Timing Assurance Layout Design Meeting Net Length Constrain. In: Design Automation Conference, pp. 96–102 (1990)
Saurabh, A., Igor, M., Villarrubia, P.G.: Improving Min-cut Placement for VLSI Using Analytical Techniques. In: IBM ACAS Conference, pp. 55–62 (2003)
Quinn, J.R., Breuer, M.A.: A Forced Directed Component Placement Procedure for Printed Circuit Boards. IEEE Trans. CAS 26(6), 377–388 (1979)
Suit, S.M., Youssef, H., Barada, H.R., Al-Yamani, A.: A Parallel Tabu Search Algorithm for VLSI standard-cell placement. In: Proceedings of The 2000 IEEE International Symposium on Circuits and Systems (ISCAS 2000), Geneva, vol. 2, pp. 581–584 (2000)
Manikas, T.W., Mickle, M.H.: A genetic Algorithm for Mixed Macro and Standard Cell Placement. Circuits and Systems 2, 4–7 (2002)
Shahookar, K., Mazumder, P.: GASP-a Genetic Algorithm for Standard Cell Placement. In: Proceedings of the European Design Automation Conference EDAC 1990, pp. 660–664 (1990)
Grover, L.K.: A New Simulated Annealing Algorithm for Standard Cell Placement. In: Proc International Conference on CAD, pp. 378–380 (1986)
Esbensen, H., Mazumder, P.: SAGA: A Unification of The Genetic Algorithm with Simulated Annealing and Its Application to Macro-cell placement. In: Proceedings of the Seventh International Conference on VLSI Design, pp. 211–214 (1994)
Yao, B., Hou, W., Hong, X., Cai, Y.: FAME: A Fast Detailed Placement Algorithm for Standard Cell Layout Based on Mixed Min-cut and Enumeration. Chinese Journal of Semiconductors 21(8), 744–753 (2000)
Nan, G., Li, M., Lin, D., Kou, J.: Adaptive Simulated Annealing for Standard Cell Placement. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 943–947. Springer, Heidelberg (2005)
Areibi, S.: The Effect of Clustering and Local Search on Genetic Algorithms. In: Recent Advances In Soft Computing, Leicester, UK, pp. 172–177 (1999)
Kim, C.K., Moon, B.R.: Dynamic Embedding for Genetic VLSI Circuit Partitioning. Engineering Applications of Artificial Intelligence, 67–76 (1998)
Moon, B.R., Lee, Y.S., Kim, C.K.: GEORG: VLSI Circuit Partitioner with a New Genetic Algorithm Framework. Journal of Intelligent Manufacturing 9, 401–412 (1998)
Nan, G., Li, M., Kou, J.: Two Novel Encoding Strategies Based Genetic Algorithms for Circuit Partitioning. In: Proceedings of 2004 International Conference on Machine Learning and Cybernetics, pp. 2182–2188 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nan, G., Li, M., Shi, W., Kou, J. (2006). An Improved Genetic Algorithm for Cell Placement. In: Huang, DS., Li, K., Irwin, G.W. (eds) Intelligent Computing. ICIC 2006. Lecture Notes in Computer Science, vol 4113. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11816157_65
Download citation
DOI: https://doi.org/10.1007/11816157_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-37271-4
Online ISBN: 978-3-540-37273-8
eBook Packages: Computer ScienceComputer Science (R0)