| Journal of Computer Science | |
| AN EFFICIENT CELL PLACEMENT USING GRAVITATIONAL SEARCH ALGORITHMS | Science Publications | |
| Rose Al Qasem1  Taisir Eldos1  | |
| 关键词: Cell Placement; VLSI Circuit; Optimization Algorithms; Gravitational Search; | |
| DOI : 10.3844/jcssp.2013.943.948 | |
| 学科分类:计算机科学(综合) | |
| 来源: Science Publications | |
PDF
|
|
【 摘 要 】
In modern chip design, cell placement is a stage in which cells representing well-defined functions are assigned physical locations, in a way that optimizes the total area and routing length. Cell placement is an NP-complete problem and the exact solution is generally far from reach for a practically sized instance. Hence, diversified heuristic algorithms are used to solve this problem. In this study, we adapted a recently introduced evolutionary search algorithm called Gravitational Search Algorithm (GSA) to this problem. Experiments show that the proposed algorithm delivers good performance; good solution quality and likelihood of optimality within reasonably small amount of time.
【 授权许可】
Unknown
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| RO201911300956841ZK.pdf | 102KB |
PDF