IP Library Granted Patent US 7,849,429
Granted Patent B2
US 7,849,429 · App. 12/053,887 · Granted Dec 7, 2010

Methods for conserving memory in statistical static timing analysis

View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 7,849,429
App. No.
12/053,887
Granted
Dec 7, 2010
Kind
B2
Abstract

A method is provided for memory conservation in statistical static timing analysis. A timing graph is created with a timing run in a statistical static timing analysis program. A plurality of nodes in the timing graph that are candidates for a partial store and constraint points are identified. Timing data is persistently stored at constraint points. The persistent timing data is retrieved from the constraint points and used to calculate intermediate timing data at the plurality of nodes during timing analysis.

Claims (18)

1. A method for memory conservation during statistical static timing analysis, the method comprising:

creating a timing graph with a timing run in a statistical static timing analysis program;

identifying a plurality of nodes in the timing graph that are candidates for a partial store;

identifying one or more of the nodes as constraint points;

persistently storing timing data at constraint points;

retrieving persistent timing data from the constraint points; and

calculating intermediate timing data at the plurality of nodes using retrieved persistent timing data during timing analysis,

wherein the timing data is selected from the group consisting of statistical distributions of arrival times (AT), statistical distributions of required arrival times (RAT), statistical distributions of slews, tightness probabilities, and combinations thereof.

2. The method of claim 1 wherein identifying the plurality of points comprises:

traversing the timing graph to identify nodes for the partial store a-priori; and

flagging the identified nodes.

3. The method of claim 1 wherein identifying the plurality of points comprises:

dynamically identifying nodes for the partial store during the timing run.

4. The method of claim 1 wherein the constraint points are identified to balance re-calculation costs with memory savings.

5. The method of claim 1 wherein the partial store comprises:

restricting storing of timing data to tightness probabilities or other related data useful in timing quantity reconstruction.

6. The method of claim 1 wherein the timing data comprises statistical variations.

7. The method of claim 1 wherein the constraint points include test points.

Assignments (3)
MERGER AND CHANGE OF NAME Recorded Jun 18, 2021
From: MENTOR GRAPHICS CORPORATION; SIEMENS INDUSTRY SOFTWARE INC.
To: SIEMENS INDUSTRY SOFTWARE INC.
Reel/Frame 057261/0545 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 1, 2013
From: INTERNATIONAL BUSINESS MACHINES CORPORATION
To: MENTOR GRAPHICS CORPORATION
Reel/Frame 029733/0156 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 24, 2008
From: HEMMETT, JEFFREY G.; VENKATESWARAN, NATESAN; VISWESWARIAH, CHANDRAMOULI; ZOLOTOV, VLADIMIR
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 020692/0958 →