By Topic

Module placement with pre-placed modules using the B*-tree 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
$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)
Yi-He Jiang ; Dept. of Inf. & Comput. Eng., Chung Yuan Christian Univ., Chung Li, Taiwan ; Jianbang Lai ; Ting-Chi Wang

In this paper, we study the problem of module placement with pre-placed modules, and present a novel method that extends the B*-tree representation to solve the problem. The method restricts each pre-placed module to be placed at its pre-specified location all the time and uses the B*-tree representation to generate the locations for the remaining modules. Re-positioning techniques are added into the method to eliminate any overlapping between modules. The method is incorporated into a simulated annealing process and its effectiveness is demonstrated by the experimental results

Published in:

Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on  (Volume:5 )

Date of Conference:

2001