Patents by Inventor Michael R. Groseclose
Michael R. Groseclose 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: 10387375Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to determine a present rate of access to data; select at least one sample of data; determine the greatest degree of compression of said data compression engines; determine the compression ratios of the operated data compression engines with respect to the selected sample(s); compressing said selected at least one sample with a plurality of said data compression engines at said selected tier; operate a selected data compression engines with respect to the selected sample and determine the greatest degree of compression of the data compression engines; compress the data from which the sample was selected with one of the operated data compression engines determined to have the greatest degree of compression; and store the compressed data in data storage repositories.Type: GrantFiled: January 5, 2017Date of Patent: August 20, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael R. Groseclose, Larry Juarez, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades
-
Publication number: 20170116233Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to determine a present rate of access to data; select at least one sample of data; determine the greatest degree of compression of said data compression engines; determine the compression ratios of the operated data compression engines with respect to the selected sample(s); compressing said selected at least one sample with a plurality of said data compression engines at said selected tier; operate a selected data compression engines with respect to the selected sample and determine the greatest degree of compression of the data compression engines; compress the data from which the sample was selected with one of the operated data compression engines determined to have the greatest degree of compression; and store the compressed data in data storage repositories.Type: ApplicationFiled: January 5, 2017Publication date: April 27, 2017Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael R. GROSECLOSE, Larry JUAREZ, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. RHOADES
-
Patent number: 9569474Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to determine a present rate of access to data; select at least one sample of data; determine the greatest degree of compression of said data compression engines; determine the compression ratios of the operated data compression engines with respect to the selected sample(s); compressing said selected at least one sample with a plurality of said data compression engines at said selected tier; operate a selected data compression engines with respect to the selected sample and determine the greatest degree of compression of the data compression engines; compress the data from which the sample was selected with one of the operated data compression engines determined to have the greatest degree of compression; and store the compressed data in data storage repositories.Type: GrantFiled: March 20, 2014Date of Patent: February 14, 2017Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael R. Groseclose, Larry Juarez, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades
-
Patent number: 9104604Abstract: Exemplary embodiments of the present invention disclose a method and system for reducing a probability of generating an unrecoverable error on a disk array during a disk rebuild. In a step, an exemplary embodiment identifies a disk to be replaced in the disk array, the disk array including a spare disk. In another step, an exemplary embodiment locates a region in the disk array that incurs a high number of reads and writes during a period prior to replacing the disk in the disk array. In another step, an exemplary embodiment scrubs data in a region in the disk array that has incurred a high number of accesses. In another step, an exemplary embodiment replaces the disk identified to be replaced with the spare disk in the disk array. In another step, an exemplary embodiment rebuilds data on the replaced disk on the spare disk in the disk array.Type: GrantFiled: February 26, 2013Date of Patent: August 11, 2015Assignee: International Business Machines CorporationInventors: Alastair G. Cooper, Michael R. Groseclose, Jr., David R. Kahler, Kurt A. Lovrien
-
Publication number: 20140207745Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to determine a present rate of access to data; select at least one sample of data; determine the greatest degree of compression of said data compression engines; determine the compression ratios of the operated data compression engines with respect to the selected sample(s); compressing said selected at least one sample with a plurality of said data compression engines at said selected tier; operate a selected data compression engines with respect to the selected sample and determine the greatest degree of compression of the data compression engines; compress the data from which the sample was selected with one of the operated data compression engines determined to have the greatest degree of compression; and store the compressed data in data storage repositories.Type: ApplicationFiled: March 20, 2014Publication date: July 24, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael R. GROSECLOSE, Larry JUAREZ, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. RHOADES
-
Patent number: 8769225Abstract: In one embodiment, pursuant to migrating the data from the first to the second storage medium, the data is allocated to the second storage medium while retaining an allocation of the data in the first storage medium. If the data is migrated from the second storage medium back to the first storage medium, the data is pointed to the allocation of the data in the first storage medium to alleviate data movement from the second storage medium to the first storage medium. If the allocation of the data in the first storage medium is determined to be needed for other data, the allocation of the data in the first storage medium is freed.Type: GrantFiled: April 27, 2012Date of Patent: July 1, 2014Assignee: International Business Machines CorporationInventors: Dale H. Anderson, Philip M. Doatmas, Michael R. Groseclose, Jr., Paul A. Jennas, II, Larry Juarez, Brian S. McCain, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson, David V. Valverde
-
Patent number: 8762667Abstract: In one embodiment, pursuant to migrating the data from the first to the second storage medium, the data is allocated to the second storage medium while retaining an allocation of the data in the first storage medium. If the data is migrated from the second storage medium back to the first storage medium, the data is pointed to the allocation of the data in the first storage medium to alleviate data movement from the second storage medium to the first storage medium. If the allocation of the data in the first storage medium is determined to be needed for other data, the allocation of the data in the first storage medium is freed.Type: GrantFiled: February 1, 2010Date of Patent: June 24, 2014Assignee: International Business Machines CorporationInventors: Dale H. Anderson, Philip M. Doatmas, Michael R. Groseclose, Jr., Paul A. Jennas, II, Larry Juarez, Brian S. McCain, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson, David V. Valverde
-
Publication number: 20120290747Abstract: A method for more effectively distributing the I/O workload in a data replication system is disclosed herein. In selected embodiments, such a method may include generating an I/O request and identifying a storage resource group associated with the I/O request. In the event the I/O request is associated with a first storage resource group, the I/O request may be directed to a first storage device and a copy of the I/O request may be mirrored from the first storage device to a second storage device. Alternatively, in the event the I/O request is associated with a second storage resource group, the I/O request may be directed to a second storage device and a copy of the I/O request may be mirrored from the second storage device to the first storage device.Type: ApplicationFiled: April 16, 2012Publication date: November 15, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20120221822Abstract: In one embodiment, pursuant to migrating the data from the first to the second storage medium, the data is allocated to the second storage medium while retaining an allocation of the data in the first storage medium. If the data is migrated from the second storage medium back to the first storage medium, the data is pointed to the allocation of the data in the first storage medium to alleviate data movement from the second storage medium to the first storage medium. If the allocation of the data in the first storage medium is determined to be needed for other data, the allocation of the data in the first storage medium is freed.Type: ApplicationFiled: April 27, 2012Publication date: August 30, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dale H. ANDERSON, Philip M. DOATMAS, Michael R. GROSECLOSE, JR., Paul A. JENNAS, II, Larry JUAREZ, Brian S. McCAIN, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. RHOADES, Todd C. SORENSON, David V. VALVERDE
-
Publication number: 20120203996Abstract: A method for managing extents in a data storage system includes monitoring usage statistics for an extent residing on one or more powered-up storage devices. In the event the extent has not been accessed for specified period of time (as determined from the usage statistics), the method automatically compresses the extent and migrates the extent to an intermediate repository. Once the amount of data in the intermediate repository reaches a specified level, the method migrates the extent from the intermediate repository to one or more normally powered-down storage devices. If I/O is received for the extent while it resides in the normally powered-down storage devices or the intermediate repository, the method automatically migrates the extent from the normally powered-down storage devices or the intermediate repository to the normally powered-up storage devices. A corresponding apparatus and computer program product are also disclosed.Type: ApplicationFiled: April 16, 2012Publication date: August 9, 2012Applicant: International Business Machines CorporationInventors: Dale H. Anderson, Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, Brian S. McCain, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20110191558Abstract: A method for managing extents in a data storage system includes monitoring usage statistics for an extent residing on one or more powered-up storage devices. In the event the extent has not been accessed for specified period of time (as determined from the usage statistics), the method automatically compresses the extent and migrates the extent to an intermediate repository. Once the amount of data in the intermediate repository reaches a specified level, the method migrates the extent from the intermediate repository to one or more normally powered-down storage devices. If I/O is received for the extent while it resides in the normally powered-down storage devices or the intermediate repository, the method automatically migrates the extent from the normally powered-down storage devices or the intermediate repository to the normally powered-up storage devices. A corresponding apparatus and computer program product are also disclosed.Type: ApplicationFiled: February 2, 2010Publication date: August 4, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dale H. Anderson, Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, Brian S. McCain, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20110191556Abstract: Exemplary method, system, and computer program embodiments for data migration between first and second storage mediums of an available plurality of storage mediums in a computing storage environment are provided. In one embodiment, pursuant to migrating the data from the first to the second storage medium, the data is allocated to the second storage medium while retaining an allocation of the data in the first storage medium. If the data is migrated from the second storage medium back to the first storage medium, the data is pointed to the allocation of the data in the first storage medium to alleviate data movement from the second storage medium to the first storage medium. If the allocation of the data in the first storage medium is determined to be needed for other data, the allocation of the data in the first storage medium is freed.Type: ApplicationFiled: February 1, 2010Publication date: August 4, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dale H. ANDERSON, Philip M. DOATMAS, Michael R. GROSECLOSE, JR., Paul A. JENNAS, II, Larry JUAREZ, Brian S. McCAIN, David MONTGOMERY, Jason L. PEIPELMAN, Joshua M. RHOADES, Todd C. SORENSON, David V. VALVERDE
-
Publication number: 20110093862Abstract: A method for more effectively distributing the I/O workload in a data replication system is disclosed herein. In selected embodiments, such a method may include generating an I/O request and identifying a storage resource group associated with the I/O request. In the event the I/O request is associated with a first storage resource group, the I/O request may be directed to a first storage device and a copy of the I/O request may be mirrored from the first storage device to a second storage device. Alternatively, in the event the I/O request is associated with a second storage resource group, the I/O request may be directed to a second storage device and a copy of the I/O request may be mirrored from the second storage device to the first storage device. A corresponding system, apparatus, and computer program product are also disclosed and claimed herein.Type: ApplicationFiled: October 20, 2009Publication date: April 21, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip M. Doatmas, Michael R. Groseclose, Paul A. Jennas, Larry Juarez, David Montgomery, Jason L. Peipelman, Joshua M. Rhoades, Todd C. Sorenson
-
Publication number: 20110082842Abstract: A data storage subsystem having a plurality of data compression engines configured to compress data, each having a different compression algorithm. A data handling system is configured to select at least one sample of data; operate a plurality of the data compression engines to compress the selected sample(s); determine the compression ratios of the operated data compression engines with respect to the selected sample(s); and select the data compression engine having the greatest compression ratio with respect to the selected sample(s), to compress the data. Further, the data compression engines may be in tiers from low to high in accordance with expected latency to compress data and to uncompress compressed data; and a data compression engine is selected from a tier that is inverse to the present rate of access.Type: ApplicationFiled: October 6, 2009Publication date: April 7, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: MICHAEL R. GROSECLOSE, JR., LARRY JUAREZ, DAVID MONTGOMERY, JASON L. PEIPELMAN, JOSHUA M. RHOADES
-
Patent number: 7607043Abstract: A system for analyzing mutually exclusive conflicts among a plurality of redundant devices in a computer system includes a data management module operable on the computer system. The data management module parses through status data generated by the plurality of redundant devices to identify an error condition in one of the plurality of redundant devices, generate metadata describing the error condition, and take action to resolve the error condition. A method of analyzing mutually exclusive conflicts among redundant devices in a computer system includes collecting status data from the redundant devices, identifying an error condition, generating metadata describing the condition, analyzing the metadata to determine a lowest-level or least impacting redundant device that is the root cause of the condition, and taking an action to resolve the condition.Type: GrantFiled: January 4, 2006Date of Patent: October 20, 2009Assignee: International Business Machines CorporationInventors: Timothy J. Crawford, Michael R. Groseclose, Jr., David A. Larson