Rectilinear block placement using B*-trees
Resource
ACM Transactions on Design Automation of Electronic Systems 8 (2): 188-202
Journal
ACM Transactions on Design Automation of Electronic Systems
Journal Volume
8
Journal Issue
2
Pages
188-202
Date Issued
2003
Author(s)
Abstract
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.
SDGs
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
16.pdf
Size
290.08 KB
Format
Adobe PDF
Checksum
(MD5):5e53d279131404030d0e7a3ec959e608