| 1/2013 - 2 |
Ant System-Corner Insertion Sequence: An Efficient VLSI Hard Module PlacerHOO, C.-S.   , JEEVAN, K. , GANAPATHY, V. , RAMIAH, H. |
View the paper record and citations in  |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (565 KB) | Citation | Downloads: 1,191 | Views: 4,025 |
Author keywords
design, system, aided, floorplanning, VLSI, representation, circuits, algorithm, scale, optimization
References keywords
design(14), systems(12), floorplanning(12), vlsi(8), representation(6), circuits(6), algorithm(6), aided(6), scale(5), optimization(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2013-02-28
Volume 13, Issue 1, Year 2013, On page(s): 13 - 16
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2013.01002
Web of Science Accession Number: 000315768300002
SCOPUS ID: 84875343057
Abstract
Placement is important in VLSI physical design as it determines the time-to-market and chip's reliability. In this paper, a new floorplan representation which couples with Ant System, namely Corner Insertion Sequence (CIS) is proposed. Though CIS's search complexity is smaller than the state-of-the-art representation Corner Sequence (CS), CIS adopts a preset boundary on the placement and hence, leading to search bound similar to CS. This enables the previous unutilized corner edges to become viable. Also, the redundancy of CS representation is eliminated in CIS leads to a lower search complexity of CIS. Experimental results on Microelectronics Center of North Carolina (MCNC) hard block benchmark circuits show that the proposed algorithm performs comparably in terms of area yet at least two times faster than CS. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] J. M. Lin, Y. W. Chang, and S. P. Lin, "Corner sequence-A p-admissible floorplan representation with a worst case linear-time packing scheme," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 11, no. 4, pp. 8-12, 2003. [CrossRef] [Web of Science Times Cited 36] [SCOPUS Times Cited 43] [2] J. Liu, W. C. Zhong, L. C. Jiao, and X. Li, "Moving block sequence and organizational evolutionary algorithm for general floorplanning with arbitrarily shaped rectilinear blocks," IEEE Transactions on Evolutionary Computation, vol. 12, no. 5, pp. 630-646, 2008. [CrossRef] [Web of Science Times Cited 21] [SCOPUS Times Cited 32] [3] S. N. Adya, and I. L. Markov, "Fixed-outline floorplanning: enabling hierarchical design," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 11, no. 6, pp. 1120-1135, 2003. [CrossRef] [Web of Science Times Cited 227] [SCOPUS Times Cited 321] [4] J. Cong, M. Romesis, and J. R. Shinnerl, "Fast floorplanning by look-ahead enabled recursive bipartitioning," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 25, no. 9, pp. 1719-1732, 2006. [CrossRef] [Web of Science Times Cited 30] [SCOPUS Times Cited 37] [5] J. M. Lin, and Z. X. Hung, "UFO: Unified convex optimization algorithm for fixed-outline floorplanning considering pre-placed modules," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 30, no. 7, pp. 1034-1044, 2011. [CrossRef] [Web of Science Times Cited 13] [SCOPUS Times Cited 18] [6] Q. Ma, Z. Qian, E. F. Y. Young, and H. Zhou, "MSV-driven floorplanning," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 30, no. 8, pp. 1152-1162, 2011. [CrossRef] [Web of Science Times Cited 14] [SCOPUS Times Cited 21] [7] Y. C. Chen, and Y. Li, "Temperature-aware floorplanning via geometric programming," Mathematical and Computer Modelling, vol. 51, no. 7-8, pp. 927-934, 2010. [CrossRef] [Web of Science Times Cited 12] [SCOPUS Times Cited 14] [8] J. Cong, T. Kong, and D. Z. Pan, "Buffer block planning for interconnect-driven floorplanning," in Proceedings of IEEE/ACM International Conference on Computer-Aided Design, 1999, pp. 358-262. [CrossRef] [9] A. Jahanian, and M. S. Zamani, "Metro-on-chip: an efficient physical design technique for congestion reduction," IEICE Electronics Express, vol. 4, no. 16, pp. 510-516, 2007. [CrossRef] [Web of Science Times Cited 4] [SCOPUS Times Cited 4] [10] M. R. Garey, and D. S. Johnson, "Computers and intractability: A guide to the theory of NP-completeness", W. H. Freeman: San Francisco, 1979. [11] S. Sahni, and T. Gonzalez, "P-complete approximation problems," Journal of the ACM, vol. 23, no. 3, pp. 555-565, 1976. [CrossRef] [Web of Science Times Cited 969] [SCOPUS Times Cited 1225] [12] P. N. Guo, T. Takahashi, C. K. Cheng, and T. Yoshimura, "Floorplanning using a tree representation," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 20, no. 2, pp. 281-289, 2001. [CrossRef] [Web of Science Times Cited 60] [SCOPUS Times Cited 78] [13] Y. C. Chang, Y. W. Chang, G. M. Wu, and S. W. Wu, "B*-trees: A new representation for nonslicing floorplans," in Proceedings of Design Automation Conference, 2000, pp. 458-463. [CiteSeerX] [14] X. Hong, G. Huang, Y. Cai, S. Dong, C. K. Cheng, and J. Gu, "Corner block list representation and its application to floorplan optimization," IEEE Transactions on Circuits and Systems-II: Express Briefs, vol. 51, no. 5, pp. 228-233, 2004. [CrossRef] [Web of Science Times Cited 43] [SCOPUS Times Cited 49] [15] J. M. Lin, and Y. W. Chang, "TCG: A transitive closure graph-based representation for nonslicing floorplans," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 13, no. 2, pp. 288-292, 2005. [CrossRef] [Web of Science Times Cited 36] [SCOPUS Times Cited 43] [16] J. G. Kim, and Y. D. Kim, "A linear programming-based algorithm for floorplanning in VLSI design," IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 22, no. 5, pp. 584-592, 2003. [CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 42] [17] C. Luo, M. F. Anjos, and A. Vannelli, "Large-scale fixed-outline floorplanning design using convex optimization techniques," in Proceedings of Asia and South Pacific Design Automation Conference, 2008, pp. 198-203. [18] S. Alupoaei, and S. Katoori, "Ant Colony System application to macrocell overlap removal," IEEE Transactions on Very Large Scale Integration (VLSI) Systems, vol. 12, no. 10, pp. 1118-1123, 2004. [CrossRef] [Web of Science Times Cited 14] [SCOPUS Times Cited 28] [19] A. Colorni, M. Dorigo, and V. Maniezzo, "Distributed optimization by ant colonies," in European Conference on Artificial Intelligence, 1991, pp. 134-142. [20] C.-S. Hoo, H.-C. Yeo, K. Jeevan, V. Ganapathy, H. Ramiah, I.A. Badruddin, "Hierarchical Congregated Ant System for Bottom-up VLSI Placements," Engineering Applications of Artificial Intelligence, vol. 26, no. 1, pp. 584-602, 2013. [CrossRef] [Web of Science Times Cited 10] [SCOPUS Times Cited 12] [21] C. W. Chiang, Y. Q. Huang, and W. Y. Wang, "Ant colony optimization with parameter adaption for multi-mode resource-constrained project scheduling", Journal of Intelligent and Fuzzy Systems, vol. 19, no. 4,5, pp. 345-358, 2008. [22] J. Rabaey, Gigabyte systems research center 2005. [23] Y. Pang, C. K. Cheng, and T. Yoshimura, "An enhanced perturbing algorithm for floorplan design using the O-tree representation," in Proceedings of International Symposium on Physical Design, 2000, pp.168-173. [CrossRef] [SCOPUS Times Cited 62] [24] G. L. Chen, W. Z. Guo, and Y. Z. Chen, "A PSO-based intelligent decision algorithm for VLSI floorplanning," Soft Computing-A Fusion of Foundations, Methodologies and Applications, vol. 14, no. 12, pp. 1329-1337, 2009. [CrossRef] [Web of Science Times Cited 53] [SCOPUS Times Cited 73] [25] J. Chen, and J. Chen, "A hybrid evolution algorithm for VLSI floorplanning," International Conference on Computational Intelligence and Software Engineering, 2010, pp. 1-4. [CrossRef] [SCOPUS Times Cited 8] Web of Science® Citations for all references: 1,573 TCR SCOPUS® Citations for all references: 2,110 TCR Web of Science® Average Citations per reference: 61 ACR SCOPUS® Average Citations per reference: 81 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-04-19 12:47 in 122 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
