Derek L Erdmann, 381001 E 17Th St APT 134, Tucson, AZ 85719

2014001, Jan 16, 2014

Jul 12, 2012

13/547659

Derek L. Erdmann - Tucson AZ, US
Dustin A. Helak - Tucson AZ, US
David C. Reed - Tucson AZ, US
Max D. Smith - Tucson AZ, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 11/07

714 61, 714E11023

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.

2014008, Mar 20, 2014

Sep 14, 2012

13/619962

Derek L. Erdmann - Tucson AZ, US
David C. Reed - Tucson AZ, US
Thomas C. Reed - Tucson AZ, US
Max D. Smith - Tucson AZ, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 12/02

711170, 711E12002

Provided are a computer program product, system, and method for selecting pages implementing leaf nodes and internal nodes of a data set index for reuse in memory. Pages in the memory are allocated to internal nodes and leaf nodes of a tree data structure representing all or a portion of a data set index for the data set, wherein the leaf nodes include information on members of the data set. The internal nodes include one or more keys used to traverse the tree data structure to reach the leaf nodes to access the members of the data set. At least one page allocated to the leaf nodes and the internal nodes is selected based on durations during which the allocated pages have not been used. Pages allocated to the leaf nodes are selected for reuse at a higher rate than the pages allocated to the internal nodes.

2014001, Jan 16, 2014

Jul 12, 2012

13/548161

Derek Logan Erdmann - Tucson AZ, US
David C. Reed - Tucson AZ, US
Thomas C. Reed - Tucson AZ, US
Max D. Smith - Tucson AZ, US

INTERNATIONAL BUSINESS MACHINES CORPORATION - Armonk NY

G06F 12/02

711172, 711E12002

Provided are a computer program product, system, and method for granting and revoking supplemental memory allocation requests. Supplemental memory allocations of memory resources are granted to applications following initial memory allocations of the memory resources to the applications. In response to determining that available memory resources have fallen below an availability threshold, determining a weighting factor for each supplemental memory allocation based on at least one of an amount of the memory resources allocated to the supplemental memory allocation and a measured duration during which the memory resources have been allocated. At least one of the supplemental memory allocations is selected to revoke based on the determined weighting factors of the supplemental memory allocations.

2019038, Dec 19, 2019

Jun 17, 2018

16/010461

- Armonk NY, US
David C. Reed - Tucson AZ, US
Sosuke Matsui - Tokyo, JP
Derek L. Erdmann - Pima AZ, US

International Business Machines Corporation - Armonk NY

G06F 3/06

A method for managing volumes in a scratch pool of a virtual tape system is disclosed. In one embodiment, such a method provides a scratch pool containing volumes for use in a virtual tape system. The method further enables a user to predefine an external pool of volumes residing outside of the scratch pool. This external pool may be hidden to a host system accessing the virtual tape system. The method monitors current and/or past usage of the volumes in the scratch pool and, based on the usage, predicts a future need for volumes in the scratch pool. The method automatically moves volumes between the external pool and the scratch pool in accordance with the future need. A corresponding system and computer program product are also disclosed.