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: 20250238159Abstract: A score is generated for each extent in a storage device based on a plurality of factors including storage capacities, expected compression ratios, and statistics on reads and writes. An extent is moved between a compressed rank and a non-compressed rank based on the generated score.Type: ApplicationFiled: January 24, 2024Publication date: July 24, 2025Inventors: Clint A. Hardy, Matthew G. Borlick, Beth Ann Peterson, Lokesh Mohan Gupta
-
Publication number: 20250200180Abstract: Malware encryption detection for host data are provided. The host data is associated with an expected encryption state which includes at least one of an encrypted state, a partially encrypted state, or an unencrypted state. An actual encryption state for the host data is determined based on a first comparison between an expected compression ratio of the host data and an actual compressed ratio of the host data. A tag is stored for the host data based on a second comparison between the actual encryption state of the host data and the expected encryption state of the host data.Type: ApplicationFiled: December 15, 2023Publication date: June 19, 2025Inventors: Beth Ann Peterson, Matthew G. Borlick, Clint A. Hardy, Lokesh Mohan Gupta
-
Publication number: 20250165145Abstract: A computer-implemented method, according to one approach, includes: receiving an indication that memory has entered a protected state. Additionally, I/O requests intended for target locations in the memory are received. A determination is made as to whether the target locations are permitted to perform I/O requests while the memory is in the protected state. In response to determining one or more of the target locations are not permitted to perform I/O requests while the memory is in the protected state, the respective one or more of the received I/O requests are denied. However, in response to determining one or more of the target locations are permitted to perform I/O requests while the memory is in the protected state, the respective one or more of the received I/O requests are performed at the one or more target locations.Type: ApplicationFiled: November 20, 2023Publication date: May 22, 2025Inventors: Beth Ann Peterson, Lokesh Mohan Gupta, Matthew G. Borlick, Clint A. Hardy, Trang Thuy Le, Trinh Nguyen, Karl Allen Nielsen
-
Publication number: 20250165140Abstract: A computer-implemented method, according to one approach, includes: receiving an indication that memory has entered a protected state. An I/O request that is intended for a target location in the memory is also received. Moreover, the relative significance of the I/O request is evaluated, and in response to concluding the I/O request is sufficiently significant, the I/O request is performed at the target location. However, in response to concluding the I/O request is insufficiently significant, the I/O request is denied.Type: ApplicationFiled: November 20, 2023Publication date: May 22, 2025Inventors: Beth Ann Peterson, Lokesh Mohan Gupta, Matthew G. Borlick, Clint A. Hardy, Trang Thuy Le, Trinh Nguyen, Karl Allen Nielsen
-
Publication number: 20250156102Abstract: Described are techniques for selecting compressed or non-compressed data storage using hints for a dataset. The techniques include receiving a dataset at a data storage system that manages storage location on compressed data storage and non-compressed data storage. The techniques further include determining, by the data storage system, that the dataset includes one or more hints for selecting a storage location for the dataset from one of the storage locations managed by the data storage system. The techniques further include selecting, by the data storage system, the storage location for the dataset based in part on the one or more hints and storing the dataset to the storage location.Type: ApplicationFiled: November 13, 2023Publication date: May 15, 2025Inventors: Beth Ann Peterson, Clint A. Hardy, Matthew G. Borlick, Lokesh Mohan Gupta
-
Patent number: 12299298Abstract: Provided are a computer program product, system, and method for determining whether to compress data at a source device to transmit to a target device. A determination is made of network bandwidth between the source device and the target device. The source device transmits data to the target device. A determination is made of source available processor resources on the source device and target available processor resources on the target device. A determination is made as to whether to compress data at the source device to transmit to the target device based on the network bandwidth, the source available processor resources, and the target available processor resources. Compression is initiated, on the source device, of the data to transmit to the target device in response to determining that the source device is to compress the data.Type: GrantFiled: January 12, 2024Date of Patent: May 13, 2025Assignee: International Business Machines CorporationInventors: Lokesh Mohan Gupta, Matthew G. Borlick, Beth Ann Peterson, Clint A. Hardy, Roger G. Hathorn
-
Patent number: 12293075Abstract: Provided are techniques for task adjustment for uniform performance of drives. Arrays are created for different drive types. Performance benchmarks are run for each of the arrays to compute a stage maximum value and a destage maximum value for each of the drive types. At run time, in response to determining that a mode indictor indicates a uniform performance mode, a maximum number of stage Task Control Blocks (TCBs) are set to a stage maximum uniform value and a maximum number of destage TCBs are set to a destage maximum uniform value. The stage of first data is performed using an actual number of stage TCBs that do not exceed the maximum number of stage TCBs. The destage of second data is performed using an actual number of destage TCBs that do not exceed the maximum number of destage TCBs.Type: GrantFiled: October 16, 2023Date of Patent: May 6, 2025Assignee: INTERNATIONAL BUSINESS CORPORATIONInventors: Matthew G. Borlick, Beth Ann Peterson, Lokesh Mohan Gupta, Clint A. Hardy
-
Publication number: 20250123745Abstract: Provided are techniques for task adjustment for uniform performance of drives. Arrays are created for different drive types. Performance benchmarks are run for each of the arrays to compute a stage maximum value and a destage maximum value for each of the drive types. At run time, in response to determining that a mode indictor indicates a uniform performance mode, a maximum number of stage Task Control Blocks (TCBs) are set to a stage maximum uniform value and a maximum number of destage TCBs are set to a destage maximum uniform value. The stage of first data is performed using an actual number of stage TCBs that do not exceed the maximum number of stage TCBs. The destage of second data is performed using an actual number of destage TCBs that do not exceed the maximum number of destage TCBs.Type: ApplicationFiled: October 16, 2023Publication date: April 17, 2025Inventors: Matthew G. Borlick, Beth Ann Peterson, Lokesh Mohan Gupta, Clint A. Hardy
-
Publication number: 20250117165Abstract: Provided are a computer program product, system, and method for determining a storage device type on which to store extents of data in a storage system. The storage system provides a first storage device type that has native data compression at a first compression ratio and a second storage device type that has native data compression at a second compression ratio. The second compression ratio is higher than the first compression ratio. A determination is made for an extent to store the extent on the first storage device type or the second storage device type based on access frequency to data in the extent and an Input/Output (I/O) priority level for the extent. The extent is stored on the determined first or second storage device type.Type: ApplicationFiled: October 4, 2023Publication date: April 10, 2025Inventors: Lokesh Mohan Gupta, Matthew G. Borlick, Beth Ann Peterson, Clint A. Hardy, Karl Allen Nielsen
-
Publication number: 20250117149Abstract: Provided are a computer program product, system, and method for determining to migrate data between compressed storage devices and non-compressed storage devices in a storage system. The storage system provides compressed storage devices having native data compression and a non-compressed storage devices not configured to have native compression. A determination is made of storage usage factors for the compressed storage devices and the non-compressed storage devices. A determination is made whether to move data between the compressed storage devices and the non-compressed storage devices based on the storage usage factors. Data is moved between the compressed storage devices and the non-compressed storage devices in response to determining to move the data between the compressed storage devices and the non-compressed storage devices.Type: ApplicationFiled: October 4, 2023Publication date: April 10, 2025Inventors: Clint A. Hardy, Matthew G. Borlick, Beth Ann Peterson, Lokesh Mohan Gupta, Karl Allen Nielsen
-
Patent number: 12105800Abstract: Provided are a computer program product, system, and method for using trap cache segments to detect malicious processes. A trap cache segment to the cache for data in the storage and indicated as a trap cache segment. Cache segments are added to the cache having data from the storage that are not indicated as trap cache segments. A memory function call from a process executing in the computer system reads data from a region of a memory device to output the read data to a buffer of the memory device. A determination is made as to whether the region of the memory device includes the trap cache segment. The memory function call is blocked and the process is treated as a potentially malicious process in response to determining that the region includes the trap cache segment.Type: GrantFiled: May 30, 2023Date of Patent: October 1, 2024Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Brian A. Rinaldi, Clint A. Hardy, Lokesh M. Gupta, Kevin J. Ash
-
Publication number: 20230306111Abstract: Provided are a computer program product, system, and method for using trap cache segments to detect malicious processes. A trap cache segment to the cache for data in the storage and indicated as a trap cache segment. Cache segments are added to the cache having data from the storage that are not indicated as trap cache segments. A memory function call from a process executing in the computer system reads data from a region of a memory device to output the read data to a buffer of the memory device. A determination is made as to whether the region of the memory device includes the trap cache segment. The memory function call is blocked and the process is treated as a potentially malicious process in response to determining that the region includes the trap cache segment.Type: ApplicationFiled: May 30, 2023Publication date: September 28, 2023Inventors: Brian A. Rinaldi, Clint A. Hardy, Lokesh M. Gupta, Kevin J. Ash
-
Patent number: 11714567Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a first storage pool to a second storage pool; identifying entries in a first table corresponding to rank extents in the first storage pool containing the data; allocating and synchronizing a plurality of second tables for the identified entries of the first table that are located in the volume; transferring the data associated with the volume from the rank extents in the first storage pool containing the data to one or more rank extents in the one or more ranks of the second storage pool; and updating the second tables to correspond to the transferred data in the one or more rank extents in the one or more ranks of the second storage pool.Type: GrantFiled: July 12, 2022Date of Patent: August 1, 2023Assignee: International Business Machines CorporationInventors: Hui Zhang, Clint A. Hardy, Karl A. Nielsen, Matthew J. Kalos, Qiang Xie
-
Patent number: 11681799Abstract: Provided are a computer program product, system, and method for using trap cache segments to detect malicious processes. A trap cache segment to the cache for data in the storage and indicated as a trap cache segment. Cache segments are added to the cache having data from the storage that are not indicated as trap cache segments. A memory function call from a process executing in the computer system reads data from a region of a memory device to output the read data to a buffer of the memory device. A determination is made as to whether the region of the memory device includes the trap cache segment. The memory function call is blocked and the process is treated as a potentially malicious process in response to determining that the region includes the trap cache segment.Type: GrantFiled: December 23, 2020Date of Patent: June 20, 2023Assignee: INTERNATIONAL BUSINES MACHINES CORPORATIONInventors: Brian A. Rinaldi, Clint A. Hardy, Lokesh M. Gupta, Kevin J. Ash
-
Patent number: 11531486Abstract: 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: GrantFiled: March 10, 2021Date of Patent: December 20, 2022Assignee: International Business Machines CorporationInventors: Hui Zhang, Clint A. Hardy, Karl A. Nielsen, Matthew J. Kalos, Qiang Xie
-
Publication number: 20220350519Abstract: A computer-implemented method according to one embodiment includes identifying a request to migrate data associated with a volume from a first storage pool to a second storage pool; identifying entries in a first table corresponding to rank extents in the first storage pool containing the data; allocating and synchronizing a plurality of second tables for the identified entries of the first table that are located in the volume; transferring the data associated with the volume from the rank extents in the first storage pool containing the data to one or more rank extents in the one or more ranks of the second storage pool; and updating the second tables to correspond to the transferred data in the one or more rank extents in the one or more ranks of the second storage pool.Type: ApplicationFiled: July 12, 2022Publication date: November 3, 2022Inventors: Hui Zhang, Clint A. Hardy, Karl A. Nielsen, Matthew J. Kalos, Qiang Xie
-
Patent number: 11467772Abstract: A method for improving destage performance to a RAID array is disclosed. In one embodiment, such a method periodically scans a cache for first strides that are ready to be destaged to a RAID array. While scanning the cache, the method identifies second strides that are not currently ready to be destaged to the RAID array, but will likely be ready to be destaged during a subsequent scan of the cache. The method initiates preemptive staging of any missing data of the second strides from the RAID array into the cache in preparation for the subsequent scan. Upon occurrence of the subsequent scan, the method destages, from the cache, the second strides from the cache to the RAID array. A corresponding system and computer program product are also disclosed.Type: GrantFiled: April 22, 2020Date of Patent: October 11, 2022Assignee: International Business Machines CorporationInventors: Lokesh Mohan Gupta, Clint A. Hardy, Brian Anthony Rinaldi, Karl Allen Nielsen
-
Patent number: 11442649Abstract: A method according to one embodiment includes identifying a request to migrate data associated with a volume from a source storage pool to a destination storage pool, identifying volume segment table (VST) entries corresponding to rank extents within the source storage pool containing the data, allocating and synchronizing small VSTs for the identified VST entries within the volume, allocating one or more rank extents within the destination storage pool, transferring the data associated with the volume from the rank extents within the source storage pool containing the data to the one or more rank extents in the one or more ranks of the destination storage pool, updating the small VSTs to correspond to the transferred data in the one or more rank extents in the one or more ranks of the destination storage pool, and freeing the data from the one or more rank extents within the source storage pool.Type: GrantFiled: December 21, 2020Date of Patent: September 13, 2022Assignee: International Business Machines CorporationInventors: Hui Zhang, Clint A. Hardy, Karl A. Nielsen, Matthew J. Kalos, Qiang Xie
-
Patent number: 11442826Abstract: A method for reducing incidents of data loss in redundant arrays of independent disks (RAIDs) having the same RAID level is disclosed. In one embodiment, such a method identifies, in a data storage environment, a set of RAIDs having a common RAID level. The method also identifies, in the set of RAIDs, higher risk storage drives having a failure risk above a threshold and lower risk storage drives having a failure risk below the threshold. The method swaps, within the RAIDs, higher risk storage drives with lower risk storage drives to more evenly distribute higher risk storage drives across the RAIDs. A corresponding system and computer program product are also disclosed.Type: GrantFiled: June 15, 2019Date of Patent: September 13, 2022Assignee: International Business Machines CorporationInventors: Lokesh M. Gupta, Matthew G. Borlick, Karl A. Nielsen, Clint A. Hardy, Brian A. Rinaldi
-
Patent number: 11366730Abstract: 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: GrantFiled: November 7, 2019Date of Patent: June 21, 2022Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Herve G. P. Andre, Matthew D. Carson, Rashmi Chandra, Clint A. Hardy, Larry Juarez, Tony Leung, Todd C. Sorenson