Patents by Inventor Dustin A. Helak
Dustin A. Helak 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: 11163749Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.Type: GrantFiled: November 2, 2017Date of Patent: November 2, 2021Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 10884791Abstract: Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server.Type: GrantFiled: February 14, 2019Date of Patent: January 5, 2021Assignee: International Business Machines CorporationInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20190179666Abstract: Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server.Type: ApplicationFiled: February 14, 2019Publication date: June 13, 2019Inventors: Dustin A. Helak, David C. Reed, Thomas C. REED, Max D. Smith
-
Patent number: 10275276Abstract: Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server.Type: GrantFiled: August 19, 2013Date of Patent: April 30, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9940348Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.Type: GrantFiled: December 10, 2015Date of Patent: April 10, 2018Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9928380Abstract: Embodiments of a system and method are disclosed concerning the management of file usage. The method of controlling file access may manage a file with a target ID that has a sender and a recipient. The method may also establish a priority level key associated with the file. The priority level key may control file access. The method may provide the file access to the recipient if the recipient has access rights corresponding to the priority level key.Type: GrantFiled: May 7, 2013Date of Patent: March 27, 2018Assignee: International Business Machines CorporationInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20180060382Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.Type: ApplicationFiled: November 2, 2017Publication date: March 1, 2018Inventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9710183Abstract: A primary physical storage device has effectively limitless apparent free space. Responsive to receiving a request to dynamically allocate an amount of desired free space on the primary device to store new data on the primary device, and responsive to determining that an amount of actual free space on the primary device is insufficient to permit such allocation, existing data stored on the primary device is moved to a secondary storage device. The first existing data appears to still be stored on the primary device. Responsive to receiving a request to retrieve existing data from the primary device, and to determining that the existing data has been moved to the secondary device, the existing data is moved back to the primary device. The existing data was originally stored on the primary device, and is currently stored on the primary device or has been moved to the secondary device.Type: GrantFiled: August 28, 2015Date of Patent: July 18, 2017Assignee: International Business Machines CorporationInventors: Dustin A. Helak, Marc A. Martin, Jason Webster
-
Patent number: 9384044Abstract: Computer systems and computer program products for automating tasks in a computing environment are provided. In one such embodiment, by way of example only, if an instant task is not found in one of list of included tasks and a list of excluded tasks, at least one of the following is performed: the instant task is compared the with previous instances of the task, if any; the instant task is analyzed, including an input/output (I/O) sequence for the instant task, to determine if the instant task is similar to an existing task; and the instant task is considered as a possible candidate for automation. If the instant task is determined to be an automation candidate, the instant task is added to the list of included tasks, otherwise the instant task is added to the list of excluded tasks.Type: GrantFiled: January 3, 2012Date of Patent: July 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bard A. Doster, Dustin A. Helak, David C. Reed, Max D. Smith
-
Patent number: 9384045Abstract: Methods, computer systems, and computer program products for automating tasks in a computing environment, are provided. In one such embodiment, by way of example only, if an instant task is not found in one of list of included tasks and a list of excluded tasks, at least one of the following is performed: the instant task is compared the with previous instances of the task, if any; the instant task is analyzed, including an input/output (I/O) sequence for the instant task, to determine if the instant task is similar to an existing task; and the instant task is considered as a possible candidate for automation. If the instant task is determined to be an automation candidate, the instant task is added to the list of included tasks, otherwise the instant task is added to the list of excluded tasks.Type: GrantFiled: February 28, 2013Date of Patent: July 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Bard A. Doster, Dustin A. Helak, David C. Reed, Max D. Smith
-
Publication number: 20160092498Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.Type: ApplicationFiled: December 10, 2015Publication date: March 31, 2016Inventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9262463Abstract: Provided are a computer program product, system, and method for managing multiple locks for data set members in a data set index. The data set index has leaf nodes and internal nodes. In response to determining that a current lock is set at a locked node that prevents a grant to a requested lock, a determination is made as to whether there are different first and second descendant nodes from the locked node at a same level of the tree data structure linked to the requested data set member and the locked data set member, respectively. If so, the requested lock for the requested data set member is set at the first descendant node, the current lock is moved to the second descendant node for the locked data set member and the requested lock is granted.Type: GrantFiled: August 5, 2013Date of Patent: February 16, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Publication number: 20150370503Abstract: A primary physical storage device has effectively limitless apparent free space. Responsive to receiving a request to dynamically allocate an amount of desired free space on the primary device to store new data on the primary device, and responsive to determining that an amount of actual free space on the primary device is insufficient to permit such allocation, existing data stored on the primary device is moved to a secondary storage device. The first existing data appears to still be stored on the primary device. Responsive to receiving a request to retrieve existing data from the primary device, and to determining that the existing data has been moved to the secondary device, the existing data is moved back to the primary device. The existing data was originally stored on the primary device, and is currently stored on the primary device or has been moved to the secondary device.Type: ApplicationFiled: August 28, 2015Publication date: December 24, 2015Inventors: Dustin A. Helak, Marc A. Martin, Jason Webster
-
Patent number: 9189404Abstract: A method, system and computer-usable medium are disclosed for optimizing a Partitioned Data Set Extended (PDSE) directory. In various embodiments, b-tree directory structure entries associated with members of the PDSE are reordered to place members with the highest access counts within the same leaf nodes. This allows these members to share a directory path, which in turn increases the chance that the most frequently accessed member's directory path is in cache while minimizing storage footprint.Type: GrantFiled: January 9, 2014Date of Patent: November 17, 2015Assignee: International Business Machines CorporationInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9146679Abstract: A primary physical storage device has effectively limitless apparent free space. Responsive to receiving a request to dynamically allocate an amount of desired free space on the primary device to store new data on the primary device, and responsive to determining that an amount of actual free space on the primary device is insufficient to permit such allocation, existing data stored on the primary device is moved to a secondary storage device. The first existing data appears to still be stored on the primary device. Responsive to receiving a request to retrieve existing data from the primary device, and to determining that the existing data has been moved to the secondary device, the existing data is moved back to the primary device. The existing data was originally stored on the primary device, and is currently stored on the primary device or has been moved to the secondary device.Type: GrantFiled: June 18, 2011Date of Patent: September 29, 2015Assignee: International Business Machines CorporationInventors: Marc A. Martin, Dustin A. Helak, Jason Webster
-
Patent number: 9122400Abstract: For managing a data set volume table of contents, a management module creates a data set volume table of contents (DSVTOC) for a data set residing on a volume. The DSVTOC resides in a virtual storage access method (VSAM) system and includes a DSVTOC index, DSVTOC cluster data, and DSVTOC data for the data set. A copy module maintains a copy of the DSVTOC on the volume.Type: GrantFiled: August 6, 2012Date of Patent: September 1, 2015Assignee: International Business Machines CorporationInventors: Dustin A. Helak, Miguel A. Perez, David C. Reed, Max D. Smith
-
Publication number: 20150193345Abstract: A method, system and computer-usable medium are disclosed for optimizing a Partitioned Data Set Extended (PDSE) directory. In various embodiments, b-tree directory structure entries associated with members of the PDSE are reordered to place members with the highest access counts within the same leaf nodes. This allows these members to share a directory path, which in turn increases the chance that the most frequently accessed member's directory path is in cache while minimizing storage footprint.Type: ApplicationFiled: January 9, 2014Publication date: July 9, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
-
Patent number: 9047185Abstract: An abnormal termination recovery is performed where storage is referenced shortly after the storage has been freed. More specifically, when storage is freed, and that storage is accessed, an abnormal termination error (e.g., a page translation exception event) occurs due to referencing storage that has not been obtained. When the abnormal termination error occurs, an abnormal termination recovery operation is accessed. The abnormal termination recovery operation scans a history of storage freeing operations (e.g., FREEMAIN operations) to determine whether the storage location accessed by the storage access that caused the abnormal termination error was recently freed from within the same address space. If the storage location was recently freed, then the abnormal termination recovery operation reverses the storage freeing operation by issuing a storage obtaining operation (e.g., a GETMAIN operation) to re-obtain the storage.Type: GrantFiled: July 12, 2012Date of Patent: June 2, 2015Assignee: International Business Machines CorporationInventors: Derek L. Erdmann, Dustin A. Helak, David C. Reed, Max D. Smith
-
Patent number: 9037815Abstract: For analyzing and reducing dump data, an analysis module identifies each abending task of a job and identifies each stack block of each abending task. A dump module saves only stack block data from the identified stack blocks as dump data.Type: GrantFiled: June 28, 2012Date of Patent: May 19, 2015Assignee: International Business Machines CorporationInventors: Dustin A. Helak, Miguel A. Perez, David C. Reed, Max D. Smith
-
Publication number: 20150052531Abstract: Provided are a computer program product, system, and method for migrating jobs from a source server from which data is migrated to a target server to which the data is migrated. Mirrored data is copied from a source storage to a target storage. A determination is made of at least one eligible job of the jobs executing in the source server having execution characteristics indicating that the job is eligible for migration to the target server. The determined at least one eligible job is migrated to the target server to execute on the target server and perform operations with respect to the mirrored data in the target storage. The migrated eligible job is disabled at the source server.Type: ApplicationFiled: August 19, 2013Publication date: February 19, 2015Applicant: International Business Machines CorporationInventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith