Patents by Inventor Carl E. Jones
Carl E. Jones 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: 9304865Abstract: For efficient handing of semi-asynchronous RAID write failures using a processor device in a computing environment, a write operation is committed on a primary copy of data on a primary entity while sending the data to a secondary entity while awaiting an acknowledgment by the secondary entity. The acknowledgment indicates to the primary entity that metadata for the write operation has arrived at the secondary entity without necessarily indicating the data has arrived at the secondary entity. The acknowledgment is sent from the secondary entity regardless of a write failure and allowing the secondary entity to perform a recovery operation if a write failure occurs.Type: GrantFiled: March 26, 2014Date of Patent: April 5, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Christophe Fagiano, Itzhack Goldberg, Carl E. Jones, Moriel Lechtman, Neil Sondhi
-
Patent number: 9268785Abstract: Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.Type: GrantFiled: March 13, 2013Date of Patent: February 23, 2016Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
-
Publication number: 20150278019Abstract: For efficient handing of semi-asynchronous RAID write failures using a processor device in a computing environment, a write operation is committed on a primary copy of data on a primary entity while sending the data to a secondary entity while awaiting an acknowledgment by the secondary entity. The acknowledgment indicates to the primary entity that metadata for the write operation has arrived at the secondary entity without necessarily indicating the data has arrived at the secondary entity. The acknowledgment is sent from the secondary entity regardless of a write failure and allowing the secondary entity to perform a recovery operation if a write failure occurs.Type: ApplicationFiled: March 26, 2014Publication date: October 1, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Christophe FAGIANO, Itzhack GOLDBERG, Carl E. JONES, Moriel LECHTMAN, Neil SONDHI
-
Publication number: 20150199235Abstract: A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.Type: ApplicationFiled: March 27, 2015Publication date: July 16, 2015Inventors: Rahul M. Fiske, Kalyan C. Gunda, Carl E. Jones, Sandeep R. Patil, Subhojit Roy
-
Publication number: 20150154411Abstract: A system and non-transitory computer program product for preserving data redundancy in a data deduplication system in a computing environment is provided. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation. Copies of the data segment that are to be precluded from data deduplication are determined and identified. A unique encryption key is used to encrypt the selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation. The data deduplication system is tricked to recognize the encrypted, selected data segment as new, undeduplicated data by the encrypting thereby skipping steps of the deduplication operation that includes fingerprint generation and matching. The encrypted, selected data segment is directly written to a new physical storage location.Type: ApplicationFiled: February 9, 2015Publication date: June 4, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. FISKE, Carl E. JONES, Subhojit ROY
-
Publication number: 20150154398Abstract: In a method for determining if a file should be scanned for malware before a deduplication process, receiving an indication that a first file is stored or modified to a computing system. The one or more processors create a fingerprint for the first file. The one or more processors determine that the fingerprint for the first file is not already stored in a repository of one or more stored fingerprints, and in response, scan the first file to determine whether the first file is infected with malware. The one or more processors, in response to determining that the first file is not infected with malware, initiate a deduplication process for the first file. The one or more processors store the fingerprint of the first file to the repository of one or more stored fingerprints.Type: ApplicationFiled: December 3, 2013Publication date: June 4, 2015Applicant: International Business Machines CorporationInventors: Carl E. Jones, Sapan J. Maniyar, Sarvesh S. Patel, Subhojit Roy
-
Publication number: 20150154410Abstract: A method for preserving data redundancy in a data deduplication system in a computing environment is provided. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation. The method determines and identifies copies of the data segment that are to be precluded from data deduplication. A unique encryption key is used to encrypt the selected data segment to be written through the data deduplication system such that the selected data segment is not subject to a deduplication operation. The data deduplication system is tricked to recognize the encrypted, selected data segment as new, undeduplicated data by the encrypting thereby skipping steps of the deduplication operation that includes fingerprint generation and matching. The encrypted, selected data segment is directly written to a new physical storage location.Type: ApplicationFiled: February 9, 2015Publication date: June 4, 2015Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. FISKE, Carl E. JONES, Subhojit ROY
-
Patent number: 9009438Abstract: An approach to efficient space reclamation in multi-layered thinly provisioned systems. A parent storage volume is thinly provisioned, and uses one or more child storage volumes that are also thinly provisioned for storage. A reclamation command sent to the device providing the parent thinly provisioned storage volume identifies that data has been released, and that the physical storage storing that data can be placed in a free pool and used to satisfy future write requests in the parent storage volume. An identify module identifies which child storage volumes supporting the parent storage volume are thinly provisioned. The data is released at the level of the parent storage volume, and the reclamation command is sent to the child storage volumes supporting the parent storage volume and that are themselves thinly provisioned. The storage is thus released by all affected thinly provisioned storage volumes, and not just the parent storage volume that received the reclamation command.Type: GrantFiled: June 1, 2011Date of Patent: April 14, 2015Assignee: International Business Machines CorporationInventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
-
Publication number: 20150095282Abstract: A first server system identifies a first storage area of the first server system, the first storage area being associated with a first heat value and storing at least a portion of a file. The first server system determines an identifier corresponding to the portion of the file. The first server system associates the portion of the file with the first heat value. The first server system sends the identifier corresponding to the portion of the file and the associated heat value to a second server system, wherein the second server system includes a duplicate copy of the portion of the file.Type: ApplicationFiled: September 30, 2013Publication date: April 2, 2015Applicant: International Business Machines CorporationInventors: Carl E. Jones, John T. Olson, Sandeep R. Patil, Riyazahamad M. Shiraguppi
-
Patent number: 8996804Abstract: A mechanism is provided for optimizing and enhancing performance for parity based storage, particularly redundant array of independent disk (RAID) storage. The mechanism optimizes a repetitive pattern write command for performance for storage configurations that require parity calculations. The mechanism eliminates the need for laborious parity calculations that are resource intensive and add to IO latency. For repetitive write commands that span across the full stripe of a RAID5 or similar volume, the mechanism calculates parity by looking at the pattern and the number of columns in the volume. The mechanism may avoid the XOR operation altogether for repetitive pattern write commands. The mechanism may enhance secure delete operations that use repetitive pattern write commands by eliminating data reliability operations like parity generation and writing altogether.Type: GrantFiled: September 12, 2011Date of Patent: March 31, 2015Assignee: International Business Machines CorporationInventors: Rahul M. Fiske, Kalyan C. Gunda, Carl E. Jones, Sandeep R. Patil, Subhojit Roy
-
Patent number: 8990581Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation.Type: GrantFiled: March 13, 2013Date of Patent: March 24, 2015Assignee: International Business Machines CorporationInventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy
-
Publication number: 20150067281Abstract: For reserving storage space, a determination module determines if required storage space is available for a write in response to logical storage address for the write being unallocated. The logical storage address is a thin provisioned storage space. A reservation module reserves the required storage space for the write in response to determining that the required storage space is available. In addition, the reservation module may communicate an allocation success in response to determining the required storage space is available. The allocation success is communicated prior to allocating the required storage space. The reservation module may communicate a write failure in response to determining the required storage space is not available.Type: ApplicationFiled: September 5, 2013Publication date: March 5, 2015Inventors: Carl E. Jones, Subhojit Roy, Gail A. Spear
-
Patent number: 8943283Abstract: Provided are a computer program product, system, and method for converting a first address mapping function for mapping addresses to storage locations to a second address mapping function. For each of a plurality of addresses allocated in the storage using the first address mapping function, a node is generated in the second address mapping function. Each node in the second address mapping function associates a logical address with a physical location for the logical address. A determination is made of addresses having unused space and storage space is freed for the determined addresses having the unused space. Indication is made in the second address mapping function that the storage space for the determined addresses has been freed.Type: GrantFiled: August 31, 2012Date of Patent: January 27, 2015Assignee: International Business Machines CorporationInventors: Rahul Fiske, Carl E. Jones, Subhojit Roy
-
Publication number: 20140359245Abstract: A storage system receives an anticipatory write command corresponding to a potential subsequent write command to be received by the storage system, wherein the anticipatory write command indicates an anticipated region of logical address space that may be written to by the potential subsequent write command. The storage system determines that physical storage is not allocated to the anticipated region of logical address space. The storage system allocates physical storage to the anticipated region of logical address space from a pool of available storage managed by the storage system. The storage system creates an association between the anticipated region of logical address space and the allocated physical storage in a virtual-to-physical mapping.Type: ApplicationFiled: June 4, 2013Publication date: December 4, 2014Inventors: CARL E. JONES, Subhojit Roy
-
Publication number: 20140068211Abstract: Provided are a computer program product, system, and method for converting a first address mapping function for mapping addresses to storage locations to a second address mapping function. For each of a plurality of addresses allocated in the storage using the first address mapping function, a node is generated in the second address mapping function. Each node in the second address mapping function associates a logical address with a physical location for the logical address. A determination is made of addresses having unused space and storage space is freed for the determined addresses having the unused space. Indication is made in the second address mapping function that the storage space for the determined addresses has been freed.Type: ApplicationFiled: August 31, 2012Publication date: March 6, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul Fiske, Carl E. Jones, Subhojit Roy
-
Publication number: 20130325802Abstract: An application programming interface (API), functioning as an interface between a storage controller and an owning application, is used to migrate, from a specified source LUN to a specified target LUN, at least one specified sub-LUN data chunk, the at least one specified sub-LUN data chunk having a predefined chunk size fixed by the storage controller. A specified total migration size is incrementally reduced by each completed migration of the at least one specified sub-LUN data chunk until the total migration size is zero and the migration is completed.Type: ApplicationFiled: March 13, 2013Publication date: December 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Pankaj S. BAVISHI, Gaurav CHHAUNKER, Carl E. JONES, Pankaj O. KHANDELWAL, Subhojit ROY
-
Publication number: 20130290598Abstract: Mechanisms identify one or more first storage devices in a first tier of the tiered storage system that may be placed in a minimal power consumption state and identify one or more data segments stored on the one or more first storage devices that are most likely to be accessed during a period of time in which the one or more first storage devices are in the minimal power consumption state. The mechanisms migrate the one or more data segments to one or more second storage devices in one of the first tier or a second tier of the storage system and place the one or more first storage devices in the minimal power consumption state. Access requests to the one or more data segments are serviced by the one or more second storage devices while the one or more first storage devices are in the minimal power consumption state.Type: ApplicationFiled: April 25, 2012Publication date: October 31, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. Fiske, Carl E. Jones, Subhojit Roy, Andrew D. Walls
-
Publication number: 20130282674Abstract: Various embodiments for preserving data redundancy of identical data in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected range of virtual addresses of a virtual storage device in the computing environment is designated as not subject to a deduplication operation. Other system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: March 13, 2013Publication date: October 24, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. FISKE, Carl E. JONES, Subhojit ROY
-
Publication number: 20130282675Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed in a multi-device file system. At least one virtual device out of a volume set is designated as not subject to a deduplication operation.Type: ApplicationFiled: March 13, 2013Publication date: October 24, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. FISKE, Carl E. JONES, Subhojit ROY
-
Publication number: 20130283062Abstract: Various embodiments for preserving data redundancy in a data deduplication system in a computing environment are provided. In one embodiment, a method for such preservation is disclosed. A selected data segment, to be written through the data deduplication system, is encrypted such that the selected data segment is not subject to a deduplication operation.Type: ApplicationFiled: March 13, 2013Publication date: October 24, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Rahul M. FISKE, Carl E. JONES, Subhojit ROY