Abstract
Floorplanning is one of the most important problems in VLSI physical design automation. A fundamental research problem in the VLSI floorplanning is representation because it determines the size of search space and the complexity of the transformation between a representation and its corresponding floorplan. O-tree representation is one of the most efficient floorplan representations as it has the smallest search space among all the admissible floorplan representations and the computational complexity of transformation between a representation and its corresponding floorplan is only O(n). The efficiency of O-tree representation was demonstrated by a deterministic algorithm proposed by Guo et al.. The deterministic algorithm can quickly find a reasonably good floorplan. However, the deterministic floorplanning algorithm, by its nature, is a local search algorithm, and thereby may not be able to find an optimal or near-optimal solution sometimes. This paper presents a genetic algorithm for the VLSI floorplanning problem using O-tree representation. Experimental results show that the GA can consistently produce better results than the deterministic algorithm.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Otten, R.H.J.M.: Automatic Floorplan Design. In: Proc. ACM/IEEE Design Automation Conference, pp. 261–267 (1982)
Guo, P.N., Takahashi, T., Cheng, C.-K., Yoshimura, T.: Floorplanning Using a Tree Representation. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 20, 281–289 (2001)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)
Cohoon, J.P., Hegde, S.U., Martin, W.N., Richards, D.S.: Distributed Genetic Algorithms for the Floorplan Design Problem. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 10, 483–492 (1991)
Rebaudengo, M., Reorda, M.S.: GALLO: A Genetic Algorithm for Floorplan Area Optimization. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 15, 943–951 (1996)
Tazawa, I., Koakutsu, S., Hirata, H.: An Immunity based Genetic Algorithm and Its Application to the VLSI Floorplan Design Problem. In: Proc. Int. Conf. on Evolutionary Computation, pp. 417–421 (1996)
Nakaya, S., Koide, T., Wakabayashi, S.: An Adaptive Genetic Algorithm for VLSI Floorplanning based on Sequence-Pair. In: Proc. IEEE Int. Symposium on Circuits and Systems, pp. 65–68 (2000)
Liu, C.-T., Chen, D.-S., Wang, Y.-W.: An Effienct Genetic Algorithm for Slicing Floorplan Area Optimization. In: Proc. IEEE Int. Symposium on Circuits and Systems, pp. 879–882 (2002)
Valenzuela, C.L., Wang, P.Y.: VLSI Placement and Area Optimization Using a Genetic Algorithm to Bread Normalized Postfix Expressions. IEEE Transactions on Evolutionary Computation 6, 390–401 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tang, M., Sebastian, A. (2005). A Genetic Algorithm for VLSI Floorplanning Using O-Tree Representation. In: Rothlauf, F., et al. Applications of Evolutionary Computing. EvoWorkshops 2005. Lecture Notes in Computer Science, vol 3449. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-32003-6_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-32003-6_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25396-9
Online ISBN: 978-3-540-32003-6
eBook Packages: Computer ScienceComputer Science (R0)