Patents by Inventor Paul J. Nowoczynski

Paul J. Nowoczynski 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: 9477551
    Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.
    Type: Grant
    Filed: December 1, 2014
    Date of Patent: October 25, 2016
    Assignee: DataDirect Networks, Inc.
    Inventors: Michael J. Piszczek, Jason M. Cope, Paul J. Nowoczynski, Pavan Kumar Uppu
  • Patent number: 9454533
    Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
    Type: Grant
    Filed: August 12, 2015
    Date of Patent: September 27, 2016
    Assignee: DataDirect Networks, Inc.
    Inventors: Jason M. Cope, Paul J. Nowoczynski, Pavan Kumar Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning
  • Patent number: 9378088
    Abstract: The present invention is directed to data migration, and particularly, Parity Group migration, between high performance data generating entities and data storage structure in which distributed NVM arrays are used as a single intermediate logical storage which requires a global registry/addressing capability that facilitates the storage and retrieval of the locality information (metadata) for any given fragment of unstructured data and where Parity Group Identifier and Parity Group Information (PGI) descriptors for the Parity Groups' members tracking, are created and distributed in the intermediate distributed NVM arrays as a part of the non-deterministic data addressing system to ensure coherency and fault tolerance for the data and the metadata. The PGI descriptors act as collection points for state describing the residency and replay status of members of the Parity Groups.
    Type: Grant
    Filed: December 30, 2014
    Date of Patent: June 28, 2016
    Assignee: DataDirect Networks, Inc.
    Inventors: Michael J. Piszczek, Jason M. Cope, Paul J. Nowoczynski, Pavan Kumar Uppu
  • Publication number: 20150347434
    Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
    Type: Application
    Filed: August 12, 2015
    Publication date: December 3, 2015
    Inventors: Jason M. Cope, Paul J. Nowoczynski, Pavan Kumar Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning
  • Patent number: 9152649
    Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.
    Type: Grant
    Filed: October 9, 2013
    Date of Patent: October 6, 2015
    Assignee: DataDirect Networks, Inc.
    Inventors: Paul J. Nowoczynski, Jason M. Cope, Pavan Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning
  • Patent number: 9116819
    Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
    Type: Grant
    Filed: October 17, 2013
    Date of Patent: August 25, 2015
    Assignee: DataDirect Networks, Inc.
    Inventors: Jason M. Cope, Paul J. Nowoczynski, Pavan Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning
  • Publication number: 20140108473
    Abstract: Data storage systems and methods for storing data are described herein. The storage system includes a first storage node is configured to issue a first delivery request to a first set of other storage nodes in the storage system, the first delivery request including a first at least one data operation for each of the first set of other storage nodes and issuing at least one other delivery request, while the first delivery request remains outstanding, the at least one other delivery request including a first commit request for each of the first set of other storage nodes. The first node causes the first at least one data operation to be made active within the storage system in response to receipt of a commit indicator along with a delivery acknowledgement regarding one of the at least one other delivery request.
    Type: Application
    Filed: October 9, 2013
    Publication date: April 17, 2014
    Applicant: DataDirect Networks, Inc.
    Inventors: Paul J. Nowoczynski, Jason M. Cope, Pavan Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning
  • Publication number: 20140108723
    Abstract: Systems and methods for reducing metadata in a write-anywhere storage system are disclosed herein. The system includes a plurality of clients coupled with a plurality of storage nodes, each storage node having a plurality of primary storage devices coupled thereto. A memory management unit including cache memory is included in the client. The memory management unit serves as a cache for data produced by the clients before the data is stored in the primary storage. The cache includes an extent cache, an extent index, a commit cache and a commit index. The movement of data and metadata is by an interval tree. Methods for reducing data in the interval tree increase data storage and data retrieval performance of the system.
    Type: Application
    Filed: October 17, 2013
    Publication date: April 17, 2014
    Applicant: DataDirect Networks, Inc.
    Inventors: Paul J. Nowoczynski, Jason M. Cope, Pavan Kumar Uppu, Donald J. Molaro, Michael J. Piszczek, John G. Manning