A survey on B*-Tree-based evolutionary algorithms for VLSI floorplanning optimisation Online publication date: Wed, 18-Dec-2013
by D. Gracia Nirmala Rani; S. Rajaram
International Journal of Computer Applications in Technology (IJCAT), Vol. 48, No. 4, 2013
Abstract: In the unpredictable recent developments in the application of VLSI technology, CAD tools are important for bringing high system performance. The VLSI floorplanning problem aims to arrange a set of modules on a rectangular chip area so as to optimise an appropriate measure of performance. There are two factors in general when dealing with the floorplanning problem. The first one is to find an appropriate topological representation in the form of a data structure. The second aspect considers the application of a stochastic search method on the representation to find an optimised floorplan. Current VLSI floorplanners must include multiple metrics in their objective function such as area, wire length and temperature parameters. Hence an optimisation engine is necessary for the floorplanning problem that can handle multiple metrics. In this paper, we present a review/tutorial of the optimisation techniques based on B*-Tree representation in VLSI floorplanning that have been recently proposed.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook