Patent US6434704B1 successfully refreshed from Google Patents.
US6434704B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Methods for improving the efficiency of clock gating within low power clock trees
Assignee: GlobalFoundries Inc
•
Filing: 1999-08-16
•
Granted: 2002-08-13
•
Expires: 2019-08-16
Abstract
Abstract Methods are provided for improving the efficiency of clock gating within low power clock trees. In a first aspect, a correlation level between a plurality of clock gating signals and their corresponding gates which gate a source clock is determined. The clock gating signals and their corresponding gates are combined into a single clock gating signal and a single corresponding gate if a preselected level of correlation exists therebetween. In a second aspect, an area overlap is determined for a plurality of sinks, and one of the gated drovers of the sinks is removed. The sinks of the removed gated driver then are connected to a remaining gated driver driven by a single clock gating signal and a single corresponding gate. In a third aspect, physically proximate sink clusters are rewired to generate a pure clock gating group within each sink cluster if rewiring the clusters increases wiring length by less than a predetermined amount. In a fourth aspect, a clock gating group is selected and the power dissipation is computed for all sinks within the selected group assuming all the sinks therein are wired without clock gating. The power dissipation also is computed assuming all the sinks therein are gated. If the power dissipation for all sinks within the selected group is reduced by individually wiring the sinks therein, the group is ungated. A computer program product also is provided having a computer readable medium with means for performing the first, second, third and/or fourth aspects of the invention.
Inventors
- 👤 Alvar Dean
- 👤 David C. Garrett
- 👤 Mircea Stan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-29 10:27
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F1/00; G06F1/04; G06F1/10
Claims Analysis
Total Claims: 32
Claim 1
Independent Claim
72 words
A method for reducing power consumption in a clocked network, the method comprising: determining a correlation level between a plurality of clock gating signals and their corresponding gates which gate a source clock; and combining into a single clock gating signal and a single corresponding gate said plurality of clock gating signals and their corresponding gates only if a preselected level of correlation between them has been determined by the determining step.
Claim 2
Independent Claim
72 words
A method for reducing power consumption in a clocked network, the method comprising: determining a correlation level between a plurality of clock gating signals and their corresponding gates which gate a source clock; and combining into a single clock gating signal and a single corresponding gate said plurality of clock gating signals and their corresponding gates only if a preselected level of correlation between them has been determined by the determining step.
Claim 3
Dependent Claim
31 words
The method of claim 1 wherein determining a correlation level between a plurality of clock gating signals comprises determining a percentage of time the plurality of clock gating signals are identical.
Claim 4
Dependent Claim
48 words
The method of claim 1 further comprising determining a level of usefulness of said plurality of clock gating signals and their corresponding gates, including ungating the clock source by removing at least one of said corresponding gates only if a preselected low level of usefulness has been determined.
Claim 5
Dependent Claim
61 words
The method of claim 3 wherein determining a level of usefulness of said plurality of clock gating signals comprises: determining an activity ratio for each clock gating signal; determining a latch percentage for each clock gating signal; and computing a usefulness ratio for each clock gating signal based on the activity ratio and the latch percentage for the clock gating signal.
Claim 6
Dependent Claim
63 words
The method of claim 3 wherein determining a level of usefulness of said plurality of clock gating signals comprises: determining an average gating length for each clock gating signal; determining a latch percentage for each clock gating signal; and computing a usefulness ratio for each clock gating signal based on the average gating length and the latch percentage for the clock gating signal.
Claim 7
Dependent Claim
92 words
The method of claim 1 further comprising: determining an area overlap of a plurality of sinks each driven by one of at least two gated drivers which, in turn, are driven by at least a portion of said plurality of clock “driven” gating signals and their corresponding gates, including removing one of the gated drivers and connecting its sinks to another one of said at least two gated drivers; and said another one of said at least two gated drivers driven by said single clock gating signal and the single corresponding gate.
Claim 8
Dependent Claim
55 words
The method of claim 1 further comprising: identifying the location of sinks and sink clusters within the clock network; examining physically proximate sink clusters for common sinks; and re-wiring physically proximate sink clusters to generate a pure clock gating group within each sink cluster if re-wiring increases wiring length by less than a predetermined amount.
Claim 9
Dependent Claim
94 words
The method of claim 1 further comprising: (a) selecting a clock gating group of the clock network; (b) computing a power dissipation for all sinks within the selected clock gating group assuming all the sinks therein are wired without clock gating; (c) computing a power dissipation for all sinks within the selected clock gating group assuming all the sinks therein are gated; and (d) ungating the clock gating group if the power dissipation for all sinks within the selected clock gating group is reduced by individually wiring the sinks within the clock gating group.
Claim 10
Dependent Claim
18 words
The method of claim 8 further comprising repeating (a)-(d) for each clock gating group within the clock network.
Claim 11
Dependent Claim
33 words
The method of claim 8 wherein selecting a clock gating group comprises defining a minimum enclosing rectangle around all members of the clock gating group within a physical plane of the clock network.
Claim 12
Dependent Claim
40 words
The method of claim 10 wherein computing power dissipation for all sinks within the selected clock gating group with and without clock gating comprises computing power dissipation for all sinks within the minimum enclosing rectangle with and without clock gating.
Claim 13
Dependent Claim
19 words
The method of claim 8 wherein ungating the clock gating group comprises partitioning the clock gating group into subgroups.
Claim 14
Dependent Claim
38 words
The method of claim 12 further comprising: analyzing a power dissipation for each subgroup with and without clock gating; and partitioning each subgroup if the power dissipation for the subgroup is reduced by individually wiring each sink therein.
Claim 15
Independent Claim
70 words
A method for reducing power consumption in a clocked network, the method comprising: determining a proximity and domain relationship of a sink to a plurality of nearby gated buffers; and disconnecting the sink from its current gated buffer and connecting it to another gated buffer if the sink and said another gated buffer are in the same clock domain and the distance between them is less than a preselected distance.
Claim 16
Independent Claim
70 words
A method for reducing power consumption in a clocked network, the method comprising: determining a proximity and domain relationship of a sink to a plurality of nearby gated buffers; and disconnecting the sink from its current gated buffer and connecting it to another gated buffer if the sink and said another gated buffer are in the same clock domain and the distance between them is less than a preselected distance.
Claim 17
Dependent Claim
90 words
A computer program product for use in designing a clock network, the computer program product comprising: a medium readable by a computer, the computer readable medium having: means for determining a correlation level between a plurality of clock gating signals and their corresponding gates which gate a source clock; and means for combining into a single clock gating signal and a single corresponding gate said plurality of clock gating signals and their corresponding gates only if a preselected level of correlation between them has been determined by the determining step.
Claim 18
Dependent Claim
90 words
A computer program product for use in designing a clock network, the computer program product comprising: a medium readable by a computer, the computer readable medium having: means for determining a correlation level between a plurality of clock gating signals and their corresponding gates which gate a source clock; and means for combining into a single clock gating signal and a single corresponding gate said plurality of clock gating signals and their corresponding gates only if a preselected level of correlation between them has been determined by the determining step.
Claim 19
Dependent Claim
38 words
The computer program product of claim 15 wherein the means for determining a correlation level between a plurality of clock gating signals comprises means for determining a percentage of time the plurality of clock gating signals are identical.
Claim 20
Dependent Claim
54 words
The computer program product of claim 15 further comprising means for determining a level of usefulness of said plurality of clock gating signals and their corresponding gates, including means for ungating the clock source by removing at least one of said corresponding gates only if a preselected low level of usefulness has been determined.
Claim 21
Dependent Claim
72 words
The computer program product of claim 17 wherein the means for determining a level of usefulness of said plurality of clock gating signals comprises: means for determining an activity ratio for each clock gating signal; means for determining a latch percentage for each clock gating signal; and means for computing a usefulness ratio for each clock gating signal based on the activity ratio and the latch percentage for the clock gating signal.
Claim 22
Dependent Claim
74 words
The computer program product of claim 17 wherein the means for determining a level of usefulness of said plurality of clock gating signals comprises: means for determining an average gating length for each clock gating signal; means for determining a latch percentage for each clock gating signal; and means for computing a usefulness ratio for each clock gating signal based on the average gating length and the latch percentage for the clock gating signal.
Claim 23
Dependent Claim
99 words
The computer program product of claim 15 further comprising means for determining an area overlap of a plurality of sinks each driven by one of at least two gated drivers which, in turn, are driven by at least a portion of said plurality of clock “driven” gating signals and their corresponding gates, including means for removing one of the gated drivers and for connecting its sinks to another one of said at least two gated drivers; and said another one of said at least two gated drivers driven by said single clock gating signal and the single corresponding gate.
Claim 24
Dependent Claim
63 words
The computer program product of claim 15 further comprising: means for identifying the location of sinks and sink clusters within the clock network; means for examining physically proximate sink clusters for common sinks; and means for re-wiring physically proximate sink clusters to generate a pure clock gating group within each sink cluster if re-wiring increases wiring length by less than a predetermined amount.
Claim 25
Dependent Claim
98 words
The computer program product of claim 15 further comprising means for: (a) selecting a clock gating group of the clock network; (b) computing a power dissipation for all sinks within the selected clock gating group assuming all the sinks therein are wired without clock gating; (c) computing a power dissipation for all sinks within the selected clock gating group assuming all the sinks therein are gated; and (d) ungating the clock gating group if the power dissipation for all sinks within the selected clock gating group is reduced by individually wiring the sinks within the clock gating group.
Claim 26
Dependent Claim
22 words
The computer program product of claim 22 further comprising means for repeating (a)-(d) for each clock gating group within the clock network.
Claim 27
Dependent Claim
40 words
The computer program product of claim 22 wherein the means for selecting a clock gating group comprises means for defining a minimum enclosing rectangle around all members of the clock gating group within a physical plane of the clock network.
Claim 28
Dependent Claim
47 words
The computer program product of claim 24 wherein the means for computing power dissipation for all sinks within the selected clock gating group with and without clock gating comprises means for computing power dissipation for all sinks within the minimum enclosing rectangle with and without clock gating.
Claim 29
Dependent Claim
26 words
The computer program product of claim 22 wherein the means for ungating the clock gating group comprises means for partitioning the clock gating group into subgroups.
Claim 30
Dependent Claim
44 words
The computer program product of claim 26 further comprising: means for analyzing a power dissipation for each subgroup with and without clock gating; and means for partitioning each subgroup if the power dissipation for the subgroup is reduced by individually wiring each sink therein.
Claim 31
Dependent Claim
92 words
A computer program product for use in designing a clock network, the computer program product comprising: a medium readable by a computer, the computer readable medium having: means for determining a proximity and domain relationship of a sink to a plurality of nearby gated buffers of the clock network; and means for disconnecting the sink from its current gated buffer and connecting it to another gated buffer if the sink and said another gated buffer are in the same clock domain and the distance between them is less than a preselected distance.
Claim 32
Dependent Claim
92 words
A computer program product for use in designing a clock network, the computer program product comprising: a medium readable by a computer, the computer readable medium having: means for determining a proximity and domain relationship of a sink to a plurality of nearby gated buffers of the clock network; and means for disconnecting the sink from its current gated buffer and connecting it to another gated buffer if the sink and said another gated buffer are in the same clock domain and the distance between them is less than a preselected distance.
References Cited (Backward Citations)
US4615005A
Cited
US5452239A
Cited
US5615376A
Cited
US5715172A
Cited
US5701441A
Cited
US5801955A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2005-08-12 | 2006-02-11 | 2006-08-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2009-08-12 | 2010-02-11 | 2010-08-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2013-08-12 | 2014-02-11 | 2014-08-13 | $7700.00 | Window Closed / Lapsed |