Jianding L Luo

Address:

4793 Englewood Dr, San Jose, CA 95129

VIN:

2HNYD28368H513854

Make:

ACURA

Model:

MDX

Year:

2008

US Patent:

20130290642, Oct 31, 2013

Filed:

Apr 29, 2012

Appl. No.:

13/459240

Inventors:

Hueichian Huang - Saratoga CA, US
Srinivasa D. Murthy - Cupertino CA, US
Siamak Nazari - Mountain View CA, US
Roopesh Kumar Tamma - San Ramon CA, US
Jianding Luo - San Jose CA, US

International Classification:

G06F 12/02
G06F 12/08

US Classification:

711141, 711170, 711E12002, 711E12017

Abstract:

Each node in a clustered array is the owner of a set of zero logical disks (LDs). Thinly-provisioned VVs (TPVVs) are partitioned so each is mapped to a group of zero LDs from different sets of zero LDs. When there is a change in ownership, the affected zero LDs are switched one at a time so only a group of the TPVVs is affected each time.

US Patent:

7816803, Oct 19, 2010

Filed:

Aug 30, 2007

Appl. No.:

11/848078

Inventors:

Hubertus Notohamiprodjo - Union City CA, US
Jingming Wang - San Jose CA, US
Jianding Luo - Sunnyvale CA, US

Assignee:

Marvell International Ltd. - Hamilton

International Classification:

H02J 3/02

US Classification:

307 3, 307149

Abstract:

A system and method for processing data includes coupling circuitry for connecting a system to a power line and receiving data from the power line, packet detection circuitry for detecting synch mark in the data, and a processor for processing data upon detecting a synch mark.

US Patent:

20170168756, Jun 15, 2017

Filed:

Jul 29, 2014

Appl. No.:

15/325774

Inventors:

- Huston TX, US
Siamak Nazari - Fremont CA, US
Brian Rutledge - Belfast, GB
Jianding Luo - Fremont CA, US
Jin Wang - Fremont CA, US
Mark Doherty - Belfast, GB
Richard Dalzell - Belfast, GB
Peter Hynes - Dundrum, GB

International Classification:

G06F 3/06

Abstract:

A system that includes a plurality of nodes configured to execute storage transactions. The nodes include a first node and a plurality of other nodes. The storage transactions are grouped into transaction sets that are to be executed in a predetermined order that ensures that dependencies between the transactions are observed. A cluster sequencer that resides on the first node is configured to increment a sequence number that identifies an active transaction set of the transaction sets and send the sequence number from the first node to the plurality of other nodes. Upon receipt of the sequence number, each one of the plurality of other nodes begins executing the transactions of the active transaction set without waiting for confirmation that all of the plurality of other nodes have the same sequence number.