Enhanced perturbing algorithm for floorplan design using the O-tree representation

Yingxin Pang, Chung Kuan Cheng, Takeshi Yoshimura

Research output: Chapter in Book/Report/Conference proceedingConference contribution

57 Citations (Scopus)

Abstract

Recently, a deterministic algorithm based on the O-tree representation has been proposed. This method generates excellent layout results on MCNC test cases with O(n3) complexity, where n is the number of blocks. In this paper, we reduce the complexity of the deterministic algorithm to O(n2). Experimental results indicate our algorithm maintains the high quality of the deterministic algorithm at a fraction of the CPU time.

Original languageEnglish
Title of host publicationProceedings of the International Symposium on Physical Design
Place of PublicationNew York, NY, United States
PublisherACM
Pages168-173
Number of pages6
Publication statusPublished - 2000
Externally publishedYes
EventISPD-2000: International Symposium on Physical Design - San Diego, CA, USA
Duration: 2000 Apr 92000 Apr 12

Other

OtherISPD-2000: International Symposium on Physical Design
CitySan Diego, CA, USA
Period00/4/900/4/12

ASJC Scopus subject areas

  • Engineering(all)

Fingerprint Dive into the research topics of 'Enhanced perturbing algorithm for floorplan design using the O-tree representation'. Together they form a unique fingerprint.

  • Cite this

    Pang, Y., Cheng, C. K., & Yoshimura, T. (2000). Enhanced perturbing algorithm for floorplan design using the O-tree representation. In Proceedings of the International Symposium on Physical Design (pp. 168-173). ACM.