Patents by Inventor Gregory T. Kishi
Gregory T. Kishi 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: 10579553Abstract: Adaptive control of Input/Output (I/O) operations in a data storage system is provided to enable efficient use of the data storage system. More specifically, an interface is provided in order to adaptively control I/O operations to the data storage system. The interface receives a data request. The interface mediates with the data storage system and employs a handle which references one or more files. The handle designates how to process the data request associated with the referenced one or more files. The interface supports execution of the data request in accordance with the handle. Accordingly, the interface provides adaptive direct management of the data storage system at file granularity and/or at data request granularity as designated in the handle(s).Type: GrantFiled: March 14, 2017Date of Patent: March 3, 2020Assignee: International Business Machines CorporationInventors: Itzhack Goldberg, Gregory T. Kishi, David B. Kumhyr, Neil Sondhi
-
Patent number: 10545832Abstract: For similarity based deduplication of remote data repositories, a parse module generates a rolling hash value based on a portion of an incoming stream of backup data. A comparison module compares the rolling hash value with entries stored in a rolling hash index, and in response to matching the rolling hash value with an entry in the rolling hash index, generates a strong hash value and determines if a match of the strong hash value exists in a first strong hash index. The comparison module, in response to a determination that the match does not exist in the first strong hash index, compares the strong hash value with entries in a second strong hash index in the remote data repository. A migration module, in response to a determination that the strong hash value does not match any hash entries, stores the portion of backup data as new data.Type: GrantFiled: March 1, 2016Date of Patent: January 28, 2020Assignee: International Business Machines CorporationInventors: Joseph W. Dain, Gregory T. Kishi
-
Publication number: 20190310995Abstract: Provided are a computer program product, system, and method for merging multiple point-in-time copies into a merged point-in-time copy. A repository maintains a full copy of the source data and point-in-time copies at point-in-times of the source data. Each of the point-in-time copies have change information indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time and changed point-in-time data comprising data in the source data as of the point-in-time of the point-in-time copy indicated in the change information as changed. At least two selected of the point-in-time copies in the repository are merged into a merged point-in-time copy by: forming merged change information in the merged point-in-time copy indicating changed data indicated in change information for the selected point-in-time copies; and forming merged changed data in the merged point-in-time copy from the changed data in the selected point-in-time copies.Type: ApplicationFiled: June 21, 2019Publication date: October 10, 2019Inventors: Glen A. Jaquette, Gregory T. Kishi, Alistair L. Symon
-
Patent number: 10437684Abstract: For similarity based deduplication of remote data repositories, a parse module generates a rolling hash value based on a portion of an incoming stream of backup data. A comparison module compares the rolling hash value with entries stored in a rolling hash index, and in response to matching the rolling hash value with an entry in the rolling hash index, generates a strong hash value and determines if a match of the strong hash value exists in a first strong hash index. The comparison module, in response to a determination that the match does not exist in the first strong hash index, compares the strong hash value with entries in a second strong hash index in the remote data repository. A migration module, in response to a determination that the strong hash value does not match any hash entries, stores the portion of backup data as new data.Type: GrantFiled: March 29, 2016Date of Patent: October 8, 2019Assignee: International Business Machines CorporationInventors: Joseph W. Dain, Gregory T. Kishi
-
Patent number: 10387446Abstract: Provided are a computer program product, system, and method for merging multiple point-in-time copies into a merged point-in-time copy. A repository maintains a full copy of the source data and point-in-time copies at point-in-times of the source data. Each of the point-in-time copies have change information indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time and changed point-in-time data comprising data in the source data as of the point-in-time of the point-in-time copy indicated in the change information as changed. At least two selected of the point-in-time copies in the repository are merged into a merged point-in-time copy by: forming merged change information in the merged point-in-time copy indicating changed data indicated in change information for the selected point-in-time copies; and forming merged changed data in the merged point-in-time copy from the changed data in the selected point-in-time copies.Type: GrantFiled: April 28, 2014Date of Patent: August 20, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen A. Jaquette, Gregory T. Kishi, Alistair L. Symon
-
Patent number: 10372546Abstract: Provided are a computer program product, system, and method for creating a restore copy from a copy of source data in a repository having source data at different point-in-times. All the source data as of an initial point-in-time is copied to a repository. In response to completing point-in-time copies following the initial point-in-time, change information is transmitted to the repository indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time. For each point-in-time copy, copying changed source data comprising source data indicated in the change information for the point-in-time copy as changed to the repository. A restore request is received to restore the source data as of a restore point-in-time. The source data in the repository as of the restore point-in-time is copied from the repository to a restore copy.Type: GrantFiled: February 7, 2014Date of Patent: August 6, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen A. Jaquette, Gregory T. Kishi
-
Publication number: 20190179708Abstract: Provided are a computer program product, system, and method for creating a restore copy from a copy of source data in a repository having source data at different point-in-times. All the source data as of an initial point-in-time is copied to a repository. In response to completing point-in-time copies following the initial point-in-time, change information is transmitted to the repository indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time. For each point-in-time copy, copying changed source data comprising source data indicated in the change information for the point-in-time copy as changed to the repository. A restore request is received to restore the source data as of a restore point-in-time. The source data in the repository as of the restore point-in-time is copied from the repository to a restore copy.Type: ApplicationFiled: February 15, 2019Publication date: June 13, 2019Inventors: Glen A. Jaquette, Gregory T. Kishi
-
Patent number: 10198190Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.Type: GrantFiled: October 31, 2016Date of Patent: February 5, 2019Assignee: International Business Machines CorporationInventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi, Daniel I. Tan
-
Patent number: 10176048Abstract: Provided are a computer program product, system, and method for creating a restore copy from a copy of source data in a repository having source data at different point-in-times and reading data from the repository for the restore copy. The source data is copied as of an initial point-in-time to a repository. Point-in-time copies at different point-in-times of the source data are initiated following the initial point-in-time. Change information for the point-in-time copy indicating changed data in the source data that changed between the point-in-time of the point-in-time copy and a subsequent point-in-time are transmitted to the repository. For each point-in-time copy, changed source data indicated in the change information for the point-in-time copy as changed is copied to the repository. A restore copy is returned to a restore request before the source data in the repository as of a restore point-in-time is copied to the restore copy.Type: GrantFiled: February 7, 2014Date of Patent: January 8, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Glen A. Jaquette, Gregory T. Kishi
-
Patent number: 10169383Abstract: Various embodiments for scrubbing data within a data storage subsystem are disclosed. An event is detected in which utilization of the data storage subsystem has fallen below a dynamically adjusted threshold value. A storage element is selected from a plurality of storage elements within the data storage subsystem. Data modifications are temporarily suspended on the selected storage element while simultaneously maintaining read access to the selected storage element. A scrubbing operation is performed on the selected storage element after the temporary designation, wherein the scrubbing operation automatically initiates when a quantity of active data to be scrubbed reaches a predetermined quantity threshold, the predetermined quantity threshold of active data comprising a total threshold number of bytes or blocks corresponding to a greatest frequency of access thereof.Type: GrantFiled: November 30, 2017Date of Patent: January 1, 2019Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventor: Gregory T. Kishi
-
Patent number: 10133763Abstract: Systems and methods include: receiving input at a storage system managing a storage device in which a tree-based data structure is stored, the input identifying a set of heterogeneous operations to be applied to the tree-based data structure; determining one or more nodes of the tree-based data structure to which one or more of the set of heterogeneous operations are to be applied; determining one or more groups of the set of heterogeneous operations, the determining being based at least in part on the one or more nodes to which the heterogeneous operations are to be applied; isolating processing of each node from processing of other nodes; and processing each of the one or more nodes to which one or more of the set of heterogeneous operations are to be applied with one of the groups of the set of heterogeneous operations.Type: GrantFiled: October 20, 2015Date of Patent: November 20, 2018Assignee: International Business Machines CorporationInventors: Lior Aronovich, Kien K. Huynh, Gregory T. Kishi
-
Publication number: 20180285379Abstract: Embodiments for optimized deduplicated object storage system by one or more processors. An uncompressed and non-deduplicated copy of an object may be stored on a node in a distributed object storage system and one or more compressed and deduplicated copies of the uncompressed and non-deduplicated copy of the object may be distributed on one or more alternative nodes in the distributed object storage system.Type: ApplicationFiled: March 31, 2017Publication date: October 4, 2018Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Joseph W. DAIN, Itzhack GOLDBERG, Gregory T. KISHI
-
Publication number: 20180275870Abstract: A method for minimizing head seek movement and improving I/O performance of a hard disk drive is disclosed. In one embodiment, such a method includes logically dividing storage space of a hard disk drive into storage areas of substantially equal size. The method monitors a temperature of each of the storage areas. The temperature indicates how frequently data in a corresponding storage area is accessed. The method swaps data in storage areas of the hard disk drive based on temperature. These swaps involve moving hotter data toward outer tracks of the disk drive and colder data toward inner tracks of the disk drive. A corresponding system and computer program product are also disclosed.Type: ApplicationFiled: March 21, 2017Publication date: September 27, 2018Applicant: International Business Machines CorporationInventors: Itzhack Goldberg, Richard Hutzler, Gregory T. Kishi, Neil Sondhi
-
Publication number: 20180267910Abstract: Adaptive control of Input/Output (I/O) operations in a data storage system is provided to enable efficient use of the data storage system. More specifically, an interface is provided in order to adaptively control I/O operations to the data storage system. The interface receives a data request. The interface mediates with the data storage system and employs a handle which references one or more files. The handle designates how to process the data request associated with the referenced one or more files. The interface supports execution of the data request in accordance with the handle. Accordingly, the interface provides adaptive direct management of the data storage system at file granularity and/or at data request granularity as designated in the handle(s).Type: ApplicationFiled: March 14, 2017Publication date: September 20, 2018Applicant: International Business Machines CorporationInventors: Itzhack Goldberg, Gregory T. Kishi, David B. Kumhyr, Neil Sondhi
-
Publication number: 20180260141Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.Type: ApplicationFiled: May 25, 2018Publication date: September 13, 2018Inventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi, Daniel I. Tan
-
Publication number: 20180260142Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.Type: ApplicationFiled: May 25, 2018Publication date: September 13, 2018Inventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi, Daniel I. Tan
-
Patent number: 10013182Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.Type: GrantFiled: July 31, 2017Date of Patent: July 3, 2018Assignee: International Business Machines CorporationInventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi, Daniel I. Tan
-
Patent number: 9971528Abstract: An apparatus for data replication is disclosed. A method and computer program product also perform the functions of the apparatus. In one embodiment, an apparatus includes a replication module configured for replicating, in response to a determination that a received object corresponds to a storage policy, the received object to a data storage node. The apparatus also includes a tagging module configured for marking the received object with a file attribute indicative of the received object being excluded from migration to a cold storage device during the replicating, and removing the file attribute after the replicating. The apparatus may also include a migration module configured for migrating, in response to a determination that the file attribute has been removed, the received object to the cold storage device.Type: GrantFiled: March 1, 2016Date of Patent: May 15, 2018Assignee: International Business Machines CorporationInventors: Robert B. Basham, Joseph W. Dain, Gregory T. Kishi
-
Publication number: 20180121105Abstract: A system and method for data storage management is disclosed. The method includes determining, by an access tracking component, a quantity of access requests for at least one data block, and determining a quantity of current copies of the data block. The method also includes creating, by a duplication component, at least one additional copy of the data block when the quantity of the access requests exceeds an access request threshold. Additionally, a deduplication component removes at least one current copy of the data block when the quantity of the access requests falls below the access request threshold. The access request threshold can be a threshold number of access requests for the data block, the presence of an input/output bottleneck, or a given length of a read latency when accessing the data block. Further, data coloring techniques can be used to distribute current copies of the data block.Type: ApplicationFiled: July 31, 2017Publication date: May 3, 2018Inventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi, Daniel I. Tan
-
Publication number: 20180121108Abstract: A method, executed by a computer, includes writing, to a storage device, a first instance of a data sequence and a corresponding first reference count, in response to determining that a subsequent data sequence is identical to the first instance of the data sequence, writing, to the storage device, a metadata reference referencing the subsequent data sequence and incrementing the first reference count, and writing, to a storage device, a second instance of the data sequence and a corresponding second reference count in response to determining that the first reference count is equal to a selected threshold. A computer system and computer program product corresponding to the above method are also disclosed herein.Type: ApplicationFiled: October 28, 2016Publication date: May 3, 2018Inventors: Joseph W. Dain, Itzhack Goldberg, Gregory T. Kishi