2002
DOI: 10.1109/tevc.2002.802872
|View full text |Cite
|
Sign up to set email alerts
|

VLSI placement and area optimization using a genetic algorithm to breed normalized postfix expressions

Abstract: We present a genetic algorithm (GA) that uses a slicing tree construction process for the placement and area optimization of soft modules in very large scale integration floorplan design. We have overcome the serious representational problems usually associated with encoding slicing floorplans into GAs, and have obtained excellent (often optimal) results for module sets with up to 100 rectangles. The slicing tree construction process used by our GA to generate the floorplans has a run-time scaling of O(n lg n)… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0

Year Published

2003
2003
2013
2013

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 65 publications
(25 citation statements)
references
References 18 publications
(41 reference statements)
0
25
0
Order By: Relevance
“…Consequently, practically every known heuristic scheme, including cluster development (Areibi and Yang 2004;Hanan and Kurtzberg 1972a;Hanan et al 1976a;Magnuson 1977;Cox and Carroll 1980), knowledge based systems (Pannérec 2003), randomized local search algorithms such as simulated annealing (Sechen and Sangiovanni-Vincentelli 1986;Sechen 1988;Wong et al 1988;Wang et al 2000;Murata et al 1998), and genetic algorithms (Cohoon and Paris 1987;Shahookar and Mazumder 1990;Valenzuela and Wang 2002;Sait et al 2005;Areibi and Yang 2004), as well as combinations of these approaches (Zhang et al 2005) have been used to compute placements. Often, computed placements are improved by iterative heuristics based on component interchange (Magnuson 1977;Coté and Patel 1980).…”
Section: Placement Methodsmentioning
confidence: 99%
“…Consequently, practically every known heuristic scheme, including cluster development (Areibi and Yang 2004;Hanan and Kurtzberg 1972a;Hanan et al 1976a;Magnuson 1977;Cox and Carroll 1980), knowledge based systems (Pannérec 2003), randomized local search algorithms such as simulated annealing (Sechen and Sangiovanni-Vincentelli 1986;Sechen 1988;Wong et al 1988;Wang et al 2000;Murata et al 1998), and genetic algorithms (Cohoon and Paris 1987;Shahookar and Mazumder 1990;Valenzuela and Wang 2002;Sait et al 2005;Areibi and Yang 2004), as well as combinations of these approaches (Zhang et al 2005) have been used to compute placements. Often, computed placements are improved by iterative heuristics based on component interchange (Magnuson 1977;Coté and Patel 1980).…”
Section: Placement Methodsmentioning
confidence: 99%
“…We can obtain a polish expression of length 2n -1 with n modules in the slicing floorplan by traversing the slicing tree. The postfix expression is derived by carrying out a post order traversal [7,8] .…”
Section: Techniques Of Floor Planningmentioning
confidence: 99%
“…Techniques based on evolutionary methods have been shown to be effective in searching large search spaces with complex objective functions in an efficient manner [130,131]. Furthermore, these techniques are inherently capable of performing multipoint searches.…”
Section: Motivationmentioning
confidence: 99%
“…EAs have been shown to be effective in efficiently exploring large search spaces [130,131]. In particular, we have employed SPEA2 [160], which is very effective in sampling from along an entire Pareto-optimal front and distributing the solutions generated relatively evenly over the optimal tradeoff surface.…”
Section: Search Algorithmsmentioning
confidence: 99%