MING QING ZHU, L.AC.
Acupuncture at Technology Dr, San Jose, CA

6657635, Dec 2, 2003

Aug 31, 2000

09/654104

Edward Hutchins - Mountain View CA
Ming Benjamin Zhu - San Jose CA
Sanjay O. Gupta - Fremont CA
Scott C. Heeschen - Campbell CA
Benjamin J. Garlick - Sunnyvale CA

NVIDIA Corporation - Santa Clara CA

G06F 1202

345543, 711135, 711171

Methods and systems for optimizing graphics data processing employ various binning flush algorithms to optimize the utilization of binning memory in a graphics system. Binning flush algorithms provide for processing all geometry and commands binned up to the point the binning memory becomes unavailable, and storing and restoring all necessary intermediate data generated during the partial tile rendering.

6535209, Mar 18, 2003

Nov 14, 2000

09/713447

Karim Abdalla - Menlo Park CA
Oren Rubinstein - Sunnyvale CA
Ming Benjamin Zhu - San Jose CA

Nvidia US Investments Co. - Santa Clara CA

G06T 1700

345418, 345419

A computer graphics system splits vertex data into first and second streams and stores the streams in separate regions of memory. In a specific embodiment, the first stream includes positional data and the second stream includes non-positional color and texture data. A visibility subsystem uses only the first stream to perform visibility processing, thus reducing bandwidth requirement. The rendering system processes data from subsets, identified by the visibility subsystem, of both streams required to render the visible part of a scene.

6323860, Nov 27, 2001

Mar 17, 1999

9/271026

Ming Benjamin Zhu - San Jose CA
Scott C. Heeschen - Campbell CA

Nvidia Corporation - Santa Clara CA

G06F 1500

345427

A method performed in a graphics processor postpones the processing of one or more changes in render state until after one or more tiles that are affected by a primitive are identified (e. g. by use of a bounding box around the primitive to identify tiles within the bounding box, or by visiting an area enclosed by vertex tiles and edge tiles of the primitive to identify tiles covered by the primitive). The method may be performed by: storing value(s) of render state(s) on receipt, receiving one or more primitives affected by the render state(s), identifying from among a number of render state(s) whose values are being stored one or more render state(s) whose values have changed since last update to a tile covered by a received primitive, and associating with the covered tile the changed render states. Such a deliberate delay in association of changed render states eliminates the need to process render state(s) for tiles that are not identified as being covered by a received primitive, and render states that have not changed for such tiles, thus saving processing power and memory bandwidth. Identification of a render state that has changed since the last update to a tile can be accomplished in any manner, e. g.

7102646, Sep 5, 2006

Jul 9, 2004

10/888951

Oren Rubinstein - Sunnyvale CA, US
Ming Benjamin Zhu - San Jose CA, US

NVIDIA U.S. Investment Company - Santa Clara CA

G06F 13/28, G06F 12/06, G06F 12/02

345570, 345543, 345571, 345572

A memory system and methods of operating the same that drastically increase the efficiency in memory use and allocation in graphics systems. In a graphics system using a tiled architecture, instead of pre-allocating a fixed amount of memory for each tile, the invention dynamically allocates varying amounts of memory per tile depending on the demand. In one embodiment all or a portion of the available memory is divided into smaller pages that are preferably equal in size. Memory allocation is done by page based on the amount of memory required for a given tile.

6928526, Aug 9, 2005

Dec 20, 2002

10/325690

Ming Benjamin Zhu - San Jose CA, US
Kai Li - Princeton NJ, US
R. Hugo Patterson - Mountain View CA, US

DataDomain, Inc. - Palo Alto CA

G06F012/00

711154, 711118

A system and method are disclosed for providing efficient data storage. A plurality of data segments is received in a data stream. The system determines whether a data segment has been stored previously in a low latency memory. In the event that the data segment is determined to have been stored previously, an identifier for the previously stored data segment is returned.

6856320, Feb 15, 2005

Nov 10, 2000

09/709964

Oren Rubinstein - Sunnyvale CA, US
Ming Benjamin Zhu - San Jose CA, US

NVIDIA U.S. Investment Company - Santa Clara CA

G06F012/02

345543, 345537, 345538, 345545, 345562

A memory system and methods of operating the same that drastically increase the efficiency in memory use and allocation in graphics systems. In a graphics system using a tiled architecture, instead of pre-allocating a fixed amount of memory for each tile, the invention dynamically allocates varying amounts of memory per tile depending on the demand. In one embodiment all or a portion of the available memory is divided into smaller pages that are preferably equal in size. Memory allocation is done by page based on the amount of memory required for a given tile.

7305532, Dec 4, 2007

Apr 11, 2006

11/403153

Ming Benjamin Zhu - San Jose CA, US
Kai Li - Princeton NJ, US
R. Hugo Patterson - Mountain View CA, US

Data Domain, Inc. - Santa Clara CA

G06F 12/00

711162, 711118

A system and method are disclosed for providing efficient data storage. A data stream comprising a plurality of data segments is received. The system determines whether one of the plurality of data segments has been stored previously using a summary in a low latency memory; in the event that the data segment is determined not to have been stored previously, assigning an identifier to the data segment.

7769967, Aug 3, 2010

Mar 28, 2008

12/079766

Ming Benjamin Zhu - San Jose CA, US
Kai Li - Princeton NJ, US
R. Hugo Patterson - Mountain View CA, US

EMC Corporation - Hopkinton MA

G06F 12/00, G06F 13/00

711154, 711100, 711118, 711161

A system and method are disclosed for providing efficient data storage. A plurality of data segments is received in a data stream. The system determines whether a data segment has been stored previously in a low latency memory. In the event that the data segment is determined to have been stored previously, an identifier for the previously stored data segment is returned.

7373464, May 13, 2008

May 24, 2005

11/136263

Ming Benjamin Zhu - San Jose CA, US
Kai Li - Princeton NJ, US
R. Hugo Patterson - Mountain View CA, US

Data Domain, Inc. - Santa Clara CA

G06F 12/00, G06F 13/00

711154, 711118

A method for storing data comprising is disclosed. The method comprises receiving a data stream comprising a plurality of data segments wherein each data segment is associated with an identifier. The method further determining using a subset of identifiers that are stored in a low latency memory whether a data segments has been previously stored and returning the identifier for the data segment in the event the data segment is determined to have been stored previously.