Patents by Inventor Richard B. Stelmach
Richard B. Stelmach 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: 10628089Abstract: 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: GrantFiled: January 22, 2019Date of Patent: April 21, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
-
Patent number: 10613934Abstract: For managing RAID parity stripe contention using a processor device in a computing environment, delaying, by a host being separate to the RAID, one of a plurality of operations overlapping a parity sector in a parity stripe with a currently running operation and serializing each one of the multiplicity of operations overlapping the parity sector. The host further serializes each one of the plurality of operations overlapping the parity sector. The delaying is performed when the host determines whether a new write written through a hardware performance path comprising the one of the plurality of operations will overlap the parity stripe of a previous write comprising the currently running operation at the RAID controller.Type: GrantFiled: November 30, 2017Date of Patent: April 7, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach
-
Publication number: 20190155509Abstract: 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: ApplicationFiled: January 22, 2019Publication date: May 23, 2019Inventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
-
Patent number: 10223012Abstract: 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: GrantFiled: March 2, 2017Date of Patent: March 5, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
-
Publication number: 20180253237Abstract: 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: ApplicationFiled: March 2, 2017Publication date: September 6, 2018Inventors: Matthew G. Borlick, Clint A. Hardy, Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach, Hui Zhang
-
Publication number: 20180081760Abstract: For managing RAID parity stripe contention using a processor device in a computing environment, delaying, by a host being separate to the RAID, one of a plurality of operations overlapping a parity sector in a parity stripe with a currently running operation and serializing each one of the multiplicity of operations overlapping the parity sector. The host further serializes each one of the plurality of operations overlapping the parity sector. The delaying is performed when the host determines whether a new write written through a hardware performance path comprising the one of the plurality of operations will overlap the parity stripe of a previous write comprising the currently running operation at the RAID controller.Type: ApplicationFiled: November 30, 2017Publication date: March 22, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew J. KALOS, Karl A. NIELSEN, Richard B. STELMACH
-
Patent number: 9891993Abstract: For managing RAID parity stripe contention using a processor device in a computing environment, delaying one of a multiplicity of operations overlapping a parity sector in a parity stripe with a currently running operation and serializing each one of the multiplicity of operations overlapping the parity sector.Type: GrantFiled: May 23, 2014Date of Patent: February 13, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew J. Kalos, Karl A. Nielsen, Richard B. Stelmach
-
Publication number: 20150339194Abstract: For managing RAID parity stripe contention using a processor device in a computing environment, delaying one of a multiplicity of operations overlapping a parity sector in a parity stripe with a currently running operation and serializing each one of the multiplicity of operations overlapping the parity sector.Type: ApplicationFiled: May 23, 2014Publication date: November 26, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Matthew J. KALOS, Karl A. NIELSEN, Richard B. STELMACH
-
Patent number: 8667245Abstract: Provided are techniques for migrating a first extent, determining a spatial distance between the first extent and a second extent, determining a ratio of a profiling score of the second extent to the spatial distance, and, in response to determining that the ratio exceeds a threshold, migrating the second extent.Type: GrantFiled: January 17, 2013Date of Patent: March 4, 2014Assignee: International Business Machines CorporationInventors: Pui Fun Lau, David Montgomery, Karl A. Nielsen, Richard B. Stelmach
-
Patent number: 8601348Abstract: Provided are a method, system, and article of manufacture for error checking addressable blocks in storage. Addressable blocks of data are stored in a storage in stripes, wherein each stripe includes a plurality of data blocks for one of the addressable blocks and at least one checksum block including checksum data for the addressable block. A write request is received to modify data in one of the addressable blocks. The write and updating the checksum are performed in the stripe having the modified addressable block. An indication is made to perform an error checking operation on the stripe for the modified addressable block in response to the write request, wherein the error checking operation reads the data blocks and the checksum in the stripe to determine if the checksum data is accurate. An error handling operation is initiated in response to determining that the checksum data is not accurate.Type: GrantFiled: January 15, 2013Date of Patent: December 3, 2013Assignee: International Business Machines CorporationInventors: James L. Hafner, David R. Kahler, Robert A. Kubo, David F. Mannenbach, Karl A. Nielsen, James A. O'Connor, Richard B. Stelmach, Krishnakumar R. Surugucchi
-
Patent number: 8433868Abstract: Method, system, and computer program product embodiments for concurrent copy of system configuration global metadata in a data storage system are provided. In one exemplary embodiment, a global data rank is quiesced, followed by an unquiesce of the global data rank except for a global metadata area. The global metadata area is updated in memory, and then unquiesced. A current range of the global metadata area to be copied is quiesced. The current range of the global metadata area is copied from a source area to a target area. The current range is unquiesced. The steps of quiescing an additional current range, copying the range from a source area to a target area, and unquiescing the current range continue until the entire global metadata area has been copied.Type: GrantFiled: January 25, 2010Date of Patent: April 30, 2013Assignee: International Business Machines CorporationInventors: Karl A. Nielsen, Richard A. Ripberger, Jacob L. Sheppard, Richard B. Stelmach
-
Patent number: 8380958Abstract: Provided are techniques for migrating a first extent, determining a spatial distance between the first extent and a second extent, determining a ratio of a profiling score of the second extent to the spatial distance, and, in response to determining that the ratio exceeds a threshold, migrating the second extent.Type: GrantFiled: November 9, 2010Date of Patent: February 19, 2013Assignee: International Business Machines CorporationInventors: Pui Fun Lau, David Montgomery, Karl A. Nielsen, Richard B. Stelmach
-
Patent number: 8375186Abstract: Provided are techniques for migrating a first extent, determining a spatial distance between the first extent and a second extent, determining a ratio of a profiling score of the second extent to the spatial distance, and, in response to determining that the ratio exceeds a threshold, migrating the second extent.Type: GrantFiled: May 11, 2012Date of Patent: February 12, 2013Assignee: International Business Machines CorporationInventors: Pui Fun Lau, David Montgomery, Karl A. Nielsen, Richard B. Stelmach
-
Patent number: 8370715Abstract: Provided are a method, system, and article of manufacture for error checking addressable blocks in storage. Addressable blocks of data are stored in a storage in stripes, wherein each stripe includes a plurality of data blocks for one of the addressable blocks and at least one checksum block including checksum data derived from the data blocks for the addressable block. A write request is received to modify data in one of the addressable blocks. The write and updating the checksum are performed in the stripe having the modified addressable block. An indication is made to perform an error checking operation on the stripe for the modified addressable block in response to the write request, wherein the error checking operation reads the data blocks and the checksum in the stripe to determine if the checksum data is accurate. An error handling operation is initiated in response to determining that the checksum data is not accurate.Type: GrantFiled: April 12, 2007Date of Patent: February 5, 2013Assignee: International Business Machines CorporationInventors: James Lee Hafner, David Ray Kahler, Robert Akira Kubo, David Frank Mannenbach, Karl Allen Nielsen, James A. O'Connor, Krishnakumar Rao Surugucchi, Richard B. Stelmach
-
Publication number: 20120226859Abstract: Provided are techniques for migrating a first extent, determining a spatial distance between the first extent and a second extent, determining a ratio of a profiling score of the second extent to the spatial distance, and, in response to determining that the ratio exceeds a threshold, migrating the second extent.Type: ApplicationFiled: May 11, 2012Publication date: September 6, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Pui Fun Lau, David Montgomery, Karl A. Nielsen, Richard B. Stelmach
-
Publication number: 20120117349Abstract: Provided are techniques for migrating a first extent, determining a spatial distance between the first extent and a second extent, determining a ratio of a profiling score of the second extent to the spatial distance, and, in response to determining that the ratio exceeds a threshold, migrating the second extent.Type: ApplicationFiled: November 9, 2010Publication date: May 10, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Pui Fun Lau, David Montgomery, Karl A. Nielsen, Richard B. Stelmach
-
Publication number: 20110185137Abstract: Method, system, and computer program product embodiments for concurrent copy of system configuration global metadata in a data storage system are provided. In one exemplary embodiment, a global data rank is quiesced, followed by an unquiesce of the global data rank except for a global metadata area. The global metadata area is updated in memory, and then unquiesced. A current range of the global metadata area to be copied is quiesced. The current range of the global metadata area is copied from a source area to a target area. The current range is unquiesced. The steps of quiescing an additional current range, copying the range from a source area to a target area, and unquiescing the current range continue until the entire global metadata area has been copied.Type: ApplicationFiled: January 25, 2010Publication date: July 28, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Karl A. NIELSEN, Richard A. RIPBERGER, Jacob L. SHEPPARD, Richard B. STELMACH
-
Patent number: 7577804Abstract: Provided are a method, system, and article of manufacture for detecting data integrity. An indicator is written to invalidate a data block that is capable of being stored in a plurality of sectors of a storage device, wherein the indicator is written to the storage device in at least one sector that is not included in the plurality of sectors. A writing of entire contents of the data block to the plurality of sectors of the storage device is initiated, in response to the writing of the indicator. The indicator is updated to validate the data block, in response to a completion of the writing of the entire contents of the data block to the plurality of sectors of the storage device.Type: GrantFiled: October 6, 2004Date of Patent: August 18, 2009Assignee: International Business Machines CorporationInventors: Michael P. Vageline, Michael John Jones, Richard B. Stelmach, Yu-Cheng Hsu, Richard Anthony Ripberger
-
Patent number: 7529776Abstract: A bad track in a disk device in a data storage system is recovered by determining which cluster in the system the bad track belongs to. If the track belongs to the cluster that discovered that the track was bad, that cluster recovers the track by locating a good copy of the track, staging the good copy of the track to cache, and destaging the good copy of the track storage unit from the cache to all copies of the track, whether good or bad, in the data storage system. If the track belongs to another cluster, the cluster that discovered that the track was bad sends a message to the other cluster to inform it of the bad track, and the other cluster recovers the bad track. In another aspect, all tracks are owned by one server or server cluster, which performs the staging and destaging.Type: GrantFiled: January 7, 2005Date of Patent: May 5, 2009Assignee: International Business Machines CorporationInventors: Suguang Li, David F. Mannenbach, Karl A. Nielsen, Richard B. Stelmach
-
Publication number: 20080256420Abstract: Provided are a method, system, and article of manufacture for error checking addressable blocks in storage. Addressable blocks of data are stored in a storage in stripes, wherein each stripe includes a plurality of data blocks for one of the addressable blocks and at least one checksum block including checksum data derived from the data blocks for the addressable block. A write request is received to modify data in one of the addressable blocks. The write and updating the checksum are performed in the stripe having the modified addressable block. An indication is made to perform an error checking operation on the stripe for the modified addressable block in response to the write request, wherein the error checking operation reads the data blocks and the checksum in the stripe to determine if the checksum data is accurate. An error handling operation is initiated in response to determining that the checksum data is not accurate.Type: ApplicationFiled: April 12, 2007Publication date: October 16, 2008Applicant: International Business Machines CorporationInventors: James Lee Hafner, David Ray Kahler, Robert Akira Kubo, David Frank Mannenbach, Karl Allen Nielsen, James A. O'Connor, Krishnakumar Rao Surugucchi, Richard B. Stelmach