DocumentCode
1517392
Title
Subtractive Router for Tree-Driven-Grid Clocks
Author
Qian, Haifeng ; Restle, Phillip J. ; Kozhaya, Joseph N. ; Gunion, Clifford L.
Author_Institution
IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA
Volume
31
Issue
6
fYear
2012
fDate
6/1/2012 12:00:00 AM
Firstpage
868
Lastpage
877
Abstract
A tree-driven clock grid has become the choice of clock delivery for most microprocessors, due to its ability to achieve lower skew and lower variability than clock trees, and is becoming the choice of clock delivery for certain high-end application-specific integrated circuit designs. This paper reports on a clock routing tool that was used in designing multiple tree-driven clock grids in a 2.3 GHz processor system-on-chip, which achieved below 5 ps skew within 500 μm Manhattan distance and below 10 ps skew across each clock grid. This clock routing tool employs a nonsequential algorithm comprised of linear programming and combinatorial heuristics. Its robust length-matching capability enables flexible buffer placement, improved clock signal quality, and robustness to variations.
Keywords
clock distribution networks; integrated circuit design; linear programming; microprocessor chips; network routing; system-on-chip; trees (mathematics); Manhattan distance; clock delivery; clock routing tool; clock signal quality; clock trees; combinatorial heuristics; flexible buffer placement; high-end application-specific integrated circuit designs; linear programming; microprocessors; multiple tree-driven clock grids; nonsequential algorithm; robust length-matching capability; subtractive router; system-on-chip; Clocks; Delay; Metals; Robustness; Routing; Wires; Wiring; Clock grid; clock tree; microprocessor; routing;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/TCAD.2012.2182767
Filename
6200441
Link To Document