By Topic

On the simplification of a placement problem

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

2 Author(s)
Hojat, S. ; Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA ; Kain, R.Y.

The authors consider the placement of heterogeneous modules to minimize the expected value of the distance required for an intermodule communication, where the expectation is taken with respect to a given matrix of intermodule communication probabilities. One way the placement problem could be simplified would be to select a `footprint' with the property that all modules of the optimum placement occupy locations in the footprint, and there are no vacancies within the footprint region. If such footprints were known, they could be precomputed for each system size and the optimization problem would be reduced to a search of placements meeting the footprint constraint. However, it is shown that a footprint does not exist for the placement problem with the objective of minimizing the expected communication distance

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:7 ,  Issue: 7 )