Premium
Performance‐driven placement procedure for low power
Author(s) -
Yoshikawa Masaya,
Terai Hidekazu
Publication year - 2005
Publication title -
electrical engineering in japan
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.136
H-Index - 28
eISSN - 1520-6416
pISSN - 0424-7760
DOI - 10.1002/eej.20057
Subject(s) - interconnection , power consumption , computer science , network congestion , power (physics) , path (computing) , genetic algorithm , electronic engineering , engineering , computer network , physics , quantum mechanics , machine learning , network packet
Deep‐Sub‐Micron (DSM) technologies of 0.18 μm and below enable the integration of logical circuits having more than 10 million gates. In such a DSM technology, it is important to consider reducing power consumption, improving interconnection delay, and dispersing wire congestion at the initial phase of layout design. In this paper, we proposed a novel performance‐driven placement algorithm. The proposed algorithm based on Genetic Algorithm (GA) has a two‐level hierarchical structure. For selection control, new objective functions are introduced for reducing power consumption, improving interconnection delay, and dispersing wire congestion. Studies on floor planning and cell placement have been reported as being applications of GA to the LSI layout problem. However, no studies have ever seen the effect of applying GA with consideration of power, delay, and congestion. Results show improvement of 11.7% for the total wire length of the nets with high SW rate, 22.5% for the worst path delay, and 15.9% for wire congestion on average. © 2005 Wiley Periodicals, Inc. Electr Eng Jpn, 151(1): 56–65, 2005; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20057