Patents by Inventor Pavan Uppu

Pavan Uppu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 9798683
    Abstract: Data storage systems and methods for storing data in computing nodes of a super computer or compute cluster are described herein. The super computer storage may be coupled with a primary storage system. In addition to a CPU and memory, non-volatile memory is included with the computing nodes as local storage. The super computer includes a plurality of computing groups, each including a plurality of computing nodes. There is one burst buffer fabric per group and one input/output node per group. When data bursts occur, data may be stored by a first computing node on the local storage of a second computing node in the computing group through the burst buffer fabric without interrupting the CPU in the second computing node. Further, the local storage of other computing nodes may be used to store redundant copies of data from a first computing node to make the super computer data resilient.
    Type: Grant
    Filed: May 9, 2014
    Date of Patent: October 24, 2017
    Assignee: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Michael Vildibill, Jason Cope, Pavan Uppu
  • Publication number: 20150370480
    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.
    Type: Application
    Filed: September 1, 2015
    Publication date: December 24, 2015
    Inventors: Paul Nowoczynski, Jason Micah Cope, Gordon Manning, Don Molaro, Michael Piszczek, Pavan Uppu
  • Patent number: 9213489
    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.
    Type: Grant
    Filed: September 1, 2015
    Date of Patent: December 15, 2015
    Assignee: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Jason Micah Cope, Gordon Manning, Don Molaro, Michael Piszczek, Pavan Uppu
  • Patent number: 9141480
    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.
    Type: Grant
    Filed: September 24, 2013
    Date of Patent: September 22, 2015
    Assignee: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Jason Micah Cope, Pavan Uppu, Don Molaro, Michael Piszczek, Gordon Manning
  • Patent number: 9128826
    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.
    Type: Grant
    Filed: September 16, 2013
    Date of Patent: September 8, 2015
    Assignee: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Jason Micah Cope, Gordon Manning, Don Molaro, Michael Piszczek, Pavan Uppu
  • Publication number: 20140337557
    Abstract: Data storage systems and methods for storing data in computing nodes of a super computer or compute cluster are described herein. The super computer storage may be coupled with a primary storage system. In addition to a CPU and memory, non-volatile memory is included with the computing nodes as local storage. The super computer includes a plurality of computing groups, each including a plurality of computing nodes. There is one burst buffer fabric per group and one input/output node per group. When data bursts occur, data may be stored by a first computing node on the local storage of a second computing node in the computing group through the burst buffer fabric without interrupting the CPU in the second computing node. Further, the local storage of other computing nodes may be used to store redundant copies of data from a first computing node to make the super computer data resilient.
    Type: Application
    Filed: May 9, 2014
    Publication date: November 13, 2014
    Applicant: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Michael Vildibill, Jason Cope, Pavan Uppu
  • Publication number: 20140337457
    Abstract: Data storage systems and methods for storing data in computing nodes of a super computer or compute cluster are described herein. The super computer storage may be integrated with or coupled with a primary storage system. In addition to a CPU and memory, non-volatile memory is included with the computing nodes as local storage. A high speed interconnect remote direct memory access (HRI) unit is also included with each computing node. When data bursts occur, data may be stored by a first computing node on the local storage of a second computing node through the HRI units of the computing nodes, bypassing the CPU of the second computing node. Further, the local storage of other computing nodes may be used to store redundant copies of data from a first computing node to make the super computer data resilient while not interfering with the CPU of the other computing nodes.
    Type: Application
    Filed: May 9, 2014
    Publication date: November 13, 2014
    Applicant: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Michael Vildibill, Jason Cope, Pavan Uppu
  • Publication number: 20140108863
    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.
    Type: Application
    Filed: September 24, 2013
    Publication date: April 17, 2014
    Applicant: DateDirect Network, Inc.
    Inventors: Paul Nowoczynski, Jason Micah Cope, Pavan Uppu, Don Molaro, Michael Piszczek, Gordon Manning
  • Publication number: 20140108707
    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.
    Type: Application
    Filed: September 16, 2013
    Publication date: April 17, 2014
    Applicant: DataDirect Networks, Inc.
    Inventors: Paul Nowoczynski, Jason Micah Cope, Gordon Manning, Don Molaro, Michael Piszczek, Pavan Uppu