By Topic

Parallel algorithms for slicing based final 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

2 Author(s)
H. Spruth ; Inst. of Electron. Design Autom., Tech. Univ. of Munich, Germany ; G. Sigl

The authors present parallel algorithms for solving the final placement problem of rectangular modules assuming predefined neighborhood relations, between the modules to be placed. By enumerating all arrangements (i.e. slicing structures) of local module subsets, optimum solutions are obtained. They are combined in a global evaluation step such that the local solutions fit well into the global arrangement. Increased size of the enumerated local subproblems leads to placements that are closer to a global optimum. The resulting higher computational demands can be met by using parallel computers that provide huge amounts of computing power and distributed memory. New algorithms are proposed for the enumeration on message-passing parallel computers. Experimental results show that significant speedups as well as better results can be achieved

Published in:

Design Automation Conference, 1992., EURO-VHDL '92, EURO-DAC '92. European

Date of Conference:

7-10 Sep 1992