Patents by Inventor Philip R. Chauvet
Philip R. Chauvet 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: 9298381Abstract: System and method embodiments for monitoring data integrity among multiple sysplexes that share data sets on a DASD are provided. The virtual volume record (VVR) for each data set on DASD is configured with additional access fields that provide such information as the access mode (serial or multi-access), whether multiple systems have opened the data set, the names of an original sysplex and any additional sysplexes to open the data set, the names of the opening systems in each sysplex, job name and time stamp and a usage counter for each sysplex. Additional access logic in the OS on each system defines specific actions to be taken by the system OS when executing an “open” or “close” including reading and updating information in the additional access fields and generating error, warning or information messages to diagnostic logs. This allows serialization to be enforced among the sysplexes and for error messages to be issued for any system outside the original sysplex that tries to open the data set.Type: GrantFiled: May 30, 2014Date of Patent: March 29, 2016Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20150356124Abstract: A method, system, and computer program product for managing data sets of a storage facility is disclosed. The method, system, and computer program product include determining, by analyzing a first data set, that the first data set includes a first record having padded data. To identify the padded data, the method, system, and computer program product include comparing at least a portion of the first record of the first data set with a second record of a second data set. Next, the method, system, and computer program product include removing, from the first record of the first data set, the padded data.Type: ApplicationFiled: June 5, 2014Publication date: December 10, 2015Applicant: International Business Machines CorporationInventors: Philip R. Chauvet, Franklin E. McCune, David C. Reed, Max D. Smith
-
Publication number: 20150347045Abstract: System and method embodiments for monitoring data integrity among multiple sysplexes that share data sets on a DASD are provided. The virtual volume record (VVR) for each data set on DASD is configured with additional access fields that provide such information as the access mode (serial or multi-access), whether multiple systems have opened the data set, the names of an original sysplex and any additional sysplexes to open the data set, the names of the opening systems in each sysplex, job name and time stamp and a usage counter for each sysplex. Additional access logic in the OS on each system defines specific actions to be taken by the system OS when executing an “open” or “close” including reading and updating information in the additional access fields and generating error, warning or information messages to diagnostic logs. This allows serialization to be enforced among the sysplexes and for error messages to be issued for any system outside the original sysplex that tries to open the data set.Type: ApplicationFiled: May 30, 2014Publication date: December 3, 2015Applicant: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9037901Abstract: An approach to providing auto recovery of data sets in volumes. When an error condition results from an attempt to access an unintentionally deleted data set, an event is generated and sent to other systems with access to the volume in which the data set existed. The volume is also locked to prevent corruption during the recovery process. A system that has the unintentionally deleted data set open retrieves location information for the data set from control blocks in the system's memory. This location information is used to build a new entry for the data set in the VTOC for the volume. When the data set is thus recovered, the data set is validated, the lock removed, and the data set is made available to the systems sharing the volume.Type: GrantFiled: August 19, 2011Date of Patent: May 19, 2015Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Max D. Smith, Keith R. Smith
-
Publication number: 20150026137Abstract: Provided are a computer program product, system, and method for recovering from a pending uncompleted reorganization of a data set managing data sets in a storage. In response an initiation of an operation to access a data set, an operation is initiated to complete a pending uncompleted reorganization of the data set in response to the data set being in a pending uncompleted reorganization state and no other process currently accessing the data set.Type: ApplicationFiled: July 17, 2013Publication date: January 22, 2015Inventors: Philip R. Chauvet, Charles J. House, David C. Reed, Max D. Smith
-
Patent number: 8719300Abstract: A method, system and computer-usable medium are disclosed for managing an integrated catalog facility (ICF) catalog. An ICF catalog is monitored by a contention detection module. Information related to a detected catalog resource contention is used by the contention detection module to generate a contention event. Information related to the contention event is then provided to a contention resolution module, which uses the information to perform a contention resolution operation. Once the resolution operation has been performed, contention events and contention resolution operations are reported by a contention reporting module.Type: GrantFiled: October 15, 2008Date of Patent: May 6, 2014Assignee: International Business Machines CorporationInventors: Michael R. Scott, Max D. Smith, David C. Reed, Philip R. Chauvet
-
Patent number: 8719792Abstract: A method of correcting job control language (JCL) jobs scans a JCL job against a set of JCL syntax rules. The method automatically corrects any syntax errors discovered during the scanning, thereby forming a corrected JCL job. The method then runs the corrected JCL job. If the corrected JCL ends abnormally due to an execution error, the method then automatically determines if the execution error is recoverable. If the execution error is recoverable, the method automatically corrects the recoverable error to form a recovered corrected JCL job. The method reruns the recovered corrected JCL job.Type: GrantFiled: March 24, 2008Date of Patent: May 6, 2014Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith
-
Patent number: 8667247Abstract: A method for optimizing a plurality of volume records stored in cache may include monitoring a volume including multiple data sets, wherein each data set is associated with a volume record, and each volume record is stored in a volume record data set. The method may include tracking read and write operations to each of the data sets over a period of time. The method may further include reorganizing the volume records in the volume record data set such that volume records for data sets with a larger number of read operations relative to write operations are grouped together, and volume records for data sets with a smaller number of read operations relative to write operation are grouped together. A corresponding apparatus and computer program product are also disclosed.Type: GrantFiled: March 26, 2012Date of Patent: March 4, 2014Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Patent number: 8423505Abstract: A method for reorganizing a catalog to improve I/O performance includes initially placing a shared lock on a source catalog. The method then makes a point-in-time copy of the source catalog to generate a target catalog. Once the target catalog is generated, the method reorganizes the contents of the target catalog. Optionally, while reorganizing the contents of the target catalog, the method temporarily releases the shared lock on the source catalog and mirrors I/O intended for the source catalog to a buffer. The buffered I/O may then be used to update the target catalog to bring it current with the source catalog. When the target catalog is reorganized and up-to-date, the method upgrades the shared lock on the source catalog to an exclusive lock, overwrites the source catalog with the target catalog, and releases the exclusive lock. A corresponding apparatus and computer program product are also disclosed and claimed herein.Type: GrantFiled: January 9, 2010Date of Patent: April 16, 2013Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Publication number: 20130047032Abstract: An approach to providing auto recovery of data sets in volumes. When an error condition results from an attempt to access an unintentionally deleted data set, an event is generated and sent to other systems with access to the volume in which the data set existed. The volume is also locked to prevent corruption during the recovery process. A system that has the unintentionally deleted data set open retrieves location information for the data set from control blocks in the system's memory. This location information is used to build a new entry for the data set in the VTOC for the volume. When the data set is thus recovered, the data set is validated, the lock removed, and the data set is made available to the systems sharing the volume.Type: ApplicationFiled: August 19, 2011Publication date: February 21, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip R. Chauvet, David C. Reed, Max D. Smith, Keith R. Smith
-
Patent number: 8291186Abstract: A method, apparatus, and computer program product for optimizing the organization of volume records stored in a volume record data set is disclosed herein. In certain embodiments, a method may include monitoring a volume comprising multiple data sets. Each data set may have associated therewith a volume record stored in a volume record data set. The method may further include tracking read and write operations to each of the data sets over a period of time. A count value may be stored in the volume record of each data set. The count value may be increased each time a read operation is performed to the associated data set. The count value may be decreased each time a write operation is performed to the associated data set. The volume records in the volume record data set may then be reorganized according to the size of the count values.Type: GrantFiled: August 21, 2008Date of Patent: October 16, 2012Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Publication number: 20120185649Abstract: A method for optimizing a plurality of volume records stored in cache may include monitoring a volume including multiple data sets, wherein each data set is associated with a volume record, and each volume record is stored in a volume record data set. The method may include tracking read and write operations to each of the data sets over a period of time. The method may further include reorganizing the volume records in the volume record data set such that volume records for data sets with a larger number of read operations relative to write operations are grouped together, and volume records for data sets with a smaller number of read operations relative to write operation are grouped together. A corresponding apparatus and computer program product are also disclosed.Type: ApplicationFiled: March 26, 2012Publication date: July 19, 2012Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith
-
Patent number: 8141087Abstract: An apparatus, system, and method are disclosed for resolving computing resource deadlocks. In one embodiment, the present invention includes detecting a set of deadlocked processes within a set of executing processes, cancelling a lowest priority process of the set of deadlocked processes, generating a requested resources report for the set of executing processes, and enabling a user to assign a priority level to a process. In one embodiment, resolving computing resource deadlocks will efficiently detect deadlocks by using a report already generated by the operating system detailing information about allocated resources. By analyzing the resources report to gain information regarding executing processes, deadlocks may be easily determined and remedied. Resolving computing resource deadlocks may be conducted by a utility or it may run as a service of the operating system.Type: GrantFiled: March 31, 2006Date of Patent: March 20, 2012Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Patent number: 7996408Abstract: A plurality of data sets is maintained, wherein each data set comprises an index block and a plurality of data blocks. An index block size is determined for redefining the plurality of data sets, based on an amount of space left unused in index blocks of the plurality of data sets, wherein for determining the index block size greater weight is provided to those index blocks with lesser unused space in comparison to those index blocks with greater unused space. A data block size is determined based on whether the plurality of data blocks is used more frequently for direct processing or used more frequently for sequential processing.Type: GrantFiled: August 1, 2008Date of Patent: August 9, 2011Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Publication number: 20110173154Abstract: A method for reorganizing a catalog to improve I/O performance includes initially placing a shared lock on a source catalog. The method then makes a point-in-time copy of the source catalog to generate a target catalog. Once the target catalog is generated, the method reorganizes the contents of the target catalog. Optionally, while reorganizing the contents of the target catalog, the method temporarily releases the shared lock on the source catalog and mirrors I/O intended for the source catalog to a buffer. The buffered I/O may then be used to update the target catalog to bring it current with the source catalog. When the target catalog is reorganized and up-to-date, the method upgrades the shared lock on the source catalog to an exclusive lock, overwrites the source catalog with the target catalog, and releases the exclusive lock. A corresponding apparatus and computer program product are also disclosed and claimed herein.Type: ApplicationFiled: January 9, 2010Publication date: July 14, 2011Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith
-
Patent number: 7783609Abstract: When a VTOC and a VVDS are established for information used to access data sets of a volume, unused space remains in both structures. The data sets, VTOC and VVDS are stored on a recordable medium. For VSAM data sets, other, vital information about the data set is also stored in the VTOC; for non-VSAM data sets, vital information about the data set is also stored in the VVDS. If the VOTC entry of a non-VSAM data set becomes corrupted, the vital information in the VVDS may be used to access the stored data set. Similarly, If the VVDS entry of a VSAM data set becomes corrupted, the vital information in the VTOC may be used to access the stored data set.Type: GrantFiled: January 24, 2008Date of Patent: August 24, 2010Assignee: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith
-
Publication number: 20100094832Abstract: A method, system and computer-usable medium are disclosed for managing an integrated catalog facility (ICF) catalog. An ICF catalog is monitored by a contention detection module. Information related to a detected catalog resource contention is used by the contention detection module to generate a contention event. Information related to the contention event is then provided to a contention resolution module, which uses the information to perform a contention resolution operation. Once the resolution operation has been performed, contention events and contention resolution operations are reported by a contention reporting module.Type: ApplicationFiled: October 15, 2008Publication date: April 15, 2010Inventors: Michael R. Scott, Max D. Smith, David C. Reed, Philip R. Chauvet
-
Publication number: 20100049937Abstract: A method, apparatus, and computer program product for optimizing the organization of volume records stored in a volume record data set is disclosed herein. In certain embodiments, a method may include monitoring a volume comprising multiple data sets. Each data set may have associated therewith a volume record stored in a volume record data set. The method may further include tracking read and write operations to each of the data sets over a period of time. A count value may be stored in the volume record of each data set. The count value may be increased each time a read operation is performed to the associated data set. The count value may be decreased each time a write operation is performed to the associated data set. The volume records in the volume record data set may then be reorganized according to the size of the count values.Type: ApplicationFiled: August 21, 2008Publication date: February 25, 2010Applicant: International Business Machines CorporationInventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith
-
Publication number: 20100030828Abstract: A plurality of data sets is maintained, wherein each data set comprises an index block and a plurality of data blocks. An index block size is determined for redefining the plurality of data sets, based on an amount of space left unused in index blocks of the plurality of data sets, wherein for determining the index block size greater weight is provided to those index blocks with lesser unused space in comparison to those index blocks with greater unused space. A data block size is determined based on whether the plurality of data blocks is used more frequently for direct processing or used more frequently for sequential processing.Type: ApplicationFiled: August 1, 2008Publication date: February 4, 2010Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Philip R. Chauvet, David Charles Reed, Michael Robert Scott, Max Douglas Smith
-
Publication number: 20090240988Abstract: A method of correcting job control language (JCL) jobs scans a JCL job against a set of JCL syntax rules. The method automatically corrects any syntax errors discovered during the scanning, thereby forming a corrected JCL job. The method then runs the corrected JCL job. If the corrected JCL ends abnormally due to an execution error, the method then automatically determines if the execution error is recoverable. If the execution error is recoverable, the method automatically corrects the recoverable error to form a recovered corrected JCL job. The method reruns the recovered corrected JCL job.Type: ApplicationFiled: March 24, 2008Publication date: September 24, 2009Inventors: Philip R. Chauvet, David C. Reed, Michael R. Scott, Max D. Smith