Jeannette N Sutherland

US Patent:

7216316, May 8, 2007

Filed:

Mar 5, 2004

Appl. No.:

10/794756

Inventors:

Jeannette N. Sutherland - Cedar Park TX, US
Robert E. Mains - Morgan Hill CA, US
Matthew J. Amatangelo - Austin TX, US
Shervin Hojat - Austin TX, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 17/50

US Classification:

716 6, 716 5

Abstract:

Broadly speaking, a method is provided for evaluating nets in a crosstalk noise analysis. More specifically, a method is provided for evaluating timing window overlap between a pair of nets. The method includes selecting one timing window from each net of the pair of nets for analysis. The method further includes analyzing characteristics of the timing windows selected from the pair of nets to identify a timing window overlap presence, wherein the timing window overlap presence can exist between any two timing windows associated with each net of the pair of nets, respectively.

US Patent:

20050177357, Aug 11, 2005

Filed:

Feb 9, 2004

Appl. No.:

10/774990

Inventors:

Matthew Amatangelo - Austin TX, US
Jeannette Sutherland - Cedar Park TX, US
Robert Mains - Morgan Hill CA, US

International Classification:

G06F017/50

US Classification:

703016000

Abstract:

A method of modeling a combinatorial gate which includes providing a data signal input at the combinatorial gate, providing a clock signal input at the combinatorial gate, propagating the clock signal as an output signal when the output of the combinatorial gate corresponds to the clock signal, and propagating the data signal as an output when the output of the combinatorial gate corresponds to the data signal, the propagating the data signal modeling a near domino function.

US Patent:

20080059935, Mar 6, 2008

Filed:

Nov 2, 2007

Appl. No.:

11/934543

Inventors:

Sharad Mehrotra - Cedar Park TX, US
Parsotam Patel - Austin TX, US
Joe Rahmeh - Austin TX, US
Jeannette Sutherland - Austin TX, US

Assignee:

Pyxis Technology, Inc. - Austin TX

International Classification:

G06F 17/50

US Classification:

716013000

Abstract:

Routing systems and methods are provided having various strategies for optimizing and evaluating routes for netlist connections. In one embodiment, a data structure or matrix provides cost related data weighted to evaluate the impact proposed a connection or segment will have upon an attribute of interest such as, for example, speed, manufacturability or noise tolerance. This cost information can be related to terrain costs as well as shape costs to provide multidimensional cost information for connections. Processing such higher information cost data is made more efficient with an additive process that is less demanding than a computationally intensive iterative multiplication process. Various methods are also disclosed for shifting and adjusting routine grids to improve use of available space or reduce run time in routing. In another embodiment, a parallel processing scheme is used to process multiple regions on multiple processors simultaneously without creating conflicts, that could arise, for example, when two processors try to route a trace on the same gridpoint.

US Patent:

20080066044, Mar 13, 2008

Filed:

Nov 2, 2007

Appl. No.:

11/934554

Inventors:

Sharad Mehrotra - Cedar Park TX, US
Parsotam Patel - Austin TX, US
Joe Rahmeh - Austin TX, US
Jeannette Sutherland - Austin TX, US

Assignee:

Pyxis Technology, Inc. - Austin TX

International Classification:

G06F 17/50

US Classification:

716013000

Abstract:

Routing systems and methods are provided having various strategies for optimizing and evaluating possible routes for netlist connections. In one embodiment, a data structure or matrix provides cost related data weighted to evaluate the impact proposed a connection or segment will have upon an attribute of interest such as, for example, speed, manufacturability or noise tolerance. This cost information can be related to terrain costs as well as shape costs to provide multidimensional cost information for connections. Processing such higher information cost data is made more efficient with an additive process that is less demanding than a computationally intensive iterative multiplication process. Various methods are also disclosed for shifting and adjusting routing grids to improve use of available space or reduce run time in routing. In another embodiment, a parallel processing scheme is used to process multiple regions on multiple processors simultaneously without creating conflicts, that could arise, for example, when two processors try to route a trace on the same gridpoint.

US Patent:

20080072201, Mar 20, 2008

Filed:

Nov 2, 2007

Appl. No.:

11/934527

Inventors:

Sharad Mehrotra - Cedar Park TX, US
Parsotam Patel - Austin TX, US
Joe Rahmeh - Austin TX, US
Jeannette Sutherland - Cedar Park TX, US

Assignee:

Pyxis Technology, Inc. - Austin TX

International Classification:

G06F 17/50

US Classification:

716013000

Abstract:

Routing systems and methods are provided having various strategies for optimizing and evaluating possible routes for netlist connections. In one embodiment, a data structure or matrix provides cost related data weighted to evaluate the impact proposed a connection or segment will have upon an attribute of interest such as, for example, speed, manufacturability or noise tolerance. This cost information can be related to terrain costs as well as shape costs to provide multidimensional cost information for connections. Processing such higher information cost data is made more efficient with an additive process that is less demanding than a computationally intensive iterative multiplication process. Various method are also disclosed for shifting and adjusting routing grides to improve use of available space or reduce run time in routing. In another embodiment, a parallel processing scheme is used to process multiple regions on multiple processors simulataneously without creating conflicts, that could arise, for example, when two processors try to route a trace on the same gridpoint.

US Patent:

20080184187, Jul 31, 2008

Filed:

Apr 3, 2008

Appl. No.:

12/062363

Inventors:

Sharad Mehrotra - Cedar Park TX, US
Parsotam T. Patel - Austin TX, US
Joe T. Rahmeh - Austin TX, US
Jeannette N. Sutherland - Cedar Park TX, US

Assignee:

PYXIS TECHNOLOGY, INC. - Austin TX

International Classification:

G06F 17/50

US Classification:

716 13

Abstract:

Routing systems and methods are provided having various strategies for optimizing and evaluating possible routes for netlist connections. In one embodiment, a data structure or matrix provides cost related data weighted to evaluate the impact proposed a connection or segment will have upon an attribute of interest such as, for example, speed, manufacturability or noise tolerance. This cost information can be related to terrain costs as well as shape costs to provide multidimensional cost information for connections. Processing such higher information cost data is made more efficient with an additive process that is less demanding than a computationally intensive iterative multiplication process. Various methods are also disclosed for shifting and adjusting routing grids to improve use of available space or reduce run time in routing. In another embodiment, a parallel processing scheme is used to process multiple regions on multiple processors simultaneously without creating conflicts, that could arise, for example, when two processors try to route a trace on the same gridpoint.

US Patent:

7206958, Apr 17, 2007

Filed:

Oct 21, 2003

Appl. No.:

10/690059

Inventors:

Jeannette N. Sutherland - Cedar Park TX, US
Robert E. Mains - Morgan Hill CA, US
Matthew J. Amatangelo - Austin TX, US

Assignee:

Sun Microsystems, Inc. - Santa Clara CA

International Classification:

G06F 1/04

US Classification:

713500, 703 19, 716 6

Abstract:

Given two synchronous clocks which transact data from a transmitter element to a receiver element which are analyzed by static timing, the interval between the transmitting data launch clock edge and the receiving capture clock edge is adjusted from the clock waveforms provided in order to represent the worst case slack situation between these two clocks over time. The amount of this adjustment is determined without unrolling (enumerating) all possible launch/capture pairs for these clocks. The greatest common divisor (GCD) of a transmit clock frequency and a receive clock frequency is determined. An effective phase shift is determined by performing a MOD operation between the GCD and an offset of the transmitter and receiver clocks. An algorithm uses the GCD and effective phase shift to determine a launch/capture interval that corresponds to a critical slack condition.