O-tree representation of non-slicing floorplan and its applications

Pei Ning Guo, Chung Kuan Cheng, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingChapter

307 Citations (Scopus)

Abstract

We present an ordered tree, O-tree, structure to represent non-slicing floorplans. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n! 2 2n-2/n 1.5). This is very concise compared to a sequence pair representation which has O((n!) 2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n 2 (n/4e) n). The complexity of O-tree is even smaller than a binary tree structure for slicing floorplan which has O(n! 2 5n-3/n 1.5) combinations. Given an O-tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O-tree. Empirical results on MCNC benchmarks show promising performance with average 16% improvement in wire length, and 1% less in dead space over previous CPU-intensive cluster refinement method.

Original languageEnglish
Title of host publicationProceedings - Design Automation Conference
PublisherIEEE
Pages268-273
Number of pages6
Publication statusPublished - 1999
Externally publishedYes
EventProceedings of the 1999 36th Annual Design Automation Conference (DAC) - New Orleans, LA, USA
Duration: 1999 Jun 211999 Jun 25

Other

OtherProceedings of the 1999 36th Annual Design Automation Conference (DAC)
CityNew Orleans, LA, USA
Period99/6/2199/6/25

Fingerprint

Binary trees
Program processors
Wire

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Cite this

Guo, P. N., Cheng, C. K., & Yoshimura, T. (1999). O-tree representation of non-slicing floorplan and its applications. In Proceedings - Design Automation Conference (pp. 268-273). IEEE.

O-tree representation of non-slicing floorplan and its applications. / Guo, Pei Ning; Cheng, Chung Kuan; Yoshimura, Takeshi.

Proceedings - Design Automation Conference. IEEE, 1999. p. 268-273.

Research output: Chapter in Book/Report/Conference proceedingChapter

Guo, PN, Cheng, CK & Yoshimura, T 1999, O-tree representation of non-slicing floorplan and its applications. in Proceedings - Design Automation Conference. IEEE, pp. 268-273, Proceedings of the 1999 36th Annual Design Automation Conference (DAC), New Orleans, LA, USA, 99/6/21.
Guo PN, Cheng CK, Yoshimura T. O-tree representation of non-slicing floorplan and its applications. In Proceedings - Design Automation Conference. IEEE. 1999. p. 268-273
Guo, Pei Ning ; Cheng, Chung Kuan ; Yoshimura, Takeshi. / O-tree representation of non-slicing floorplan and its applications. Proceedings - Design Automation Conference. IEEE, 1999. pp. 268-273
@inbook{d0e9339c7d0647138d85d8a63980620f,
title = "O-tree representation of non-slicing floorplan and its applications",
abstract = "We present an ordered tree, O-tree, structure to represent non-slicing floorplans. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n! 2 2n-2/n 1.5). This is very concise compared to a sequence pair representation which has O((n!) 2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n 2 (n/4e) n). The complexity of O-tree is even smaller than a binary tree structure for slicing floorplan which has O(n! 2 5n-3/n 1.5) combinations. Given an O-tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O-tree. Empirical results on MCNC benchmarks show promising performance with average 16{\%} improvement in wire length, and 1{\%} less in dead space over previous CPU-intensive cluster refinement method.",
author = "Guo, {Pei Ning} and Cheng, {Chung Kuan} and Takeshi Yoshimura",
year = "1999",
language = "English",
pages = "268--273",
booktitle = "Proceedings - Design Automation Conference",
publisher = "IEEE",

}

TY - CHAP

T1 - O-tree representation of non-slicing floorplan and its applications

AU - Guo, Pei Ning

AU - Cheng, Chung Kuan

AU - Yoshimura, Takeshi

PY - 1999

Y1 - 1999

N2 - We present an ordered tree, O-tree, structure to represent non-slicing floorplans. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n! 2 2n-2/n 1.5). This is very concise compared to a sequence pair representation which has O((n!) 2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n 2 (n/4e) n). The complexity of O-tree is even smaller than a binary tree structure for slicing floorplan which has O(n! 2 5n-3/n 1.5) combinations. Given an O-tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O-tree. Empirical results on MCNC benchmarks show promising performance with average 16% improvement in wire length, and 1% less in dead space over previous CPU-intensive cluster refinement method.

AB - We present an ordered tree, O-tree, structure to represent non-slicing floorplans. We define an admissible placement as a compacted placement in both x and y direction. For each admissible placement, we can find an O-tree representation. We show that the number of possible O-tree combinations is O(n! 2 2n-2/n 1.5). This is very concise compared to a sequence pair representation which has O((n!) 2) combinations. The approximate ratio of sequence pair and O-tree combinations is O(n 2 (n/4e) n). The complexity of O-tree is even smaller than a binary tree structure for slicing floorplan which has O(n! 2 5n-3/n 1.5) combinations. Given an O-tree, it takes only linear time to construct the placement and its constraint graph. We have developed a deterministic floorplanning algorithm utilizing the structure of O-tree. Empirical results on MCNC benchmarks show promising performance with average 16% improvement in wire length, and 1% less in dead space over previous CPU-intensive cluster refinement method.

UR - http://www.scopus.com/inward/record.url?scp=0032690067&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0032690067&partnerID=8YFLogxK

M3 - Chapter

SP - 268

EP - 273

BT - Proceedings - Design Automation Conference

PB - IEEE

ER -