Rectilinear block placement using B*-trees

NHUIR > College of Science and Technology > Department of Information Management > Periodical Articles > Item 987654321/25075

Please use this identifier to cite or link to this item: http://nhuir.nhu.edu.tw/handle/987654321/25075

Title:	Rectilinear block placement using B*-trees
Authors:	吳光閔;張雲智;張耀文;Wu, Guang-Ming;Chang, Yun-Chih;Chang, Yao-Wen
Contributors:	資訊管理學系
Date:	2003-04
Issue Date:	2017-07-18 15:47:23 (UTC+8)
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.
Relation:	ACM Transactions on Design Automation of Electronic Systems (TODAES) vol. 8, no. 2 pp.188-202
Appears in Collections:	[Department of Information Management] Periodical Articles

Files in This Item:

File	Description	Size	Format
Rectilinear block placement.pdf		87Kb	Adobe PDF	561	View/Open