Cart (Loading....) | Create Account
Close category search window

Parallel Genetic Algorithm for VLSI Standard Cell Placement

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Subbaraj, P. ; Kalasalingam Univ., Krishnankoil, India ; Sankar, S.S. ; Anand, S.

This work addresses the methods to solve VLSI standard cell placement problem with the objectives of minimizing the wire length and computational time. In this work a parallel GA architecture is designed and the computational time of Genetic algorithm is reduced by means of parallel technique. The proposed algorithms are tested in IBM bench mark circuits. Proposed method is compared with Qplace5.1.67,, Dragon 2.2.3 and Fastplace are found superior in terms of computational time and solution quality.

Published in:

Advances in Computing, Control, & Telecommunication Technologies, 2009. ACT '09. International Conference on

Date of Conference:

28-29 Dec. 2009

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.