Patents by Inventor Clint A. Hardy

Clint A. Hardy 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).

  • Publication number: 20200394096
    Abstract: A method for reporting incidents of data loss in a storage environment comprising redundant arrays of independent disks (RAIDs) is disclosed. In one embodiment, such a method monitors storage drive failures in a storage environment. For a storage drive failure detected in the storage environment, the method reports the RAID type in which the storage drive failure occurred and whether data loss occurred in the RAID as a result of the storage drive failure. In certain embodiments, the method reports whether the data loss could have been prevented had the RAID type been converted to a more robust RAID type. In other or the same embodiments, the method reports whether the data loss was prevented by the RAID type. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: June 15, 2019
    Publication date: December 17, 2020
    Applicant: International Business Machines Corporation
    Inventors: Lokesh M. Gupta, Matthew G. Borlick, Karl A. Nielsen, Clint A. Hardy, Brian A. Rinaldi
  • Publication number: 20200393983
    Abstract: A method for converting a redundant array of independent disks (RAID) to a more robust RAID level is disclosed. Such a method identifies, in a data storage environment, higher risk storage drives having a failure risk above a first threshold. The method determines a number of the higher risk storage drives that are contained within a RAID array of the data storage environment. The method determines whether the number exceeds a second threshold. The method also determines whether a destage rate associated with the RAID array is below a third threshold. In the event the number exceeds the second threshold and the destage rate is below the third threshold, the method converts the RAID array to a more robust RAID level. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: June 15, 2019
    Publication date: December 17, 2020
    Applicant: International Business Machines Corporation
    Inventors: Lokesh M. Gupta, Matthew G. Borlick, Karl A. Nielsen, Clint A. Hardy, Brian A. Rinaldi
  • Patent number: 10802930
    Abstract: In response to an occurrence of a failure in a storage controller, an input on a plurality of attributes of the storage controller at a time of occurrence of the failure is provided to a machine learning module. In response to receiving the input, the machine learning module generates a plurality of output values corresponding to a plurality of recovery mechanisms to recover from the failure in the storage controller. A recovery is made from the failure in the storage controller, by applying a recovery mechanism whose output value is greatest among the plurality of output values that are generated by the machine learning module.
    Type: Grant
    Filed: November 8, 2018
    Date of Patent: October 13, 2020
    Assignee: International Business Machines Corporation
    Inventors: Brian A. Rinaldi, Clint A. Hardy, Lokesh M. Gupta
  • Patent number: 10740203
    Abstract: A plurality of tracks that are to be copied to a backup volume are aggregated in a container data structure. The plurality of tracks are stored physically contiguously in a single Redundant Array of Independent Disks (RAID) stride. Mapping metadata is updated in the backup volume to indicate how logical tracks of the backup volume correspond to physical tracks stored in the RAID stride.
    Type: Grant
    Filed: September 6, 2018
    Date of Patent: August 11, 2020
    Assignee: International Business Machines Corporation
    Inventors: Theresa M. Brown, Kevin Lin, Dave Fei, Gail Spear, Clint A. Hardy, Karl A. Nielsen
  • Patent number: 10732884
    Abstract: A computer-implemented method for implementing a RAID array, according to one approach, includes: predicting a compression ratio of data to be stored in the RAID array, and using the predicted compression ratio and a physical storage capacity of the RAID array to calculate a maximum virtual storage capacity of the RAID array. The maximum virtual storage capacity is used to establish an effective storage capacity of the RAID array. One or more instructions to store compressed data in the RAID array are also sent. In response to occurrence of a predetermined event, a current compression ratio of the compressed data stored in the RAID array and the physical storage capacity of the RAID array are used to calculate a current virtual storage capacity of the RAID array. Furthermore, the effective storage capacity of the RAID array is scaled based on the current virtual storage capacity.
    Type: Grant
    Filed: March 28, 2019
    Date of Patent: August 4, 2020
    Assignee: International Business Machines Corporation
    Inventors: Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen, Brian A. Rinaldi, Matthew G. Borlick, Matthew J. Kalos
  • Publication number: 20200241787
    Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a source storage pool having a first rank extent size to a destination storage pool having a second rank extent size smaller than the first rank extent size, creating a correspondence between logical volume extents of the volume and physical offset locations within rank extents of the source storage pool, and migrating data from one or more ranks of the source storage pool to one or more ranks of the destination storage pool, utilizing the correspondence between the logical volume extents of the volume and the physical offset locations within the rank extents of the source storage pool.
    Type: Application
    Filed: January 25, 2019
    Publication date: July 30, 2020
    Inventors: Hui Zhang, Clint A. Hardy, Karl A. Nielsen, Matthew J. Kalos, Qiang Xie
  • Patent number: 10725776
    Abstract: Provided are a computer program product, system, and method for reducing a rate at which requests are sent from one processor to another to reduce processor utilization at the processor receiving the requests. A determination is made as to whether processor utilization at the first processor exceeds a utilization threshold. If so, a determination is made as to whether a specified operation is in progress in response to determining that the processor utilization at the first processor exceeds the utilization threshold. The first processor sends a message to the second processor to cause the second processor to reduce a rate at which requests are transferred from the second processor to the first processor in response to determining that the specified operations is in progress.
    Type: Grant
    Filed: December 1, 2017
    Date of Patent: July 28, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Clint A. Hardy, Matthew G. Borlick, Adrian C. Gerhard, Lokesh M. Gupta
  • Patent number: 10691609
    Abstract: A method for concurrently erasing data on a processor and preparing the processor for removal from a computing system is disclosed. In one embodiment, such a method includes determining tasks queued to be executed on a processor and reassigning the tasks to a different processor, such as to a different processor in the same cluster as the processor. The method further prevents new tasks from being assigned to the processor. The method waits for currently executing tasks on the processor to complete. Once the currently executing tasks are complete, the method initiates a cache-hostile job on the processor to evict entries in cache of the processor. Once the cache-hostile job is complete, the method enables the processor to be removed from a computing system such as a storage system controller. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: July 24, 2017
    Date of Patent: June 23, 2020
    Assignee: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen
  • Patent number: 10691518
    Abstract: Provided are a computer program product, system, and method for managing I/O requests to a storage array of storage devices in a machine having a processor node and device adaptor. In response to initiating a rebuild of data in the storage array, the device adaptor determines whether a remaining fault tolerance at the storage array comprises a non-zero fault tolerance that permits at least one further storage device to fail and still allow recovery of data stored in the storage array. In response to determining that the remaining fault tolerance is a zero fault tolerance that does not permit at least one storage device to fail and allow recovery of data, the device adaptor sends a message to the processor node to cause the processor node to initiate an emergency protocol to terminate a mission critical operation when the processor node is performing the mission critical operation.
    Type: Grant
    Filed: July 10, 2019
    Date of Patent: June 23, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Clint A. Hardy, Matthew G. Borlick, Adrian C. Gerhard, Lokesh M. Gupta
  • Publication number: 20200183914
    Abstract: Provided are a computer program product, system, and method for fixing anomalies in a preserved data structure used to generate a temporary data structure during system initialization. A preserved data structure in persistent storage is used to build a temporary data structure in a memory of the computing system during initialization of the computing system. The temporary data structure represents computational resources in the computing system and is rebuilt from the preserved data structure during the initialization. The preserved data structure and the temporary data structure are processed to determine whether the preserved data structure includes at least one anomaly that would result in rebuilding the temporary data structure with an error. Information on the preserved data structure and the temporary data structure having the anomaly are processed to determine modifications to correct the preserved data structure. The determined modifications are processed to correct the preserved data structure.
    Type: Application
    Filed: February 11, 2020
    Publication date: June 11, 2020
    Inventors: Matthew G. BORLICK, Lokesh M. GUPTA, Clint A. HARDY
  • Patent number: 10664198
    Abstract: Provided are a computer program product, system, and method for sharing alias addresses among logical devices for a control unit managing access by hosts to logical devices configured with capacity from attached physical devices. An alias management group of logical devices and alias addresses assigned to the logical devices is configured. A plurality of requests to establish an association of the host with a logical device and the alias addresses assigned to the logical devices in the alias management group are received from a host. Acknowledgment is made to the host that the association is established in response to determining that the host is assigned the logical devices and alias addresses of the logical devices in the alias management group. The host can use one available alias address assigned to any one of the logical devices to access any one of the logical devices indicated in the association.
    Type: Grant
    Filed: June 19, 2019
    Date of Patent: May 26, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Susan K. Candelaria, Scott B. Compton, Matthew R. Craig, Clint A. Hardy, Matthew J. Kalos, Dale F. Riedy, Richard A. Ripberger, Harry M. Yudenfriend
  • Patent number: 10664187
    Abstract: Provided are a computer program product, system, and method for reducing a rate at which data is mirrored from a primary server to a secondary server. A determination is made as to whether a processor utilization at a processor managing access to the secondary storage exceeds a utilization threshold. If so, a determination is made as to whether a specified operation at the processor is in progress. A message is sent to the primary server to cause the primary server to reduce a rate at which data is mirrored from the primary server to the secondary server in response to determining that the specified operation is in progress.
    Type: Grant
    Filed: December 1, 2017
    Date of Patent: May 26, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Clint A. Hardy, Matthew G. Borlick, Adrian C. Gerhard, Lokesh M. Gupta
  • Publication number: 20200151065
    Abstract: In response to an occurrence of a failure in a storage controller, an input on a plurality of attributes of the storage controller at a time of occurrence of the failure is provided to a machine learning module. In response to receiving the input, the machine learning module generates a plurality of output values corresponding to a plurality of recovery mechanisms to recover from the failure in the storage controller. A recovery is made from the failure in the storage controller, by applying a recovery mechanism whose output value is greatest among the plurality of output values that are generated by the machine learning module.
    Type: Application
    Filed: November 8, 2018
    Publication date: May 14, 2020
    Inventors: Brian A. RINALDI, Clint A. HARDY, Lokesh M. GUPTA
  • Publication number: 20200151060
    Abstract: A machine learning module receives inputs comprising attributes of a storage controller, where the attributes affect failures that occur in the storage controller. In response to a failure occurring in the storage controller, a plurality of output values corresponding to a plurality of recovery mechanisms to recover from the failure in the storage controller are generated via forward propagation through a plurality of layers of the machine learning module. A margin of error is calculated based on comparing the generated output values to expected output values corresponding to the plurality of recovery mechanisms, where the expected output values are generated from an indication of a correct recovery mechanism for the failure. An adjustment is made of weights of links that interconnect nodes of the plurality of layers via back propagation to reduce the margin of error, to improve a determination of a recovery mechanism for the failure.
    Type: Application
    Filed: November 8, 2018
    Publication date: May 14, 2020
    Inventors: Brian A. RINALDI, Clint A. HARDY, Lokesh M. GUPTA
  • Patent number: 10649673
    Abstract: Embodiments of the present disclosure may relate to methods and a computer program product for allowing writes based on a granularity level. The method for a storage server may include receiving a received granularity level for a particular volume of a storage device of a client computer including an effective duration for the received granularity level. The method may include receiving an anticipated write to the particular volume at an anticipated write granularity level. The method may include verifying whether the anticipated write granularity level substantially matches the received granularity level at the effective duration. The method may also include writing, in response to the anticipated write granularity level substantially matching the received granularity level at the effective duration, the anticipated write to the particular volume for the received granularity level.
    Type: Grant
    Filed: April 15, 2019
    Date of Patent: May 12, 2020
    Assignee: International Business Machines Corporation
    Inventors: Juan A. Coronado, Lisa R. Martinez, Beth A. Peterson, Clint A. Hardy, Jennifer S. Shioya
  • Publication number: 20200142616
    Abstract: Provided are a computer program product, system, and method for sharing alias addresses among logical devices by a host accessing logical devices provisioned with a capacity from physical devices managed by a control unit. The host establishes with the control unit an association of logical devices and alias addresses assigned to the logical devices, wherein the alias addresses are associated with an alias management group. Alias address pool information is generated indicating each of the logical devices and their assigned alias addresses indicated in the association. The host uses from the alias address pool information any one of the alias addresses in the alias address pool information to access any of the logical devices associated with the same alias management group as the alias address.
    Type: Application
    Filed: January 8, 2020
    Publication date: May 7, 2020
    Inventors: Susan K. Candelaria, Scott B. Compton, Matthew R. Craig, Clint A. Hardy, Matthew J. Kalos, Dale F. Riedy, Richard A. Ripberger, Harry M. Yudenfriend
  • Publication number: 20200142598
    Abstract: Provided are a computer program product, system, and method for reducing a rate at which data is mirrored from a primary server to a secondary server. A determination is made as to whether a processor utilization at a processor managing access to the secondary storage exceeds a utilization threshold. If so, a determination is made as to whether a specified operation at the processor is in progress. A message is sent to the primary server to cause the primary server to reduce a rate at which data is mirrored from the primary server to the secondary server in response to determining that the specified operation is in progress.
    Type: Application
    Filed: January 6, 2020
    Publication date: May 7, 2020
    Inventors: Clint A. HARDY, Matthew G. BORLICK, Adrian C. GERHARD, Lokesh M. GUPTA
  • Publication number: 20200142846
    Abstract: Provided are a computer program product, system, and method for using at least one machine learning module to select a priority queue from which to process an Input/Output (I/O) request. Input I/O statistics are provided on processing of I/O requests at the queues to at least one machine learning module. Output is received from the at least one machine learning module for each of the queues. The output for each queue indicates a likelihood that selection of an I/O request from the queue will maintain desired response time ratios between the queues. The received output for each of the queues is used to select a queue of the queues. An I/O request from the selected queue is processed.
    Type: Application
    Filed: January 6, 2020
    Publication date: May 7, 2020
    Inventors: Karl A. Nielsen, Clint A. Hardy, Lokesh M. Gupta, Matthew G. Borlick
  • Patent number: 10635537
    Abstract: A method for preventing data loss in a RAID includes monitoring storage drives making up a RAID. The method individually tests a storage drive of the RAID by subjecting the storage drive to a stress workload test. This stress workload test may be designed to place additional stress on the storage drive while refraining from adding stress to other storage drives in the RAID. In the event the storage drive fails the stress workload test (e.g., the storage drive cannot adequately handle the additional workload or generates errors in response to the additional workload), the method replaces the storage drive with a spare storage drive and rebuilds the RAID. In certain embodiments, the method tests the storage drive with greater frequency as the age of the storage drive increases. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: November 13, 2017
    Date of Patent: April 28, 2020
    Assignee: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen, Brian A. Rinaldi
  • Patent number: 10628089
    Abstract: A determination is made that data stored in an extent of a first storage resource is to be moved to an extent of a second storage resource. Operations that are still awaiting to start execution in the first storage resource after the data stored in the extent of the first storage resource has been moved to the extent of the second storage resource, are configured for execution in the second storage resource.
    Type: Grant
    Filed: January 22, 2019
    Date of Patent: April 21, 2020
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang