By Topic

A parallel VLSI floorplanning algorithm using corner block list topological representation

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)
Liang Huang ; Dept. of Comput. Sci. & Technol., Tsinghua Univ., Beijing, China ; Yici Cai ; Xianlong Hong

Floorplanning is a critical phase in the physical design of VLSI circuits and has been acknowledged as a computation-intensive process. As a result, several research efforts have been undertaken to parallelize the algorithm. While previous work has been focused on slicing the floorplan, we present a parallel algorithm for a non-slicing floorplan using corner block list (CBL) topological representation. A parallel interconnection cost calculation algorithm with load balancing strategy is initiated in order to speed up the especially time consuming wire length calculation in floorplanning. A multiple Markov chains strategy is also embedded in our algorithm. The experimental results obtained from the tests on MCNC benchmarks indicate considerable speedup and preserved floorplanning quality.

Published in:

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

Date of Conference:

27-29 June 2004