By Topic

Building block layout by parallel simulated annealing algorithms

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

4 Author(s)
Qinglang Luo ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Xianlong Hong ; Sheqin Dong ; Qiang Zhou

The building block layout (BBL) becomes a more and more important approach for VLSI physical design. In this paper, based on the BBL floorplan problem, we discussed several parallel simulated annealing (SA) strategies. Two parallel simulated annealing algorithms are realized, using sequence-pair (SP) as the representation. The parallel algorithm can be used either to speed up a problem or to achieve a higher accuracy of solutions to a problem. In this work we are interested in the latter goal. The results from the experiment indicate that the proposed method parallelizes the routine of state transitions in SA to obtain better states efficiently.

Published in:

Communications, Circuits and Systems, 2004. ICCCAS 2004. 2004 International Conference on  (Volume:2 )

Date of Conference:

27-29 June 2004