Home  |   Login  |   Logout  |   Access Information  |   Alerts  |   Purchase History  |   Cart  |   Sitemap  |   Help   
 
CrossRef Search
BROWSE SEARCH IEEE XPLORE GUIDE SUPPORT
You requested this document:
1. A Two-stage Incremental Floorplanning Algorithm with Boundary Constraints
Liu Yang; Sheqin Dong; Xianlong Hong; Yuchun Ma;
Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on
4-7 Dec. 2006 Page(s):792 - 795
Abstract:

In this paper, the authors we introduce a two-stage strategy to solve the incremental floorplanning problem with boundary constraints. Firstly, slack push graph (SPG) and module exchange graph (MEG) are built according to the original floorplan. SPG describes the dead spaces between any two adjacent modules and the slack push distance of each module; MEG records the modules which have the same size character. At the first stage, the algorithm aims at boundary constraint satisfaction using two graphs; at the second stage, the algorithm aims at more performance optimization by the aid of MEG. The experimental results of MCNC benchmarks show the effectiveness of our algorithm
Abstract | Full Text: PDF(4081 KB)    IEEE CNF
 
» Key
IEEE JNL IEEE Journal or Magazine
IEE JNL IEE Journal or Magazine
IEEE CNF IEEE Conference Proceeding
IEE CNF IEE Conference Proceeding
IEEE STD IEEE Standard
 
 
Indexed by IEE Inspec
© Copyright 2008 IEEE – All Rights Reserved