Patents by Inventor Michael Thomas Benhase
Michael Thomas Benhase 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: 9733991Abstract: Data operations, requiring a lock, are batched into a set of operations to be performed on a per-core basis. A global lock for the set of operations is periodically acquired, the set of operations is performed, and the global lock is freed so as to avoid excessive duty cycling of lock and unlock operations in the computing storage environment.Type: GrantFiled: September 14, 2012Date of Patent: August 15, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Kenneth Wayne Todd, David Blair Whitworth
-
Patent number: 9626113Abstract: A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.Type: GrantFiled: May 6, 2016Date of Patent: April 18, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Kenneth Wayne Todd
-
Publication number: 20160253107Abstract: A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count defined by a predetermined lower maximum count of Task Control Blocks (TCBs) of a rank for performing destage operations, and a higher maximum count of TCBs to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.Type: ApplicationFiled: May 6, 2016Publication date: September 1, 2016Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John ASH, Michael Thomas BENHASE, Lokesh Mohan GUPTA, Kenneth Wayne TODD
-
Patent number: 9430395Abstract: A method, system, and computer program product for grouping and dispatching scans in a cache directory of a processing environment is provided. A plurality of scan tasks is aggregated from a scan wait queue into a scan task queue. The plurality of scan tasks is determined by selecting one of (1) each of the plurality of scan tasks on the scan wait queue, (2) a predetermined number of the plurality of scan tasks on the scan wait queue, and (3) a set of scan tasks of a similar type on the scan wait queue. A first scan task from the plurality of scan tasks is selected from the scan task queue. The scan task is performed.Type: GrantFiled: August 11, 2008Date of Patent: August 30, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael Thomas Benhase, Susan Kay Candelaria, Lokesh Mohan Gupta, Kenneth Wayne Todd
-
Patent number: 9396102Abstract: For cache/data management in a computing storage environment, incoming data segments into a Non Volatile Storage (NVS) device of the computing storage environment are validated against a bitmap to determine if the incoming data segments are currently in use. Those of the incoming data segments determined to be currently in use are designated to the computing storage environment to protect data integrity.Type: GrantFiled: September 14, 2012Date of Patent: July 19, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Kenneth Wayne Todd
-
Patent number: 9367479Abstract: A processor, operable in a computing storage environment, for each rank in a storage management device in the computing storage environment, allocates a lower maximum count, and a higher maximum count, of Task Control Blocks (TCBs) to be implemented for performing a storage operation, and performs the storage operation using up to the lower maximum count of TCBs, yet only allows those TCBs above the lower maximum count to be allocated for performing the storage operation satisfying at least one criterion.Type: GrantFiled: November 7, 2013Date of Patent: June 14, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Kenneth Wayne Todd
-
Patent number: 9092155Abstract: A method for performing a write to a volume x in a cascaded architecture is described. In one embodiment, such a method includes determining whether the volume x has a child volume, wherein each of the volume x and the child volume have a target bit map (TBM) associated therewith. The method then determines whether the TBMs of both the volume x and the child volume are set. If the TBMs are set, the method finds a higher source (HS) volume from which to copy the desired data to the child volume. Finding the HS volume includes travelling up the cascaded architecture until the source of the data is found. Once the HS volume is found, the method copies the data from the HS volume to the child volume and performs the write to the volume x. A method for performing a read is also disclosed herein.Type: GrantFiled: March 15, 2013Date of Patent: July 28, 2015Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Jr., Theresa Mary Brown, Lokesh Mohan Gupta, Carol Santich Mellgren
-
Patent number: 9063945Abstract: An apparatus and method for copying data are disclosed. A data track to be replicated using a peer-to-peer remote copy (PPRC) operation is identified. The data track is encoded in a non-transitory computer readable medium disposed in a first data storage system. At a first time, a determination of whether the data track is stored in a data cache is made. At a second time, the data track is replicated to a non-transitory computer readable medium disposed in a second data storage system. The second time is later than the first time. If the data track was stored in the data cache at the first time, a cache manager is instructed to not demote the data track from the data cache. If the data track was not stored in the data cache at the first time, the cache manager is instructed that the data track may be demoted.Type: GrantFiled: June 14, 2011Date of Patent: June 23, 2015Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Lokesh Mohan Gupta, Joseph Smith Hyde, II, Warren Keith Stanley
-
Patent number: 9058217Abstract: A set of like tasks to be performed is organized into a first group. Upon a determined imbalance between dispatch queue depths greater than a predetermined threshold, the set of like tasks is reassigned to an additional group.Type: GrantFiled: September 14, 2012Date of Patent: June 16, 2015Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Trung Ngoc Nguyen
-
Patent number: 8918607Abstract: Embodiments of the disclosure relate to archiving data in a storage system. An exemplary embodiment comprises making a flash copy of data in a source volume, compressing data in the flash copy wherein each track of data is compressed into a set of data pages, and storing the compressed data pages in a target volume. Data extents for the target volume may be allocated from a pool of compressed data extents. After each stride worth of data is compressed and stored in the target volume, data may be destaged to avoid destage penalties. Data from the target volume may be decompressed from a flash copy of the target volume in a reverse process to restore each data track, when the archived data is needed. Data may be compressed and uncompressed using a Lempel-Ziv-Welch process.Type: GrantFiled: November 19, 2010Date of Patent: December 23, 2014Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Lokesh Mohan Gupta, Yu-Cheng Hsu, Alfred Emilio Sanchez
-
Patent number: 8892834Abstract: A method for performing a write to a volume x in a cyclic point-in-time-copy architecture is described. In one embodiment, such a method includes determining whether the volume x has a child volume. The method then determines whether the target bit maps (TBMs) of both the volume x and the child volume are set. If the TBMs are set, the method finds a higher source (HS) volume from which to copy the desired data to the child volume. Once the HS volume is found, the method determines whether the HS volume and the child volume are the same volume. If the HS volume and the child volume are not the same volume, the method copies the data from the HS volume to the child volume. The method then performs the write to the volume x.Type: GrantFiled: April 28, 2012Date of Patent: November 18, 2014Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Jr., Theresa Mary Brown, Lokesh Mohan Gupta, Carol Santich Mellgren
-
Publication number: 20140304548Abstract: A method for servicing a redundant array of independent storage drives (i.e., RAID) includes performing a service call on the RAID by performing the following steps: (1) determining whether the RAID includes one or more consumed spare storage drives; (2) in the event the RAID includes one or more consumed spare storage drives, physically replacing the one or more consumed spare storage drive with one or more non-consumed spare storage drives; and (3) initiating a copy process that copies data from a storage drive that is predicted to fail to a non-consumed spare storage drive associated with the RAID. The service call may then be terminated. After the service call is terminated, the method waits for an indication that a number of non-consumed spare storage drives in the RAID has fallen below a selected threshold. A corresponding apparatus and computer program product are also disclosed.Type: ApplicationFiled: April 3, 2013Publication date: October 9, 2014Applicant: International Business Machines CorporationInventors: Jeffrey Raymond Steffan, Michael Thomas Benhase, Volker Michael Kiemes
-
Patent number: 8850147Abstract: A method for deleting a relation between a source and a target in a multi-target architecture is described. The multi-target architecture includes a source and multiple targets mapped thereto. In one embodiment, such a method includes initially identifying a relation for deletion from the multi-target architecture. A target associated with the relation is then identified. The method then identifies a sibling target that inherits data from the target. Once the target and the sibling target are identified, the method copies the data from the target to the sibling target. The relation between the source and the target is then deleted. A corresponding computer program product is also disclosed and claimed herein.Type: GrantFiled: March 15, 2013Date of Patent: September 30, 2014Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Jr., Theresa Mary Brown, Lokesh Mohan Gupta, Carol Santich Mellgren
-
Patent number: 8843719Abstract: A method for performing a write to a source volume in a multi-target architecture is described. The multi-target architecture includes a source volume and multiple target volumes mapped thereto. In one embodiment, such a method includes copying data in a track of the source volume to a corresponding track of a target volume (target x). The method enables one or more sibling target volumes (siblings) mapped to the source volume to inherit the data from the target x. When the data is successfully copied to the target x, the method performs a write to the track of the source volume. Other methods for reading and writing data to volumes in the multi-target architecture are also described.Type: GrantFiled: March 15, 2013Date of Patent: September 23, 2014Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Theresa Mary Brown, Lokesh Mohan Gupta, Carol Santich Mellgren
-
Patent number: 8832379Abstract: A processor, operable in a computing storage environment, allocates portions of a Scatter Index Table (SIT) disproportionately between a larger portion dedicated for meta data tracks, and a smaller portion dedicated for user data tracks, and processes a storage operation through the disproportionately allocated portions of the SIT using an allocated number of Task Control Blocks (TCB).Type: GrantFiled: September 14, 2012Date of Patent: September 9, 2014Assignee: International Business Machines CorporationInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, Kenneth Wayne Todd
-
Patent number: 8782362Abstract: A method for performing a write to a volume x in a cyclic point-in-time-copy architecture is described. In one embodiment, such a method includes determining whether the volume x has a child volume. The method then determines whether the target bit maps (TBMs) of both the volume x and the child volume are set. If the TBMs are set, the method finds a higher source (HS) volume from which to copy the desired data to the child volume. Once the HS volume is found, the method determines whether the HS volume and the child volume are the same volume. If the HS volume and the child volume are not the same volume, the method copies the data from the HS volume to the child volume. The method then performs the write to the volume x. A corresponding computer program product is also described.Type: GrantFiled: March 8, 2011Date of Patent: July 15, 2014Assignee: International Business Machines CorporationInventors: Michael Thomas Benhase, Jr., Theresa Mary Brown, Lokesh Mohan Gupta, Carol Santich Mellgren
-
Patent number: 8738821Abstract: Provided are a method for selecting a path comprising ports on primary and secondary clusters to use to transmit data at a primary volume to a secondary volume. A request is received to copy data from a primary storage location to a secondary storage location. A determination is made from a plurality of primary clusters of an owner primary cluster for the primary storage location, wherein the primary clusters are configured to access the primary storage location. A determination is made as to whether there is at least one port on the owner primary cluster providing an available path to the secondary storage location. One port on the owner primary cluster is selected to use to copy the data to the secondary storage location in response to determining that there is at least one port on the owner primary cluster available to transmit to the secondary storage location.Type: GrantFiled: November 18, 2005Date of Patent: May 27, 2014Assignee: International Business Machines CorporationInventors: Steven Edward Klein, Michael Thomas Benhase, James Chien-Chiung Chen, Minh-Ngoc Le Huynh
-
Patent number: 8719504Abstract: For a plurality of input/output (I/O) operations waiting to assemble complete data tracks from data segments, a process, separate from a process responsible for the data assembly into the complete data tracks, is initiated for waking a predetermined number of the waiting I/O operations. A total number of I/O operations to be awoken at each of an iterated instance of the waking is limited.Type: GrantFiled: September 14, 2012Date of Patent: May 6, 2014Assignee: International Business Machines CorporationInventors: Kevin John Ash, Michael Thomas Benhase, Lokesh Mohan Gupta, David Blair Whitworth
-
Publication number: 20140082292Abstract: A processor, operable in a computing storage environment, allocates portions of a Scatter Index Table (SIT) disproportionately between a larger portion dedicated for meta data tracks, and a smaller portion dedicated for user data tracks, and processes a storage operation through the disproportionately allocated portions of the SIT using an allocated number of Task Control Blocks (TCB).Type: ApplicationFiled: September 14, 2012Publication date: March 20, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John ASH, Michael Thomas BENHASE, Lokesh Mohan GUPTA, Kenneth Wayne TODD
-
Publication number: 20140082254Abstract: For cache/data management in a computing storage environment, incoming data segments into a Non Volatile Storage (NVS) device of the computing storage environment are validated against a bitmap to determine if the incoming data segments are currently in use. Those of the incoming data segments determined to be currently in use are designated to the computing storage environment to protect data integrity.Type: ApplicationFiled: September 14, 2012Publication date: March 20, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kevin John ASH, Michael Thomas BENHASE, Lokesh Mohan GUPTA, Kenneth Wayne TODD