南華大學機構典藏系統:Item 987654321/25075
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 18278/19583 (93%)
造訪人次 : 914108      線上人數 : 407
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧：
  • 您可在西文檢索詞彙前後加上"雙引號"，以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋，建議至進階搜尋限定作者欄位，可獲得較完整資料
    •  進階搜尋


    請使用永久網址來引用或連結此文件: http://nhuir.nhu.edu.tw/handle/987654321/25075


    題名: Rectilinear block placement using B*-trees
    作者: 吳光閔;張雲智;張耀文;Wu, Guang-Ming;Chang, Yun-Chih;Chang, Yao-Wen
    貢獻者: 資訊管理學系
    日期: 2003-04
    上傳時間: 2017-07-18 15:47:23 (UTC+8)
    摘要: Due to the layout complexity in modern VLSI designs, integrated circuit blocks may not be rectangular. However, literature on general rectilinear block placement is still quite limited. In this article, we present approaches for handling the placement for arbitrarily shaped rectilinear blocks using B*-trees [Chang et al. 2000]. We derive the feasibility conditions of B*-trees to guide the placement of rectilinear blocks. Experimental results show that our algorithm achieves optimal or near-optimal block placement for benchmarks with various shaped blocks.
    關聯: ACM Transactions on Design Automation of Electronic Systems (TODAES)
    vol. 8, no. 2
    pp.188-202
    顯示於類別:[資訊管理學系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    Rectilinear block placement.pdf87KbAdobe PDF559檢視/開啟


    在NHUIR中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋