Gordon D Manning

Author:

Gordon Manning

ISBN #:

0595374956

Author:

Gordon Manning

ISBN #:

0595402119

Author:

Gordon B. Manning

ISBN #:

0459563521

US Patent:

20010056520, Dec 27, 2001

Filed:

Jun 14, 2001

Appl. No.:

09/882471

Inventors:

Lee McBryde - Mt. Airy MD, US
Gordon Manning - Ellicott City MD, US
Dave Illar - Ellicott City MD, US
Richard Williams - Ellicott City MD, US
Michael Piszczek - Columbia MD, US

International Classification:

G06F012/00

US Classification:

711/114000, 714/006000, 711/113000, 711/131000

Abstract:

A performance optimized RAID Level 3 storage access controller with a unique XOR engine placement at the host/network side of the cache. The invention utilizes multiple data communications channels and a centralized cache memory in conjunction with this unique XOR placement to maximize performance and fault tolerance between a host network and data storage. Positioning the XOR engine at the host/network side of the cache allows the storage devices to be fully independent. Since the XOR engine is placed in the data path and the parity is generated in real-time during cache write transfers, the bandwidth overhead is reduced to zero. For high performance RAID controller applications, a system architecture with minimal bandwidth overhead provides superior performance.

US Patent:

20070022364, Jan 25, 2007

Filed:

Sep 8, 2006

Appl. No.:

11/518337

Inventors:

Lee McBryde - Mt. Airy MD, US
Gordon Manning - Ellicott City MD, US
Dave Illar - Ellicott City MD, US
Richard Williams - Ellicott City MD, US
Michael Piszczek - Columbia MD, US

International Classification:

G06F 11/00
H03M 13/00

US Classification:

714801000

Abstract:

A performance optimized RAID Level 3 storage access controller with a unique XOR engine placement at the host/network side of the cache. The invention utilizes multiple data communications channels and a centralized cache memory in conjunction with this unique XOR placement to maximize performance and fault tolerance between a host network and data storage. Positioning the XOR engine at the host/network side of the cache allows the storage devices to be fully independent. Since the XOR engine is placed in the data path and the parity is generated in real-time during cache write transfers, the bandwidth overhead is reduced to zero. For high performance RAID controller applications, a system architecture with minimal bandwidth overhead provides superior performance.

US Patent:

20150370480, Dec 24, 2015

Filed:

Sep 1, 2015

Appl. No.:

14/842577

Inventors:

- Chatsworth CA, US
Jason Micah Cope - Columbia MD, US
Gordon Manning - Ellicott City MD, US
Don Molaro - Cupertino CA, US
Michael Piszczek - Laurel MD, US
Pavan Uppu - Laurel MD, US

International Classification:

G06F 3/06
G06F 13/42

Abstract:

Data storage systems and methods for storing data are described herein. The storage system may be integrated with or coupled with a compute cluster or super computer having multiple computing nodes. A plurality of nonvolatile memory units may be included with computing nodes, coupled with computing nodes or coupled with input/output nodes. The input/output nodes may be included with the compute cluster or super computer, or coupled thereto. The nonvolatile memory units store data items provided by the computing nodes, and the input/output nodes maintain where the data items are stored in the nonvolatile memory units via a hash table distributed among the input/output nodes. The use of a distributed hash table allows for quick access to data items stored in the nonvolatile memory units even as the computing nodes are writing large amounts of data to the storage system quickly in bursts.

US Patent:

20140108707, Apr 17, 2014

Filed:

Sep 16, 2013

Appl. No.:

14/028292

Inventors:

- Chatsworth CA, US
Jason Micah Cope - Columbia MD, US
Gordon Manning - Ellicott City MD, US
Don Molaro - Cupertino CA, US
Michael Piszczek - Laurel MD, US
Pavan Uppu - Laurel MD, US

Assignee:

DataDirect Networks, Inc. - Chatsworth CA

International Classification:

G06F 12/02

US Classification:

711103

Abstract:

Data storage systems and methods for storing data are described herein. The storage system may be integrated with or coupled with a compute cluster or super computer having multiple computing nodes. A plurality of nonvolatile memory units may be included with computing nodes, coupled with computing nodes or coupled with input/output nodes. The input/output nodes may be included with the compute cluster or super computer, or coupled thereto. The nonvolatile memory units store data items provided by the computing nodes, and the input/output nodes maintain where the data items are stored in the nonvolatile memory units via a hash table distributed among the input/output nodes. The use of a distributed hash table allows for quick access to data items stored in the nonvolatile memory units even as the computing nodes are writing large amounts of data to the storage system quickly in bursts.

US Patent:

20140108863, Apr 17, 2014

Filed:

Sep 24, 2013

Appl. No.:

14/035913

Inventors:

- Chatsworth CA, US
Jason Micah Cope - Columbia MD, US
Pavan Uppu - Laurel MD, US
Don Molaro - Cupertino CA, US
Michael Piszczek - Laurel MD, US
Gordon Manning - Ellicott City MD, US

Assignee:

DateDirect Network, Inc. - Chatsworth CA

International Classification:

G06F 11/14

US Classification:

714 15

Abstract:

Data storage systems and methods for storing data are described herein. The storage system includes at least two data storage nodes for storing portions of a distributed hash table and related data. After a first node attempts to complete a write request at a second node and is unable to complete the request, the first node ceases responses to interactions from other nodes. Once the first node's failure to respond has caused a sufficient number of nodes to cease responding, the nodes enter a service mode to resolve the live lock. While in live lock, the nodes determine the oldest, unfulfilled request using a system-wide logical timestamp associated with write requests. Once the oldest request is determined, a removal vote to remove the non-responsive node from the group is initiated and, if other nodes agree, the non-responsive node is removed from the group of nodes.