Patents by Inventor Kyle Barret Dudgeon
Kyle Barret Dudgeon 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: 10223205Abstract: Various embodiments for failure recovery in a computing environment following a data restoration are provided. A catalog locate is performed for each of a plurality of data sets on a base catalog structure (BCS), identifying a plurality of BCS entries. If a first BCS entry is cataloged incorrectly, the first BCS entry is designated to be re-cataloged. The plurality of BCS entries is compared with a plurality of volume table of contents and a plurality of VSAM volume data set (VTOC/VVDS) entries. If a second BCS entry found in the plurality of BCS entries is not found in the plurality of VTOC/VVDS entries, and the second BCS entry indicates that a data set associated with the second BCS entry is located on a volume, an attempt is made to vary on the volume. If the volume cannot be varied on, a request is created to restore the volume.Type: GrantFiled: January 15, 2009Date of Patent: March 5, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Darrell Christopher Clarke, Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
-
Patent number: 8984252Abstract: Data is added to a data set to cause a growth in size of the data set, wherein the data set belongs to a storage group, and wherein the data set is comprised of extents. The data set is included into a new storage group, in response to determining that the growth in the size of the data set has caused a predetermined threshold for a size limit of the storage group to be exceeded. The extents of the data set are restructured to satisfy a predetermined condition on the extents of the data set, in response to determining that the growth in the size of the data set has caused the predetermined condition on the extents included in the data set to be not satisfied.Type: GrantFiled: January 22, 2009Date of Patent: March 17, 2015Assignee: International Business Machines CorporationInventors: Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
-
Patent number: 8909891Abstract: Method embodiments for facilitating overflow storage of special data sets that reside on a single logical volume are provided. A virtual logical volume is created from unallocated memory units across a plurality of logical volumes in a volume group. The virtual logical volume appears the same as any one of the logical volumes in the volume group to an external client. Upon receipt of a special data set that must reside in a single logical volume, an attempt is first made to allocate the special data set to one of the logical volumes in the volume group. If that allocation attempt fails, the special data set is allocated to the virtual logical volume. The virtual logical volume may be created only upon the failure to allocate the special data set to one of the logical volumes, and may be destroyed if sufficient space in one of the logical volumes is freed up to transfer the special data set.Type: GrantFiled: July 21, 2011Date of Patent: December 9, 2014Assignee: International Business Machines CorporationInventors: David Charles Reed, Max Douglas Smith, Kyle Barret Dudgeon, Esteban Rios
-
Patent number: 8606822Abstract: A method to optimize use of available storage capacity of a plurality of sequential data storage media, wherein the method provides (M) sequential data storage media each comprising a plurality of blockids, where the (i)th sequential data storage medium comprises an (i)th available storage capacity, and where (M) is greater than or equal to 2, and where (i) is greater than or equal to 1 and less than or equal to (M). The method then receives source data comprising a plurality of segments, determines a quantum of data to store, determines if the quantum of data to store is substantially equal to an (i)th available storage capacity. If the quantum of data to store is substantially equal an (i)th available storage capacity, then the method writes the source data to an (i)th sequential data storage medium.Type: GrantFiled: August 15, 2008Date of Patent: December 10, 2013Assignee: International Business Machines CorporationInventors: Kyle Barret Dudgeon, Harold Steven Huber, David Charles Reed, Max Douglas Smith
-
Patent number: 8539184Abstract: A method to dynamically adjust the amount of free space in a storage group is disclosed herein. In certain embodiments, such a method may include monitoring the amount of free space in an active storage group. The method may further include maintaining an overflow storage group containing unused volumes. When the free space in the active storage group falls below a lower threshold value, the method may automatically move a volume from the overflow storage group to the active storage group. Conversely, when the free space in the active storage group exceeds an upper threshold value, the method may automatically transfer data from a volume in the active storage group to other volumes in the active storage group, and move the volume from the active storage group to the overflow storage group. A corresponding computer program product and apparatus are also disclosed herein.Type: GrantFiled: September 23, 2009Date of Patent: September 17, 2013Assignee: International Business Machines CorporationInventors: Kyle Barret Dudgeon, Dustin A. Helak, David Charles Reed, Esteban Rios, Max Douglas Smith
-
Publication number: 20100185589Abstract: Various embodiments for failure recovery in a computing environment following a data restoration are provided. A catalog locate is performed for each of a plurality of data sets on a base catalog structure (BCS), identifying a plurality of BCS entries. If a first BCS entry is cataloged incorrectly, the first BCS entry is designated to be re-cataloged. The plurality of BCS entries is compared with a plurality of volume table of contents and a plurality of VSAM volume data set (VTOC/VVDS) entries. If a second BCS entry found in the plurality of BCS entries is not found in the plurality of VTOC/VVDS entries, and the second BCS entry indicates that a data set associated with the second BCS entry is located on a volume, an attempt is made to vary on the volume. If the volume cannot be varied on, a request is created to restore the volume.Type: ApplicationFiled: January 15, 2009Publication date: July 22, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Darrell Christopher Clarke, Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
-
Publication number: 20100185829Abstract: Data is added to a data set to cause a growth in size of the data set, wherein the data set belongs to a storage group, and wherein the data set is comprised of extents. The data set is included into a new storage group, in response to determining that the growth in the size of the data set has caused a predetermined threshold for a size limit of the storage group to be exceeded. The extents of the data set are restructured to satisfy a predetermined condition on the extents of the data set, in response to determining that the growth in the size of the data set has caused the predetermined condition on the extents included in the data set to be not satisfied.Type: ApplicationFiled: January 22, 2009Publication date: July 22, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kyle Barret Dudgeon, Miguel Angel Perez, David Charles Reed, Max Douglas Smith
-
Publication number: 20100042663Abstract: A method to optimize use of available storage capacity of a plurality of sequential data storage media, wherein the method provides (M) sequential data storage media each comprising a plurality of blockids, where the (i)th sequential data storage medium comprises an (i)th available storage capacity, and where (M) is greater than or equal to 2, and where (i) is greater than or equal to 1 and less than or equal to (M). The method then receives source data comprising a plurality of segments, determines a quantum of data to store, determines if the quantum of data to store is substantially equal to an (i)th available storage capacity. If the quantum of data to store is substantially equal an (i)th available storage capacity, then the method writes the source data to an (i)th sequential data storage medium.Type: ApplicationFiled: August 15, 2008Publication date: February 18, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Kyle Barret Dudgeon, Harold Steven Huber, David Charles Reed, Max Douglas Smith