Rectilinear block placement using B-trees

Due to the layout complexity in deep sub-micron technology, integrated circuit blocks are often not rectangular. However, literature on general rectilinear block placement is still quite limited. In this paper, we present approaches for handling the placement for arbitrarily shaped rectilinear block...

Full description

Saved in:
Bibliographic Details
Main Authors: Guang-Ming Wu, Yun-Chih Chang, Yao-Wen Chang
Format: Conference Proceeding
Language:English
Subjects:
Algorithm design and analysis
Binary search trees
Binary trees
Circuits
Costs
Data structures
Ear
Genetic algorithms
Information science
Simulated annealing
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Due to the layout complexity in deep sub-micron technology, integrated circuit blocks are often not rectangular. However, literature on general rectilinear block placement is still quite limited. In this paper, we present approaches for handling the placement for arbitrarily shaped rectilinear blocks, based on a newly developed data structure called B*-trees. Experimental results show that our algorithm achieves optimal or near optimal block placement for benchmarks with multiple shaped blocks.
ISSN:1063-6404
2576-6996
DOI:10.1109/ICCD.2000.878307