(3.238.130.97) 您好！臺灣時間：2021/05/14 19:51

### 詳目顯示:::

:

• 被引用:0
• 點閱:93
• 評分:
• 下載:0
• 書目收藏:0
 最近Young and Wong擴充以模擬退火法(Simulated-Annealing) 為基礎的Wong-Liu演算法(algorithm)來解決”具邊界限制之切開式(slicing)定形配置設計”的問題，Young-Wong演算法的主要概念，是藉由對正規化Polish表示式(normalized Polish expression)從右至左檢視一次，來決定在一個佈局(floorplan)裡所有模組(module)的邊界資訊(boundary information)。在仔細觀察Young-Wong演算法中用來產生新正規化Polish表示式的三種搬動(move)方式後，我們發現在新的正規化Polish表示式裡，極有可能只有一小部分模組的邊界資訊會改變，因此也只有這些模組的邊界資訊需要重新計算。針對此項發現，我們在這篇論文裡提出一些加快計算邊界資訊的新方法來改進Young-Wong演算法。理論的分析和實驗的結果都顯示我們的演算法能在較短的執行時間內產生和Young-Wong演算法完全相同的定形配置解。
 Recently Young and Wong extended the well-known simulated annealing based Wong-Liu algorithm [6] to solve the problem of slicing floorplan design with boundary constraints. The main idea behind the Young-Wong algorithm [10] is to determine the boundary information of each module in a floorplan by traversing the corresponding normalized Polish expression from right to left once. By having carefully examined each of the three types of moves adopted by the Young-Wong algorithm for generating a new normalized Polish expression, we observe that it is very likely that only a fraction of modules might have their boundary information changed in the new normalized Polish expression, and hence only the boundary information for those modules needs to be re-computed. Based on the observation, we improve the Young-Wong algorithm by providing methods to accelerate the boundary information computation in this thesis. Both the theoretical analysis and experimental results indicate that our algorithm packs the modules as tightly as the Young-Wong algorithm but takes less run time.
 摘要_________________________________________________I Abstract_____________________________________________II 第一章 緒論__________________________________________V 第二章 問題描述與回顧________________________________VI 第三章 改進的演算法__________________________________VII 第四章 實驗結果______________________________________VIII 第五章 結論__________________________________________IX 英文附錄_____________________________________________X
 [1]W. Dai and E. S. Kuh, “Simultaneous Floor Planning and Global Routing for Hierarchical Building-Block Layout,” IEEE Trans. on CAD, 1987, pp. 828-837.[2]H. Murata and E. S. Kuh, “Sequence-Pair Based Placement Method for Hard/Soft/Pre-Placed Modules,” Proc. International symposium on Physical Design, 1998, 167-172.[3]R. H. J. M. Otten, “Automatic Floorplan Design,” Proc. Design Automation Conference, 1982, pp. 261-267.[4]R. H. J. M. Otten, “Efficient Floorplan Optimization,” Proc. International Conference on Computer Design, 1983, pp. 499-502.[5]L. Stockmeyer, “Optimal Orientations of Cells in Slicing Floorplan Designs,” Information and Control, 1983, pp. 91-101.[6]D. F. Wong and C. L. Liu, “A New Algorithm for Floorplan Design,” Proc. Design Automation Conference, 1986, pp. 101-107.[7]D. F. Wong and K. The, “An Algorithm for Hierarchical Floorplan Design,” Proc. International Conference on Computer-Aided Design, 1989, pp. 484-487.[8]F. Y. Young and D. F. Wong, “Slicing Floorplans with Pre-Placed Modules,” Proc. International Conference on Computer-Aided Design, 1998, pp. 252-258.[9]F. Y. Young and D. F. Wong, “Slicing Floorplans with Range Constraint”, Proc. International Symposium on Physical Design, 1999, pp. 97-102.[10] F. Y. Young and D. F. Wong, “Slicing Floorplans with Boundary Constraint,” Proc. ASP-DAC, 1999, pp. 17-20.
 國圖紙本論文
 推文當script無法執行時可按︰推文 網路書籤當script無法執行時可按︰網路書籤 推薦當script無法執行時可按︰推薦 評分當script無法執行時可按︰評分 引用網址當script無法執行時可按︰引用網址 轉寄當script無法執行時可按︰轉寄

 無相關論文

 1 21. 榮泰生，「控制的功能」，自動化科技，民國85年6月，第144期，pp36－42。 2 7. 李田樹，「如何授權而不失控」，世界經理文摘，民國84年10月，第110期，pp54－61。 3 28. 戴欽松，「談管理的控制功能」，今日會計，民國79年12月，第45期，pp18－32。

 1 以角色為主之權限控管系統中階層式情境角色之研究 2 低功率導向之超大型積體電路分割與擺置方法 3 考量環境因素下入侵偵測系統效能評估基準之建立 4 支援弱點稽核與入侵偵測之整合性後端資料庫設計研究 5 人力資源網站知識管理與e面談之探討 6 容積同材質不同物件表面重建法的探討 7 以概念圖作為合作學習分組策略之研究 8 超大型積體電路佈局之電力線繞線方法 9 以二級結構輔助蛋白質功能預測及分析 10 於光跡追蹤法中改良區塊航行演算法之研究 11 入侵偵測系統快速原型架構 12 語音辨認應用於PDA之作業控制研究 13 使用動態加鎖及節點複製技巧改進具複雜資源限制之二重最小切電路分割 14 一個將小學加減法與網路遊戲結合的CAL環境 15 調適性網路模糊推論於水下聲源訊號辨識系統之研究

 簡易查詢 | 進階查詢 | 熱門排行 | 我的研究室