By Topic

A parallel algorithm for 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
$33 $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)
E. I. Horvath ; Dept. of Comput. Eng., Florida Atlantic Univ., Boca Raton, FL, USA ; R. Shankar ; A. S. Pandya

Summary form only given. The placement problem is an important issue in the design process of VLSI chips. It is necessary to have an optimum placement so that all electrical connections between cells are routed in a minimum area without violating any physical constraints. The ALOPEX algorithm can easily be implemented in a hierarchical SIMD parallel processing architecture. It requires simple processing elements which do not need to be fully interconnected to implement the algorithm. The ALOPEX algorithm has been shown, through computer simulations, to be applicable to solving the traveling salesman problem. Since the placement problem is similar to the traveling salesman problem, a method of applying the ALOPEX algorithm has been developed for the placement problem, and computer simulations have been performed

Published in:

Neural Networks, 1991., IJCNN-91-Seattle International Joint Conference on  (Volume:ii )

Date of Conference:

8-14 Jul 1991