Standard Cell LSI Gate Arrangement Using the Island Elite Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
The Optimization of Flywheels using an Injection Island Genetic Algorithm
New optimization problems arise every day -for instance, what is the quickest path to work? Where and how congested is the road construction? Am I better off riding my bike? If so, what is the shortest path? Sometimes these problems are easily solved, but many engineering problems cannot be handled satisfactorily using traditional optimization methods. Engineering involves a wide class of probl...
متن کاملAutomated Standard Cell Synthesis using Genetic Algorithms
We have demonstrated the possibility of applying a modified genetic algorithm (GADO) to completely automate the design of a cell given only a behavioral description and optimization criteria such as power, area, speed or their combination. GADO maintains a population of potential standard cell designs. The designs are evaluated by (1) internal rules (2) MAGIC for design rule checks and (3) SPIC...
متن کاملA Genetic Algorithm for Mixed Macro and Standard Cell Placement
The objective of mixed macro and standard cell placement is to arrange components on a chip such that the resultant layout area and interconnection wire lengths are minimal. A common approach is to divide the problem into separate macro cell and standard cell placement problems. However, this approach ignores the relationships between the macro and standard cells, which can affect the quality o...
متن کاملTiming Driven Genetic Algorithm for Standard-cell Placement
In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. A t early generations, the search is biased toward solutions with superior tarning characteristics. As the algorithm starts converging toward generations with acceptable de lay properties, the objective is dynamically adjusted toward optimizing area and routability....
متن کاملA Hybrid Genetic Algorithm for the Minimum Linear Arrangement Problem
This paper presents a hybrid genetic algorithm for the minimum linear arrangement problem. The algorithm was tested on a collection of 22 sparse graphs that has been used to test twelve other algorithms for the minimum linear arrangement problem. The graphs have up to 10,240 vertices and up to 49,820 edges. On about 2/3 of the graphs, our algorithm found solutions superior to all other algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2000
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.120.11_1547