Patents by Inventor Michael Piszczek

Michael Piszczek 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: 10503693
    Abstract: The present invention is directed to a distributed data migration and storage system and method configured for fully parallel writing and retrieval of data objects to (and from) the Web Object Scaler (WOS) object storage system with highly efficient accessibility and using a simplified set of filing commands. The data objects migrate between data generating entities and the WOS object storage through an intermediate Burst Buffer tier (supported by the Infinite Memory Engine) without the utilization of a serial process substantially simultaneously through parallel channels. The metadata for each object is captured with appropriate pointers for efficient finding of the object in the WOS storage system. The WOS nodes return the stored objects' ID (OIDs) corresponding to the objects storage address which are used for the object access.
    Type: Grant
    Filed: July 22, 2016
    Date of Patent: December 10, 2019
    Assignee: DataDirect Networks, Inc.
    Inventors: Rajkumar Joshi, Michael Piszczek, David F. Fellinger
  • Patent number: 10042869
    Abstract: A data migrating system and method are provided in which a Burst Buffer Network Aggregator (BBNA) process is configured either on the File Servers or on the File System's dedicated I/O nodes to coalesce data fragments stored in participating Burst Buffer nodes under the direction of a primary BB node appointed by a data generating entity prior to transfer of the full data stripe into the File System. The “write” request in the form of a full data stripe is distributed into a plurality of data fragments among participating BB nodes along with corresponding metadata.
    Type: Grant
    Filed: February 5, 2016
    Date of Patent: August 7, 2018
    Assignee: DataDirect Networks, Inc.
    Inventors: Michael Piszczek, Jason Micah Cope, Paul Nowoczynski, Pavan Kumar Uppu
  • Patent number: 9628299
    Abstract: A data migrating system and method are provided in which a Burst Buffer Network Aggregator (BBNA) process is configured either on the File Servers or on the File System's dedicated I/O nodes to coalesce data fragments stored in participating Burst Buffer nodes under the direction of a primary BB node appointed by a data generating entity prior to transfer of the full data stripe into the File System. The “write” request in the form of a full data stripe is distributed into a plurality of data fragments among participating BB nodes along with corresponding metadata.
    Type: Grant
    Filed: October 3, 2013
    Date of Patent: April 18, 2017
    Assignee: DataDirect Networks, Inc.
    Inventors: Pavan Kumar Uppu, Jason Micah Cope, Paul Nowoczynski, Michael Piszczek
  • 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: 20140351300
    Abstract: A data migrating system and method are provided in which a Burst Buffer Network Aggregator (BBNA) process is configured either on the File Servers or on the File System's dedicated I/O nodes to coalesce data fragments stored in participating Burst Buffer nodes under the direction of a primary BB node appointed by a data generating entity prior to transfer of the full data stripe into the File System. The “write” request in the form of a full data stripe is distributed into a plurality of data fragments among participating BB nodes along with corresponding metadata.
    Type: Application
    Filed: October 3, 2013
    Publication date: November 27, 2014
    Applicant: DATADIRECT NETWORKS, INC.
    Inventors: PAVAN KUMAR UPPU, JASON MICAH COPE, PAUL NOWOCZYNSKI, MICHAEL PISZCZEK
  • 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
  • Patent number: 8661218
    Abstract: A latency reduction method for read operations of an array of N solid-state storage devices having n solid-state storage devices for data storage and p solid-state storage devices for storing parity data is provided. Utilizing the parity generation engine fault tolerance for a loss of valid data from at least two of the N solid-state storage devices, the integrity of the data is determined when N?1 of the solid-state storage devices have completed executing a read command. If the data is determined to be valid, the missing data of the Nth solid-state storage device is reconstructed and the data transmitted to the requesting processor. By that arrangement the time necessary for the Nth solid-state storage device to complete execution of the read command is saved, thereby improving the performance of the solid-state memory system.
    Type: Grant
    Filed: September 22, 2011
    Date of Patent: February 25, 2014
    Assignee: DataDirect Networks, Inc.
    Inventors: Michael Piszczek, J. Gordon Manning, Cedric Fernandes
  • Patent number: 8095763
    Abstract: A latency reduction method for read operations of an array of N disk storage devices (210) having n disk storage devices (210A-210H) for data storage and p of disk storage devices (210I, 210J) for storing parity data is provided. Utilizing the parity generation engine's (230) fault tolerance of for a loss of valid data from at least two of the N disk storage devices (210A-210J), the integrity of the data is determined when N?1 of the disk storage devices (210A-210J) have completed executing a read command. If the data is determined to be valid, the missing data of the Nth disk storage device is reconstructed and the data transmitted to the requesting processor (10). By that arrangement the time necessary for the Nth disk storage device to complete execution of the read command is saved, thereby improving the performance of memory system (200).
    Type: Grant
    Filed: October 18, 2007
    Date of Patent: January 10, 2012
    Assignee: Datadirect Networks, Inc.
    Inventors: Michael Piszczek, John G. Manning, Cedric Fernandes, Lauren Belella
  • Patent number: 7917810
    Abstract: In order to detect problematic drives in random arrays of independent disks, the system measures the latency of executing command sets which are broadcast to all disks in the data storage system and the results are compared to identify which disks take substantially longer to complete the requests. Disks that take longer to complete requests are likely to be problematic and are candidates for further examination and replacement. The disks in each tier group are compared to determine if any disk in that group exhibits problems. Also, counters for each tier group are compared to determine if the problem is with the disk or with the channel of the tier group. The latency of each disk in the tier group is saved in a table to provide a histogram of the latency of the disks in the tier group. Histograms of the disks in a single tier group are compared to determine if a specific disk is problematic.
    Type: Grant
    Filed: October 17, 2007
    Date of Patent: March 29, 2011
    Assignee: Datadirect Networks, Inc.
    Inventors: Michael Piszczek, J. Gordon Manning, Thomas Pontos
  • Patent number: 7877626
    Abstract: In a data storage system, failed disk drives are switched temporarily off-line to be quickly rebuilt by executing a journaling/rebuild algorithm which tracks the updates to the failed disk drive into a journal structure created in a non-volatile memory. The journal information is used to update those data sections of the disk drive affected by updates after the disk drive is failed. The journal information is stored in bit maps indicating which portions of the disk drive have been updated with new data while the disk was failed. As an option, the system permits verification of data consistency on the data section of the disk drive which have not been affected by the updates. The journaling/rebuild of failed disks is applicable, among others, to RAID data storage systems.
    Type: Grant
    Filed: December 31, 2007
    Date of Patent: January 25, 2011
    Assignee: Datadirect Networks, Inc.
    Inventors: Michael Piszczek, John Gordon Manning, David Fellinger
  • Publication number: 20090172273
    Abstract: In a data storage system, failed disk drives are switched temporarily off-line to be quickly rebuilt by executing a journaling/rebuild algorithm which tracks the updates to the failed disk drive into a journal structure created in a non-volatile memory. The journal information is used to update those data sections of the disk drive affected by updates after the disk drive is failed. The journal information is stored in bit maps indicating which portions of the disk drive have been updated with new data while the disk was failed. As an option, the system permits verification of data consistency on the data section of the disk drive which have not been affected by the updates. The journaling/rebuild of failed disks is applicable, among others, to RAID data storage systems.
    Type: Application
    Filed: December 31, 2007
    Publication date: July 2, 2009
    Applicant: DATADIRECT NETWORKS, INC.
    Inventors: MICHAEL PISZCZEK, JOHN GORDON MANNING, DAVID FELLINGER
  • Publication number: 20090106491
    Abstract: A latency reduction method for read operations of an array of N disk storage devices (210) having n disk storage devices (210A-210H) for data storage and p of disk storage devices (210I, 210J) for storing parity data is provided. Utilizing the parity generation engine's (230) fault tolerance of for a loss of valid data from at least two of the N disk storage devices (210A-210J), the integrity of the data is determined when N?1 of the disk storage devices (210A-210J) have completed executing a read command. If the data is determined to be valid, the missing data of the Nth disk storage device is reconstructed and the data transmitted to the requesting processor (10). By that arrangement the time necessary for the Nth disk storage device to complete execution of the read command is saved, thereby improving the performance of memory system (200).
    Type: Application
    Filed: October 18, 2007
    Publication date: April 23, 2009
    Inventors: Michael Piszczek, John G. Manning, Cedric Fernandes, Lauren Belella
  • Publication number: 20090106602
    Abstract: In order to detect problematic drives in random arrays of independent disks, the system measures the latency of executing command sets which are broadcast to all disks in the data storage system and the results are compared to identify which disks take substantially longer to complete the requests. Disks that take longer to complete requests are likely to be problematic and are candidates for further examination and replacement. The disks in each tier group are compared to determine if any disk in that group exhibits problems. Also, counters for each tier group are compared to determine if the problem is with the disk or with the channel of the tier group. The latency of each disk in the tier group is saved in a table to provide a histogram of the latency of the disks in the tier group. Histograms of the disks in a single tier group are compared to determine if a specific disk is problematic.
    Type: Application
    Filed: October 17, 2007
    Publication date: April 23, 2009
    Inventors: Michael Piszczek, J. Gordon Manning, Thomas Pontos
  • Publication number: 20070022364
    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.
    Type: Application
    Filed: September 8, 2006
    Publication date: January 25, 2007
    Inventors: Lee McBryde, Gordon Manning, Dave Illar, Richard Williams, Michael Piszczek
  • Patent number: 7127668
    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.
    Type: Grant
    Filed: June 14, 2001
    Date of Patent: October 24, 2006
    Assignee: Datadirect Networks, Inc.
    Inventors: Lee McBryde, Gordon Manning, Dave Illar, Richard Williams, Michael Piszczek
  • Publication number: 20010056520
    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.
    Type: Application
    Filed: June 14, 2001
    Publication date: December 27, 2001
    Inventors: Lee McBryde, Gordon Manning, Dave Illar, Richard Williams, Michael Piszczek