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: 20190026229
    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: Application
    Filed: July 24, 2017
    Publication date: January 24, 2019
    Applicant: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen
  • Patent number: 10120716
    Abstract: Mechanisms for improving computing system performance by a processor device. System resources are organized into a plurality of groups. Each of the plurality of groups is assigned one of a plurality of predetermined task pools. Each of the predetermined task pools has a plurality of tasks. Each of the plurality of groups corresponds to at least one physical boundary of the system resources such that a speed of an execution of those of the plurality of tasks for a particular one of the plurality of predetermined task pools is optimized by a placement of an association with the at least one physical boundary and the plurality of groups.
    Type: Grant
    Filed: October 2, 2014
    Date of Patent: November 6, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kevin J. Ash, Seamus J. Burke, Lokesh M. Gupta, Clint A. Hardy, Matthew J. Kalos, Trung N. Nguyen, Karl A. Nielsen, Louis A. Rasor, David B. Whitworth
  • Publication number: 20180253237
    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: Application
    Filed: March 2, 2017
    Publication date: September 6, 2018
    Inventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
  • Publication number: 20180225110
    Abstract: A method for analyzing and optimizing legacy program code is disclosed. In one embodiment, such a method includes logically dividing legacy program code into multiple sections and possibly subsections. The method then instruments each section with a counter that increments a value each time the respective section is executed. The legacy program code is then executed over a specified period of time on a specified number of test systems. The values are then gathered from the counters and analyzed to determine relative importance of the sections. In certain embodiments, this analysis generates a list of sections that are dead. The method then removes, from the legacy program code, sections that are dead. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: February 8, 2017
    Publication date: August 9, 2018
    Applicant: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen
  • Publication number: 20180165322
    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: December 8, 2016
    Publication date: June 14, 2018
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy
  • Patent number: 9984097
    Abstract: According to one embodiment, a host system includes logic adapted for receiving device information from a source system, logic adapted for building a virtual device based at least in part on the received device information, logic adapted for transferring a reserve of a storage device to the host system and/or receiving results of transferring the reserve to the host system, logic adapted for determining if the reserve is held by the host system, logic adapted for recording the reserve if the reserve is held by the host system, and logic adapted for sending a notification that the reserve is not held by the host system if the reserve is not held by the host system. Other systems and computer program products are also described according to various embodiments.
    Type: Grant
    Filed: November 10, 2010
    Date of Patent: May 29, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Susan K. Candelaria, Mark P. Gardiner, Clint A. Hardy, Matthew J. Kalos, William R. White, Stephen G. Wilkins, Harry M. Yudenfriend
  • Publication number: 20180107570
    Abstract: Provided are a computer program product, system, and method for processing a health condition message on a health condition to determine whether to perform a swap operation. A health condition message is received from a first server indicating an estimated Input/Output (I/O) delay to access a first storage resulting from a health condition experienced at the first server. A determination is made as to whether the estimated I/O delay exceeds a threshold response time for the first storage. A swap operation is performed to redirect I/O requests to data from the first server to the second server to access the data at the second storage in response to determining that the estimated I/O delay exceeds the threshold response time.
    Type: Application
    Filed: October 13, 2016
    Publication date: April 19, 2018
    Inventors: Clint A. Hardy, Matthew J. Kalos
  • Publication number: 20180107680
    Abstract: A computer-implemented method for transferring a reserve to a target host, according to one embodiment, includes granting to a source system, by a control unit, a reserve for a volume of a storage device. A push reserve command is received from the source system. The push reserve command specifies: a transfer of the reserve to a target system, parameter data identifying the target system, and path information specifying the source system. The reserve is transferred only to the target system in response to release of the reserve by the source system.
    Type: Application
    Filed: December 14, 2017
    Publication date: April 19, 2018
    Inventors: Susan K. Candelaria, Mark P. Gardiner, Clint A. Hardy, Matthew J. Kalos, William R. White, Stephen G. Wilkins, Harry M. Yudenfriend
  • Publication number: 20180107566
    Abstract: Provided are a computer program product, system, and method for generating a health condition message on a health condition detected at a first server to send to a host system accessing the first server. A determination is made of a health condition with respect to access to a first storage. A determination is made of an estimated Input/Output (I/O) delay to access the first storage resulting from the determined health condition. A health condition message is generated indicating the estimated I/O delay. The health condition message is transmitted to the host system, wherein the host system uses the estimated I/O delay to determine whether to perform a swap operation to redirect host I/O requests to data from the first server to a second server.
    Type: Application
    Filed: October 13, 2016
    Publication date: April 19, 2018
    Inventors: Clint A. Hardy, Matthew J. Kalos
  • Patent number: 9946618
    Abstract: Provided are a computer program product, system, and method for a computer program product, system, and method for determining an availability score based on available resources of different resource types in a distributed computing environment of storage servers to determine whether to perform a failure operation for one of the storage servers. A health status monitor program deployed in the storage servers performs: maintaining information indicating availability of a plurality of storage server resources for a plurality of resource types; calculating an availability score as a function of a number of available resources of the resource types; and transmitting information on the availability score to a management program. The management program uses the transmitted information to determine whether to migrate services from the storage server from which the availability score is received to at least one of the other storage servers in the distributed computing environment.
    Type: Grant
    Filed: July 8, 2016
    Date of Patent: April 17, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Herve G. P. Andre, Matthew D. Carson, Rashmi Chandra, Clint A. Hardy, Larry Juarez, Tony Leung, Todd C. Sorenson
  • Publication number: 20180067809
    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: Application
    Filed: November 13, 2017
    Publication date: March 8, 2018
    Applicant: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen, Brian A. Rinaldi
  • Publication number: 20180060200
    Abstract: Provided are a computer program product, system, and method for a computer program product, system, and method for determining an availability score based on available resources of different resource types in a distributed computing environment of storage servers to determine whether to perform a failure operation for one of the storage servers. A health status monitor program deployed in the storage servers performs: maintaining information indicating availability of a plurality of storage server resources for a plurality of resource types; calculating an availability score as a function of a number of available resources of the resource types; and transmitting information on the availability score to a management program. The management program uses the transmitted information to determine whether to migrate services from the storage server from which the availability score is received to at least one of the other storage servers in the distributed computing environment.
    Type: Application
    Filed: October 25, 2017
    Publication date: March 1, 2018
    Inventors: Herve G.P. Andre, Matthew D. Carson, Rashmi Chandra, Clint A. Hardy, Larry Juarez, Tony Leung, Todd C. Sorenson
  • Publication number: 20180046506
    Abstract: A plurality of processing entities are maintained in a processor complex. In response to determining that a task is a critical task, the critical task is dispatched to a scheduler, wherein it is preferable to prioritize execution of critical tasks over non-critical tasks. In response to dispatching the critical task to the scheduler, the scheduler determines which processing entity of the plurality of processing entities has a least amount of processing remaining to be performed for currently scheduled tasks. Tasks queued on the determined processing entity are moved to other processing entities, and the currently scheduled tasks on the determined processing entity are completed. In response to moving tasks queued on the determined processing entity to other processing entities and completing the currently scheduled tasks on the determined processing entity, the critical task is dispatched on the determined processing entity.
    Type: Application
    Filed: August 10, 2016
    Publication date: February 15, 2018
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Trung N. Nguyen
  • Publication number: 20180046507
    Abstract: A plurality of cores are maintained in a processor complex. A core of the plurality of cores is reserved for execution of critical tasks, wherein it is preferable to prioritize execution of critical tasks over non-critical tasks. A scheduler receives a task for scheduling in the plurality of cores. In response to determining that the task is a critical task, the task is scheduled for execution in the reserved core.
    Type: Application
    Filed: August 10, 2016
    Publication date: February 15, 2018
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Trung N. Nguyen
  • Patent number: 9880903
    Abstract: A method for intelligently rebuilding a RAID includes subjecting a storage drive in an existing RAID to a stress workload test by placing the storage drive in a RAID 1 configuration with a spare storage drive. In the event the storage drive fails the stress workload test but can still be read, the method uses the RAID 1 configuration to copy recoverable data from the failing storage drive to the spare storage drive. The method uses other storage drives in the existing RAID to reconstruct, on the spare storage drive, data that is not recoverable from the failing storage drive. Either before or after all non-recoverable data has been reconstructed on the spare storage drive, the method logically replaces, in the existing RAID, the failing storage drive with the spare storage drive. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: November 22, 2015
    Date of Patent: January 30, 2018
    Assignee: International Business Machines Corporation
    Inventors: Matthew G. Borlick, John C. Elliott, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen
  • Patent number: 9858148
    Abstract: A method for preventing data loss in a RAID includes monitoring the age of storage drives making up a RAID. When a storage drive in the RAID reaches a specified age, the method individually tests the storage drive 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 22, 2015
    Date of Patent: January 2, 2018
    Assignee: International Business Machines Corporation
    Inventors: Matthew G. Borlick, Lokesh M. Gupta, Clint A. Hardy, Karl A. Nielsen, Brian A. Rinaldi
  • Patent number: 9852154
    Abstract: According to one embodiment, a method includes receiving device information from a source system; building a virtual device on a host system based at least in part on the received device information; at least one of: transferring a reserve of a device stored on a storage device to a target system; and receiving results of transferring the reserve to the target system; determining if the reserve is held by the target system; recording the reserve if the reserve is held by the target system; and sending a notification that the reserve is not held by the target system if the reserve is not held by the target system. Other methods are also described according to various embodiments.
    Type: Grant
    Filed: May 30, 2012
    Date of Patent: December 26, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Susan K. Candelaria, Mark P. Gardiner, Clint A. Hardy, Matthew J. Kalos, William R. White, Stephen G. Wilkins, Harry M. Yudenfriend
  • Publication number: 20170351443
    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: Application
    Filed: June 7, 2016
    Publication date: December 7, 2017
    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: 20170351444
    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: June 7, 2016
    Publication date: December 7, 2017
    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: 9703619
    Abstract: Provided are a computer program product, system, and method for determining an availability score based on available resources of different resource types in a storage system to determine whether to perform a failure operation for the storage system. Information is maintained indicating availability of a plurality of storage system resources for a plurality of resource types. An availability score is calculated as a function of a number of available resources of the resource types. Information on the availability score is transmitted to a failure manager. The failure manager uses the transmitted availability information to determine whether to initiate a storage system failure mode for the storage system.
    Type: Grant
    Filed: May 28, 2014
    Date of Patent: July 11, 2017
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Herve G. P. Andre, Matthew D. Carson, Rashmi Chandra, Clint A. Hardy, Larry Juarez, Tony Leung, Todd C. Sorenson