Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Electrical Engineering and Computer Science / 電機資訊學院
  3. Electronics Engineering / 電子工程學研究所
  4. A Detailed Placement Algorithm for Large-Scale VLSI Circuits
 
  • Details

A Detailed Placement Algorithm for Large-Scale VLSI Circuits

Date Issued
2006
Date
2006
Author(s)
Hsu, Tien-Chang
DOI
en-US
URI
http://ntur.lib.ntu.edu.tw//handle/246246/57386
Abstract
A modern circuit placement algorithm consists of three steps: global placement, legalization, and detailed placement. Global placement finds rough positions of the circuit blocks, legalization removes the overlaps, and detailed placement refines the result. Modern high-performance IC designs integrate millions of blocks in a single chip. Traditional detailed placement methods consider only local cells and thus cannot handle modern large-scale designs well. It is therefore desirable to develop a better detailed placement algorithm with a more global view. Most detailed placement algorithms focus on the wirelength reduction, but the density control in the placement step becomes more important due to the increasing white space in modern designs for further performance optimization. We present a detailed placement algorithm that can minimize the wirelength and preserve the density controlled by the global placement. We adopt three major techniques in our detailed placement algorithm: (1) a cell matching technique to rearrange a group of cells simultaneously, (2) a window sweeping method to enhance the window-based local refinement by perturbing the window size and sweep direction, and (3) a cell sliding technique to gradually slide cells out of density overflow regions. Experimental results show that our algorithm achieves high-quality placement results. For the new cost metric which considers the wirelength and density constraints, our algorithm is 4.9% and 6.7% better than the state-of-the-art results from the APlace 2.0 and FastPlace 2.0, respectively. Our resulting HPWL is still 0.3% and 0.7% shorter than the above detailed placers. The results show that our algorithm can preserve the density controlled by the global placement and our wirelength improvement is still quite competitive with other state-of-the-art detailed placers.
Subjects
擺置
細部擺置
placement
detailed placement
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-95-R93943030-1.pdf

Size

23.31 KB

Format

Adobe PDF

Checksum

(MD5):9426c630f282027822e5a58f0a201210

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science