US5798935A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for sizing buffers to provide minimal skew
Assignee: Sun Microsystems Inc
•
Filing: 1996-07-01
•
Granted: 1998-08-25
•
Expires: 2016-07-01
Abstract
Abstract Disclosed is a system for automatically generating tables of buffer data which can be used during integrated circuit design to select appropriate buffers for signal distribution networks. The generated buffer data may be used by automated place and route systems to generate signal distribution networks having minimal skew. In the table, incrementally varying network features or criteria are provided (in the form of a table or list for example). Examples of such features include the length of a line connecting an L4 buffer to one or more L5 buffers and the number of L5 buffers driven by a single L4 buffer. For each incremental value of the network feature or features, one or more buffer types is specified. These buffer types have been previously modeled in the environment of the incremental value of the network features and found to meet certain criteria necessary to minimize skew. If when designing a signal distribution network the designer (or design tool) chooses L4 buffers from the proper locations on the table, then skew should be minimized.
Inventors
- 👤 Manjunath Doreswamy
- 👤 Aleksandar Pance
- 👤 Yuan-Jung Lin
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-08 23:56
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/30; G06F30/39; G06F30/394
Claims Analysis
Total Claims: 33
Claim 1
Independent Claim
169 words
A method of generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the method comprising the following steps: providing a collection of buffer types available for placement at given locations within a first stage of the signal distribution network; providing a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; for said first stage of the signal distribution network, providing a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 2
Independent Claim
169 words
A method of generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the method comprising the following steps: providing a collection of buffer types available for placement at given locations within a first stage of the signal distribution network; providing a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; for said first stage of the signal distribution network, providing a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 3
Dependent Claim
15 words
The method of claim 1, wherein the signal distribution network is a clock distribution network.
Claim 4
Dependent Claim
19 words
The method of claim 2, wherein the step of providing a collection of buffer types provides multiple L4 buffers.
Claim 5
Dependent Claim
42 words
The method of claim 1, wherein the step of providing a range of incrementally varying values provides incrementally varying values of a line length connecting buffers of said first stage to buffers of said next adjacent stage of the signal distribution network.
Claim 6
Dependent Claim
34 words
The method of claim 1, wherein the step of providing a range of incrementally varying values provides incrementally varying numbers of next adjacent stage buffers being driven by a buffer in the first stage.
Claim 7
Dependent Claim
66 words
The method of claim 1, wherein the step of automatically selecting one or more suitable buffer types generates a table of suitable buffer types for specified combinations of (i) line length connecting buffers of said first stage to buffers of said next adjacent stage of the signal distribution network, and (ii) numbers of next adjacent stage buffers being driven by a buffer in the first stage.
Claim 8
Dependent Claim
34 words
The method of claim 6, wherein the signal distribution network is a clock distribution network and wherein said first stage to buffers are L4 buffers and said next adjacent stage buffers are L5 buffers.
Claim 9
Dependent Claim
255 words
The method of claim 6, further comprising a step of determining for a given buffer type whether that buffer meets the skew budget for certain combinations of line length and number of next adjacent stage buffers, which step of determining includes, for a specified number of next adjacent stage buffers, the following steps: identifying a right margin, said right margin representing a maximum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the maximum acceptable line length, having a right margin delay of no more than about one or more of (a) a maximum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (b) a maximum low to high propagation delay from the output of the first buffer to the output of a next level buffer; and identifying a left margin, said left margin representing a minimum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the minimum acceptable line length, having a left margin delay of at least about one or more of (c) a minimum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (d) a minimum low to high propagation delay from the output of the first buffer to the output of a next level buffer.
Claim 10
Dependent Claim
29 words
The method of claim 8, wherein at least one of the steps of identifying the right margin and identifying the left margin is performed by a binary search algorithm.
Claim 11
Dependent Claim
54 words
The method of claim 8, wherein the steps of identifying the right margin and identifying the left margin further include steps of ensuring that said given buffer type, when connected to a line of the maximum acceptable line length, has no more than a maximum signal rise time and a maximum signal fall time.
Claim 12
Independent Claim
169 words
A system for generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the system comprising: an input interface for accepting as input parameters (i) a collection of buffer types available for placement at given locations within a first stage of the signal distribution network, (ii) a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; (iii) a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and a computational module for automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 13
Independent Claim
169 words
A system for generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the system comprising: an input interface for accepting as input parameters (i) a collection of buffer types available for placement at given locations within a first stage of the signal distribution network, (ii) a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; (iii) a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and a computational module for automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 14
Dependent Claim
15 words
The system of claim 11, wherein the signal distribution network is a clock distribution network.
Claim 15
Dependent Claim
18 words
The system of claim 12, wherein the input interface accepts L4 buffers as the collection of buffer types.
Claim 16
Dependent Claim
42 words
The system of claim 11, wherein the input interface accepts as a range of incrementally varying values incrementally varying values of a line length connecting buffers of said first stage to buffers of said next adjacent stage of the signal distribution network.
Claim 17
Dependent Claim
34 words
The system of claim 11, wherein the input interface accepts as a range of incrementally varying values incrementally varying numbers of next adjacent stage buffers being driven by a buffer in the first stage.
Claim 18
Dependent Claim
59 words
The system of claim 11, wherein the computational module automatically generates a table of suitable buffer types for specified combinations of (i) line length connecting buffers of said first stage to buffers of said next adjacent stage of the signal distribution network, and (ii) numbers of next adjacent stage buffers being driven by a buffer in the first stage.
Claim 19
Dependent Claim
34 words
The system of claim 16, wherein the signal distribution network is a clock distribution network and wherein said first stage to buffers are L4 buffers and said next adjacent stage buffers are L5 buffers.
Claim 20
Dependent Claim
254 words
The system of claim 16, wherein the computational module determines for a given buffer type whether that buffer meets the skew budget for certain combinations of line length and number of next adjacent stage buffers, and wherein the computational module determines this for a specified number of next adjacent stage buffers by identifying a right margin, said right margin representing a maximum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the maximum acceptable line length, having a right margin delay of no more than about one or more of (a) a maximum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (b) a maximum low to high propagation delay from the output of the first buffer to the output of a next level buffer; and identifying a left margin, said left margin representing a minimum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the minimum acceptable line length, having a left margin delay of at least about one or more of (c) a minimum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (d) a minimum low to high propagation delay from the output of the first buffer to the output of a next level buffer.
Claim 21
Dependent Claim
28 words
The system of claim 18, wherein at least one of the right margin and the left margin are identified by the computational module through a binary search algorithm.
Claim 22
Dependent Claim
50 words
The system of claim 18, wherein the computational module when identifying the right margin and the left margin ensures that said given buffer type, when connected to a line of the maximum acceptable line length, has no more than a maximum signal rise time and a maximum signal fall time.
Claim 23
Dependent Claim
38 words
The system of claim 11, further comprising an output interface which presents a table of suitable buffer types in a format that can be used by a clock buffer insertion tool in the design of an integrated circuit.
Claim 24
Dependent Claim
18 words
The system of claim 11, further comprising a display for displaying a layout of said signal distribution network.
Claim 25
Dependent Claim
41 words
The system of claim 11, wherein said computational module is provided on a computer having one or more input and output devices, a display device, a data storage device, a central unit, and operational software for controlling said central processing unit.
Claim 26
Dependent Claim
179 words
A machine readable medium storing program instructions for generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the machine readable medium comprising instructions for performing the following steps: providing a collection of buffer types available for placement at given locations within a first stage of the signal distribution network; providing a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; for said first stage of the signal distribution network, providing a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 27
Dependent Claim
179 words
A machine readable medium storing program instructions for generating buffer data for use in selecting suitable buffer types for placement at given locations in a signal distribution network during the design of a microprocessor, the suitable buffer types being selected to minimize skew in the signal distribution network, the machine readable medium comprising instructions for performing the following steps: providing a collection of buffer types available for placement at given locations within a first stage of the signal distribution network; providing a skew budget for signal propagation between the first stage and a next adjacent stage of said signal distribution network; for said first stage of the signal distribution network, providing a range of incrementally varying values of at least one feature affecting skew, at least one of said incrementally varying values depending on at least one of said given locations within said first stage; and automatically selecting, for each of said incrementally varying values, one or more suitable buffer types from among the collection of buffer types, which suitable buffer types are selected to meet the skew budget.
Claim 28
Dependent Claim
17 words
The machine readable medium of claim 24, wherein the signal distribution network is a clock distribution network.
Claim 29
Dependent Claim
23 words
The machine readable medium of claim 25, wherein the instructions for providing a collection of buffer types provide for accepting multiple L4 buffers.
Claim 30
Dependent Claim
68 words
The machine readable medium of claim 24, wherein the instructions for automatically selecting one or more suitable buffer types generates a table of suitable buffer types for specified combinations of (i) line length connecting buffers of said first stage to buffers of said next adjacent stage of the signal distribution network, and (ii) numbers of next adjacent stage buffers being driven by a buffer in the first stage.
Claim 31
Dependent Claim
259 words
The machine readable medium of claim 27, further comprising instructions for determining, for a given buffer type, whether that buffer meets the skew budget for certain combinations of line length and number of next adjacent stage buffers, which instructions for determining include, for a specified number of next adjacent stage buffers, instructions for performing the following steps: identifying a right margin, said right margin representing a maximum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the maximum acceptable line length, having a right margin delay of no more than about one or more of (a) a maximum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (b) a maximum low to high propagation delay from the output of the first buffer to the output of a next level buffer; and identifying a left margin, said left margin representing a minimum acceptable line length from said first buffer to a specified number of next level buffers, said given buffer type, when connected to a line of the minimum acceptable line length, having a left margin delay of at least about one or more of (c) a minimum high to low propagation delay from the output of the first buffer to the output of a next level buffer and (d) a minimum low to high propagation delay from the output of the first buffer to the output of a next level buffer.
Claim 32
Dependent Claim
31 words
The machine readable medium of claim 27, wherein at least one of the steps of identifying the right margin and identifying the left margin is performed by a binary search algorithm.
Claim 33
Dependent Claim
60 words
The machine readable medium of claim 27, wherein the steps of identifying the right margin and identifying the left margin are implemented with instructions for performing steps of ensuring that said given buffer type, when connected to a line of the maximum acceptable line length, has no more than a maximum signal rise time and a maximum signal fall time.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2001-08-24 | 2002-02-23 | 2002-08-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2005-08-24 | 2006-02-23 | 2006-08-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2009-08-24 | 2010-02-23 | 2010-08-25 | $7700.00 | Window Closed / Lapsed |