Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion

I-Min Liu, Tan-Li Chou, Adnan Aziz, D. F. Wong

Research output: Chapter in book/report/conference proceedingConference proceedingpeer-review

53 Citations (Scopus)

Abstract

We propose an integrated clock tree construction algorithm which performs simultaneous routing, wire sizing and buffer insertion. In existing approaches, wire sizing and clock buffer insertion are typically applied sequentially after a clock tree is generated and routed, i.e., they are done as post-processing steps. None of the known methods can perform clock routing while simultaneously considering wire sizing and buffer insertion. We introduce wire widths and levels of buffers inserted as variables in forming merging segments in the proposed Integrated Deferred-Merge Embedding (IDME) algorithm. As a result, more zero-skew merging locations are made possible and the clock trees generated are zero-skew by construction. Our experiments show that by taking the advantage offered by wire sizing, we are able to minimize phase delay as well as to reduce wire length and use less buffers.

Original languageEnglish
Title of host publicationISPD '00
Subtitle of host publicationProceedings of the 2000 International Symposium on Physical Design
PublisherAssociation for Computing Machinery (ACM)
Pages33-38
Number of pages6
ISBN (Print)9781581131918
DOIs
Publication statusPublished - May 2000
Event2000 International Symposium on Physical Design, ISPD 2000 - San Diego, United States
Duration: 9 Apr 200012 Apr 2000
https://dl.acm.org/doi/proceedings/10.1145/332357 (Conference proceedings )

Publication series

NameProceedings of the International Symposium on Physical Design, ISPD

Symposium

Symposium2000 International Symposium on Physical Design, ISPD 2000
Country/TerritoryUnited States
CitySan Diego
Period9/04/0012/04/00
Internet address

Scopus Subject Areas

  • Electrical and Electronic Engineering

Fingerprint

Dive into the research topics of 'Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion'. Together they form a unique fingerprint.

Cite this