An orthogonal simulated annealing algorithm for large floorplanning problems

檔案

日期

2004-08-01

類型

期刊名稱

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS

卷期與頁次

第 12 卷第 8 期,頁 874–876

ISSN

1063-8210

語言

英文

摘要

The conventional simulated annealing with some random generation mechanism using the sequence-pair topological representation in block placement and floorplanning is effective for a very small number of modules (40-50). This paper proposes an orthogonal simulated annealing algorithm (OSA) with an efficient generation mechanism (EGM) for solving large floorplanning problems. EGM samples a small number of representative floorplans and then efficiently derives a high-performance floorplan by using a systematic reasoning method for the next move of OSA based on orthogonal experimental design. Furthermore, an improved swap operation is proposed which cooperates with EGM to make OSA efficient. Excellent experimental results using the Microelectronics Center of North Carolina and the Gigascale Sysems Research Center benchmarks show that OSA performs better than existing methods for large floorplanning problems.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Ho, S., Ho, S., Lin, Y., & Chu, W. (2004). An orthogonal simulated annealing algorithm for large floorplanning problems. IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 12(8), 874–876. https://doi.org/10.1109/TVLSI.2004.831464

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/26555