Académique Documents
Professionnel Documents
Culture Documents
4/9/2013
Outline
Introduction H-tree Zero skew clock DME and its extension New trends
4/9/2013
Introduction
For synchronized designs, data transfer between functional elements are synchronized by clock signals Clock signal are generated externally (e.g., by PLL) Clock period equation
4/9/2013
Clock Skew
Clock skew is the maximum difference in the arrival time of a clock signal at two different components. Clock skew forces designers to use a large time period between clock pulses. This makes the system slower. So, in addition to other objectives, clock skew should be minimized during clock routing.
4/9/2013
Power
very important, as clock is a major power consumer It switches at every clock cycle
Noise
Clock is often a very strong aggressor May need shielding
Delay
Not really important But slew rate is important (sharp transition)
4/9/2013
4/9/2013
Buffer insertion
Clock buffers to reduce clock skew, delay, and distortion in waveform.
Wire sizing
To further tune the clock tree/mesh
4/9/2013
Clock trees
A path from the clock source to clock sinks Clock Source
FF
FF
FF
FF
FF
FF
FF
FF
FF
FF
4/9/2013
Clock trees
A path from the clock source to clock sinks Clock Source
FF
FF
FF
FF
FF
FF
FF
FF
FF
FF
4/9/2013
H-tree Algorithm
Minimize skew by making interconnections to subunits equal in length
Regular pattern
4/9/2013
10
4/9/2013
11
4/9/2013
12
4/9/2013
13
4/9/2013
14
DME needs an abstract routing topology as the input It has a bottom-up phase followed by a top-down process
4/9/2013
15
Bottom Up Phase
Each node v has a merging segment ms(v). A merging segment is a Manhattan arc Manhattan arc: has slope +/- 1 or has zero length (could be a point). tiled rectangular region (TRR): The collection of points within a fixed distance from a Manhattan arc. The intersection of two TRRs is a TRR Merging segments are always Manhattan arcs
4/9/2013
16
4/9/2013
17
4/9/2013
18
DME Wrapup
[Boese and Kahng, ASIC92]
DME is guaranteed to find the minimum wire length with zero skew under the linear delay model Need to have an abstract routing graph to start with
4/9/2013
19
4/9/2013
20
Topology Generation
One common approach
Balanced and geometry guided Top down-partitioning that recursively divide the set of sinks, using alternating horizontal and vertical cuts The balance bipartition heuristic generates a topology that recursively divides the set of sinks into two subsets with equal total loading capacitance
4/9/2013
21
Trend
Clock skew scheduling together with clock tree synthesis
Schedule the timing slack of a circuit to the individual registers for optimal performance and as a second criteria to increase the robustness of the implementation w.r.t. process variation.
(P. Restle)
c
c c
22