Patents by Inventor David C. Reed

David C. Reed 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).

  • Publication number: 20190146677
    Abstract: A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to: receive, by the computer, a data set allocation request; determine, by the computer, whether a size of the data set is greater than a threshold; use, by the computer, first key values in a first index to select a volume in response to determining that the size of the data set is greater than the threshold; use, by the computer, second key values in a second index to select a volume in response to determining that the size of the data set is less than the threshold; perform, by the computer, the allocation request in the selected volume; and store, by the computer, control data about the data set in the control data set corresponding to the selected volume.
    Type: Application
    Filed: January 16, 2019
    Publication date: May 16, 2019
    Inventors: Kenneth J. Gibes, Harold S. Huber, David C. Reed, Max D. Smith
  • Patent number: 10289476
    Abstract: A method for correcting data inconsistency in an asynchronous data replication environment is disclosed. In one embodiment, such a method includes detecting an error on a secondary track of a secondary volume, wherein the secondary volume is in a mirroring relationship with a primary volume. In response to detecting the error, the method flags the secondary track as “temporarily inconsistent.” The method then issues a command to read a corresponding primary track from the primary volume, records a time when the primary track was read, and mirrors the primary track and time to the secondary volume. The method then applies, to the secondary track, updates to the secondary track having a timestamp earlier than the time, and applies the primary track to the secondary track. The method then unflags the secondary track as “temporarily inconsistent.” A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: January 21, 2017
    Date of Patent: May 14, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gregory E. McBride, David C. Reed, Warren K. Stanley
  • Patent number: 10275276
    Abstract: 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: Grant
    Filed: August 19, 2013
    Date of Patent: April 30, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Dustin A. Helak, David C. Reed, Thomas C. Reed, Max D. Smith
  • Patent number: 10261868
    Abstract: Provided are a computer program product, system, and method for using a forward log storage and backward log storage to recover a storage to a forward or backward point-in-time. In response to receiving writes to source data after establishing point-in-time copies, point-in-time data of the source data is copied to a backward log storage storing point-in-time data for multiple of the point-in-time copies. The point-in-time data in the backward log storage is applied to a recovery source data to roll-back the source data to a backward point-in-time of one of the point-in-time copies. Before applying the point-in-time data from the backward log storage, point-in-time data in the recovery source data, is copied to a forward log storage. The point-in-time data in the forward log storage is applied to the recovery source data to roll forward the recovery source data to a forward point-in-time subsequent to the backward point-in-time.
    Type: Grant
    Filed: November 17, 2016
    Date of Patent: April 16, 2019
    Assignee: International Business Machines Corporation
    Inventors: Theresa M. Brown, Nicolas M. Clayton, Gregory E. McBride, Carol S. Mellgren, David C. Reed
  • Patent number: 10254993
    Abstract: Provided are a computer program product, system, and method for selecting first data sets in a first storage group to swap with second data sets in a second storage group. First data sets are stored in a first storage group and second data sets are stored in a second storage group. A determination is made for a value for each of at least one of the first data sets based on at least one priority of at least one job processing I/O activity at the first data set. At least one of the first data sets for which the value was determined is selected to migrate to the second storage group based on the value.
    Type: Grant
    Filed: October 28, 2016
    Date of Patent: April 9, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kyle B. Dudgeon, David C. Reed, Esteban Rios, Max D. Smith
  • Patent number: 10248353
    Abstract: A method for dynamically freeing storage space in a tiered storage system includes reading attribute values associated with data sets residing on a first storage tier. The method compares characteristics of the data sets to the attribute values to determine which initial data sets qualify to be moved from the first storage tier to a second storage tier. The method further determines whether movement of the initial data sets creates a desired amount of free space on the first storage tier. In the event the movement does not create the desired amount of free space, the method modifies the attribute values, determines which additional data sets qualify to be moved from the first storage tier to the second storage tier, and recalculates the amount of free space that would be generated. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: January 7, 2016
    Date of Patent: April 2, 2019
    Assignee: International Business Machines Corporation
    Inventors: Andrew E. Deiss, David C. Reed, Esteban Rios, Max D. Smith
  • Publication number: 20190095473
    Abstract: A method includes receiving a request to store a record in a base data set and determining whether the base data set can accommodate the record. In the event the base data set cannot accommodate the record, the method automatically creates an overflow data set to accommodate the record, stores the record in the overflow data set, and updates an index of the base data set to include a key associated with the record. The key points to the overflow data set as containing the record. In certain embodiments, the base data set and overflow data set are both keyed VSAM data sets. A corresponding system and computer program product are also disclosed.
    Type: Application
    Filed: September 27, 2017
    Publication date: March 28, 2019
    Applicant: International Business Machines Corporation
    Inventors: Philip R. Chauvet, David C. Reed, Michael R. Scott
  • Patent number: 10228886
    Abstract: A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith, the program instructions executable by a computer to cause the computer to: receive, by the computer, a data set allocation request; determine, by the computer, whether a size of the data set is greater than a threshold; use, by the computer, first key values in a first index to select a volume in response to determining that the size of the data set is greater than the threshold; use, by the computer, second key values in a second index to select a volume in response to determining that the size of the data set is less than the threshold; perform, by the computer, the allocation request in the selected volume; and store, by the computer, control data about the data set in the control data set corresponding to the selected volume.
    Type: Grant
    Filed: April 20, 2016
    Date of Patent: March 12, 2019
    Assignee: International Business Machines Corporation
    Inventors: Kenneth J. Gibes, Harold S. Huber, David C. Reed, Max D. Smith
  • Patent number: 10220772
    Abstract: An apparatus for providing traffic alerts includes a distance module, analysis module, transmission module, and signaling module. The distance module measures the distance between a vehicle and an object in front of the vehicle. The analysis decides whether to signal a presence of the object that comprises determining that the measured distance is equal to or less than a threshold distance. The transmission module transmits an alert in response to the analysis module deciding to signal a presence of the object. The signaling module transmits a visual signal to one or more vehicles behind the vehicle in response to receiving the alert from the transmission module. The visual signal has one or more characteristics.
    Type: Grant
    Filed: August 31, 2017
    Date of Patent: March 5, 2019
    Assignee: International Business Machines Corporation
    Inventors: Thomas W. Bish, Nikhil Khandelwal, Gregory E. McBride, David C. Reed, Richard A. Welp
  • Patent number: 10216562
    Abstract: Apparatuses, methods, systems, and computer program products are provided for generating diagnostic data. A trigger module detects a diagnostic trigger for a first address space. A lookup module checks a data structure for one or more second address spaces associated with the first address space. A dump module generates one or more dump files comprising diagnostic data for the first address space and the one or more second address spaces.
    Type: Grant
    Filed: February 23, 2016
    Date of Patent: February 26, 2019
    Assignee: International Business Machines Corporation
    Inventors: Dash D. Miller, David C. Reed, Esteban Rios, Max D. Smith
  • Publication number: 20190012086
    Abstract: A method according to one embodiment includes determining to temporarily extend an initial volume to be defragmented, identifying a plurality of additional volumes pooled with the initial volume within a storage group, identifying an area on each of the plurality of additional volumes pooled with the initial volume within the storage group to use for temporarily extending the initial volume, allocating the identified area on each of the plurality of additional volumes as a temporary extension of the initial volume, including, for each of the plurality of additional volumes, creating an entry in a VTOC of the additional volume that indicates that a non-VSAM data set resides at a location of the identified area on the additional volume, setting a plurality of pointers within a VTOC of the initial volume, where the plurality of pointers includes a pointer to the identified area on additional volumes, and defragmenting the initial volume.
    Type: Application
    Filed: September 11, 2018
    Publication date: January 10, 2019
    Inventors: Kyle B. Dudgeon, David C. Reed, Esteban Rios, Max D. Smith
  • Publication number: 20190012345
    Abstract: Provided are a computer program product, system, and method for a data set connection manager having a plurality of data sets to represent one data set. A request is processed to open a connection to a data set having members, wherein the connection is used to perform read and write requests to the members in the data set. In response to establishing the connection, establishing for the connection a primary data set having all the members; a secondary data set to which updated members in the primary data set are written; and a pending delete data set to pending delete members comprising members that are updated.
    Type: Application
    Filed: September 12, 2018
    Publication date: January 10, 2019
    Inventors: David C. Reed, Thomas C. Reed, Max D. Smith
  • Patent number: 10169134
    Abstract: A method for auditing data consistency in an asynchronous data replication environment is disclosed. In one embodiment, such a method includes copying, at a primary storage system, a primary data track and recording a time that the primary data track was copied. The method replicates the primary data track and associated time from the primary storage system to a secondary storage system. The method applies, to a corresponding secondary data track at the secondary storage system, all updates received for the secondary data track that have a timestamp prior to the time. The method then reads the secondary data track at the secondary storage system after the updates have been applied, and compares the secondary data track to the primary data track. If the secondary data track does not match the primary data track, the method records an error. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: January 21, 2017
    Date of Patent: January 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: Gregory E. McBride, David C. Reed, Warren K. Stanley
  • Patent number: 10168959
    Abstract: Provided are a computer program product, system, and method for data unit classification in accordance with one embodiment of the present description, in which in response to a data processing command, a storage controller classifies data units of a storage unit as either allocated to a data set or as unallocated to any data set. If allocated to a data set, the storage controller can further classify data set-allocated data units as either containing client data or metadata or as empty. In accordance with one aspect of the present description, the storage controller may bypass data processing of the data units which have not been allocated to any data set or otherwise do not contain client data or metadata. Other aspects of data unit classification in accordance with the present description are described.
    Type: Grant
    Filed: August 15, 2017
    Date of Patent: January 1, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Gregory E. McBride, David C. Reed, Michael R. Scott, Richard A. Welp
  • Patent number: 10169817
    Abstract: A computer system, method, and program product for dynamically allocating storage bandwidth in an exchange is provided. The method provided creates, by an exchange server, a total inventory of resources for auction, whereby the total inventory of resources for auction includes resources from at least one provider. The total inventory of resources for auction is broadcast to at least one bidder. The amount of a resource is awarded to the at least one bidder at an end of a bidding interval, based on a bid provided by the at least one bidder during the bidding interval, where the amount of the resource is a portion of the total inventory of resources for auction.
    Type: Grant
    Filed: September 21, 2015
    Date of Patent: January 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: Stephen A. Haley, Brian W. Hart, Anil Kalavakolanu, David C. Reed, Max D. Smith
  • Patent number: 10169394
    Abstract: 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: Grant
    Filed: June 5, 2014
    Date of Patent: January 1, 2019
    Assignee: International Business Machines Corporation
    Inventors: Philip R. Chauvet, Franklin E. McCune, David C. Reed, Max D. Smith
  • Patent number: 10168956
    Abstract: Provided are a computer program product, system, and method for correcting overlapping data sets in a volume. A determination is made of overlapping data sets in a first volume that are assigned a same data unit. The data sets in the first volume that are not assigned a same data unit are copied to a second volume. The same data unit is processed to determine one of the overlapping data sets for which the same data unit is intended and copied to the determined overlapping data set in the second volume.
    Type: Grant
    Filed: January 13, 2017
    Date of Patent: January 1, 2019
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Harold S. Huber, Joseph V. Malinowski, David C. Reed, Max D. Smith
  • Patent number: 10162746
    Abstract: Provided are a computer program product, system, and method for allocating additional requested storage space for a data set in a first managed space in a second managed space. A request for additional storage space is received for a requested data set stored in a first managed space in the storage. A revised amount of storage space for the requested data set comprises at least an amount of space currently allocated to the requested data set in the first managed space and the requested additional storage space. If the revised amount of storage space exceeds a value, then allocation is made of the revised amount of storage space in allocated storage space in a second managed space of the storage. The data set is stored in the allocated storage space in the second managed space.
    Type: Grant
    Filed: February 1, 2017
    Date of Patent: December 25, 2018
    Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION
    Inventors: Kyle B. Dudgeon, David C. Reed, Esteban Rios, Max D. Smith
  • Patent number: 10162531
    Abstract: A method for optimizing the allocation of extents to data sets is disclosed. In one embodiment, such a method includes providing multiple storage classes. These storage classes may include a first storage class configured to allocate larger extents to data sets, a second storage class configured to allocate smaller extents to data sets, and a mixed-mode storage class configured to allocate a combination of the smaller and larger extents to data sets. The method further enables data sets to be assigned to one of the multiple storage classes. Upon assigning a data set to the mixed-mode storage class, the method causes an initial portion of the data set to be allocated the larger extents, and an ending portion of the data set to be allocated the smaller extents. A corresponding system and computer program product are also disclosed.
    Type: Grant
    Filed: January 21, 2017
    Date of Patent: December 25, 2018
    Assignee: International Business Machines Corporation
    Inventors: Preston A. Carpenter, Gregory E. McBride, David C. Reed, Esteban Rios
  • Publication number: 20180364923
    Abstract: Provided are a computer program product, system, and method for generating node access information for a transaction accessing nodes of a data set index. 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. A transaction is processed with respect to the data set that involves accessing the internal and leaf nodes in the tree data structure, wherein the transaction comprises a read or write operation. Node access information is generated in transaction information, for accessed nodes comprising nodes in the tree data structure accessed as part of processing the transaction. The node access information includes a pointer to the page allocated to the accessed node prior to the transaction in response to the node being modified during the transaction.
    Type: Application
    Filed: August 23, 2018
    Publication date: December 20, 2018
    Inventors: Derek L. Erdmann, David C. Reed, Thomas C. Reed, Max D. Smith