Patents by Inventor Asaf Porat-Stoler
Asaf Porat-Stoler 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: 11455279Abstract: Methods that can provide distributed data deduplication reference counting are disclosed herein. One method includes generating, by a processor, a secondary reference in response to a determination that a data chunk is a copy of the primary reference in which the primary reference includes a pointer to an existing data chunk stored on a storage device. The method further includes incrementing a secondary reference counter on the primary reference in response to generating the secondary reference. Apparatus and computer program products that can include, perform, and/or implement the methods are also disclosed herein.Type: GrantFiled: November 5, 2018Date of Patent: September 27, 2022Assignee: International Business Machines CorporationInventors: Asaf Porat-Stoler, Yosef Shatsky, Avraham Bab-Dinitz, Omer Haklay
-
Patent number: 11372555Abstract: A method and system may reconstruct data in a smart storage array where upon detection of data inconsistency, an application of the system is notified and affected data strips are rebuilt. When an initiator detects stripe corruption, the initiator may report the strip corruption to storage. The storage may lock the strip for I/O operations. Initiators may determine recovery scenarios for rebuilding the data strips and send the scenarios to storage. At storage, initiator replies may be collected, and a rebuild option with the highest votes may be automatically determined for a reconstruction operation. Once the reconstruction operation is completed, the rebuilt stripe may be unlocked and data operations may recommence.Type: GrantFiled: January 23, 2020Date of Patent: June 28, 2022Assignee: International Business Machines CorporationInventors: Asaf Porat-Stoler, Constantine Gavrilov, Christopher M. Dennett, Rivka Mayraz Matosevich, Sergey Marenkov, Jonathan Fischer-Toubol, Afief Halumi
-
Publication number: 20220155987Abstract: A mechanism is provided for dispersed location-based data storage. A request is received to write a data file to a referrer memory region in a set of memory regions. For each data chunk of the data file, responsive to a comparison of a hash value for the data chunk to other hash values for other stored data chunks referenced in the referrer memory region indicating that the data chunk fails to exist in the referrer memory region, responsive to the data chunk existing in another memory region in the set of memory regions, responsive to the memory region failing to be one of the predetermined number N of owner memory regions associated with the referrer memory region, and responsive to the predetermined number N of owner memory regions failing to have been met, a reference to the data chunk is stored in the referrer memory region.Type: ApplicationFiled: February 1, 2022Publication date: May 19, 2022Inventors: REUT COHEN, JONATHAN FISCHER-TOUBOL, Afief Halumi, DANNY HARNIK, Ety Khaitzin, SERGEY MARENKOV, Asaf Porat-Stoler, YOSEF SHATSKY, TOM SIVAN
-
Patent number: 11269531Abstract: A mechanism is provided for dispersed location-based data storage. A request is received to write a data file to a referrer memory region in a set of memory regions. For each data chunk of the data file, responsive to a comparison of a hash value for the data chunk to other hash values for other stored data chunks referenced in the referrer memory region indicating that the data chunk fails to exist in the referrer memory region, responsive to the data chunk existing in another memory region in the set of memory regions, responsive to the memory region failing to be one of the predetermined number N of owner memory regions associated with the referrer memory region, and responsive to the predetermined number N of owner memory regions failing to have been met, a reference to the data chunk is stored in the referrer memory region.Type: GrantFiled: October 25, 2017Date of Patent: March 8, 2022Assignee: International Business Machines CorporationInventors: Reut Cohen, Jonathan Fischer-Toubol, Afief Halumi, Danny Harnik, Ety Khaitzin, Sergey Marenkov, Asaf Porat-Stoler, Yosef Shatsky, Tom Sivan
-
Publication number: 20210232324Abstract: A method and system may reconstruct data in a smart storage array where upon detection of data inconsistency, an application of the system is notified and affected data strips are rebuilt. When an initiator detects stripe corruption, the initiator may report the strip corruption to storage. The storage may lock the strip for I/O operations. Initiators may determine recovery scenarios for rebuilding the data strips and send the scenarios to storage. At storage, initiator replies may be collected, and a rebuild option with the highest votes may be automatically determined for a reconstruction operation. Once the reconstruction operation is completed, the rebuilt stripe may be unlocked and data operations may recommence.Type: ApplicationFiled: January 23, 2020Publication date: July 29, 2021Inventors: Asaf PORAT-STOLER, Constantine GAVRILOV, Christopher M. DENNETT, Rivka MAYRAZ MATOSEVICH, Sergey MARENKOV, Jonathan FISCHER-TOUBOL, Afief HALUMI
-
Patent number: 11074130Abstract: Embodiments for reducing rebuild time in a computing storage environment in by a processor. One or more disk drive failures in a Redundant Array of Independent Disks (RAID)-6 may be rebuilt by holding at least three parity strips per stripe while using one or more of the at least three parity strips according the one or more disk drive failures.Type: GrantFiled: March 28, 2019Date of Patent: July 27, 2021Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yosef Shatsky, Asaf Porat-Stoler, Ofer Leneman, Sergey Marenkov
-
Patent number: 11030111Abstract: A computer-implemented method according to one embodiment includes identifying a data write to a specific position within a virtual address space, determining an entry within a metadata structure that corresponds to the specific position within the virtual address space, and adding state information associated with the data write to the entry within the metadata structure, the state information including a size of the data write within the virtual address space and an alignment of the data write within the virtual address space.Type: GrantFiled: January 23, 2020Date of Patent: June 8, 2021Assignee: International Business Machines CorporationInventors: Yosef Shatsky, Asaf Porat-Stoler
-
Patent number: 10970254Abstract: A computer-implemented method according to one embodiment includes receiving data, storing chunks of the data in fixed size blocks in physical storage, and deduplicating a copy of the data. The storing includes splitting some of the data chunks into portions for filling the fixed size blocks. Metadata is stored with the data chunks for chaining the associated portions of the split data chunks together. The deduplicating including creating a pointer to a first of the data chunks. A computer program product for utilizing free space in physical storage, according to another embodiment includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. The program instructions are readable and/or executable by a computer to cause the computer to perform the foregoing method.Type: GrantFiled: May 2, 2018Date of Patent: April 6, 2021Assignee: International Business Machines CorporationInventors: Asaf Porat-Stoler, Jonathan Fischer-Toubol, Shai Tahar, Afief Halumi
-
Patent number: 10901631Abstract: A mechanism is provided in a data processing system comprising at least one processor and at least one memory. The at least one memory comprise instructions which are executed by the at least one processor and configure the processor to implement a read-ahead manager for adaptive read-ahead in log structured storage. The read-ahead manager determines a probability value P representing a probability to read into cache a temporal environment for a front-end read for a given segment in user space in a log structured storage. Responsive to performing a front-end read of a record of the given segment in the log structured storage, the read-ahead manager performs pre-fetch of the temporal environment for the record with probability P.Type: GrantFiled: May 22, 2019Date of Patent: January 26, 2021Assignee: International Business Machines CorporationInventors: Avraham Bab-Dinitz, Dorit Hakmon, Asaf Porat-Stoler, Yosef Shatsky
-
Patent number: 10824556Abstract: A computer-implemented method according to one embodiment includes determining resource usage of at least a first module in a grid storage system having multiple modules and approximately equal resource usage across the multiple modules of the grid storage system. The computer-implemented method further includes determining a garbage collection cost in the grid storage system by stopping garbage collection in a second of the modules of the grid storage system, determining a resource usage in the second module upon stopping the garbage collection, and comparing the resource usage in the second module to the resource usage of the at least the first module. The method further includes adjusting an amount of garbage collection based on both the garbage collection cost and the resource usage.Type: GrantFiled: November 5, 2018Date of Patent: November 3, 2020Assignee: International Business Machines CorporationInventors: Asaf Porat-Stoler, Yosef Shatsky, Sergey Marenkov, Jonathan Fischer-Toubol, Afief Halumi
-
Patent number: 10795861Abstract: A computer-implemented method, according to one embodiment, includes: determining which of a plurality of fingerprints correspond to a copy of user data stored in one or more logical volumes at a storage location, and which of the plurality of fingerprints correspond to a pointer that points to a copy of user data stored in the one or more logical volumes at the storage location. A number of unique fingerprints is determined, and a number of the copies of user data stored in the one or more logical volumes is determined. The number of the copies of user data and the number of unique fingerprints are used to calculate an actual deduplication efficiency value. The number of the copies of user data and the number of unique fingerprints are used to calculate a potential deduplication efficiency value. The actual deduplication efficiency value is compared to the potential deduplication efficiency value.Type: GrantFiled: June 20, 2018Date of Patent: October 6, 2020Assignee: International Business Machines CorporationInventors: Yosef Shatsky, Danny Harnik, Asaf Porat-Stoler, Moshik Hershcovitch
-
Publication number: 20200310914Abstract: Embodiments for reducing rebuild time in a computing storage environment in by a processor. One or more disk drive failures in a Redundant Array of Independent Disks (RAID)-6 may be rebuilt by holding at least three parity strips per stripe while using one or more of the at least three parity strips according the one or more disk drive failures.Type: ApplicationFiled: March 28, 2019Publication date: October 1, 2020Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Yosef SHATSKY, Asaf PORAT-STOLER, Ofer LENEMAN, Sergey MARENKOV
-
Patent number: 10671525Abstract: A computer program product, according to one embodiment, includes a computer readable storage medium having program instructions embodied therewith. The computer readable storage medium is not a transitory signal per se. The program instructions are readable and/or executable by a processor to cause the processor to perform a method which includes: receiving a request to delete a volume stored in one or more regions in physical space of a storage system; determining whether at least one of the regions having at least a portion of the volume includes reclaimable space; deleting the portion of the volume from the at least one region having the reclaimable space in response to determining that at least one of the regions having at least a portion of the volume includes reclaimable space; and failing the received request to delete the volume in response to determining that none of the regions include reclaimable space.Type: GrantFiled: June 21, 2017Date of Patent: June 2, 2020Assignee: International Business Machines CorporationInventors: Jonathan Fischer-Toubol, Asaf Porat-Stoler, Yosef Shatsky
-
Publication number: 20200159666Abstract: A computer-implemented method according to one embodiment includes identifying a data write to a specific position within a virtual address space, determining an entry within a metadata structure that corresponds to the specific position within the virtual address space, and adding state information associated with the data write to the entry within the metadata structure, the state information including a size of the data write within the virtual address space and an alignment of the data write within the virtual address space.Type: ApplicationFiled: January 23, 2020Publication date: May 21, 2020Inventors: Yosef Shatsky, Asaf Porat-Stoler
-
Publication number: 20200142823Abstract: A computer-implemented method according to one embodiment includes determining resource usage of at least a first module in a grid storage system having multiple modules and approximately equal resource usage across the multiple modules of the grid storage system. The computer-implemented method further includes determining a garbage collection cost in the grid storage system by stopping garbage collection in a second of the modules of the grid storage system, determining a resource usage in the second module upon stopping the garbage collection, and comparing the resource usage in the second module to the resource usage of the at least the first module. The method further includes adjusting an amount of garbage collection based on both the garbage collection cost and the resource usage.Type: ApplicationFiled: November 5, 2018Publication date: May 7, 2020Inventors: Asaf Porat-Stoler, Yosef Shatsky, Sergey Marenkov, Jonathan Fischer-Toubol, Afief Halumi
-
Publication number: 20200142974Abstract: Methods that can provide distributed data deduplication reference counting are disclosed herein. One method includes generating, by a processor, a secondary reference in response to a determination that a data chunk is a copy of the primary reference in which the primary reference includes a pointer to an existing data chunk stored on a storage device. The method further includes incrementing a secondary reference counter on the primary reference in response to generating the secondary reference. Apparatus and computer program products that can include, perform, and/or implement the methods are also disclosed herein.Type: ApplicationFiled: November 5, 2018Publication date: May 7, 2020Inventors: Asaf Porat-Stoler, Yosef Shatsky, Avraham Bab-Dinitz, Omer Haklay
-
Patent number: 10621084Abstract: Embodiments for efficient garbage collection in a data storage environment. In a storage system comprising multiple storage devices having respective sets of storage regions, at least one respective storage fragmentation threshold used to trigger a garbage collection operation is identified. The garbage collection operation is performed to reclaim data space in the storage system according to each of a block perspective and an area perspective. The block perspective performs the garbage collection operation on individual blocks of data and the area perspective performs the garbage collection operation on a plurality of the blocks in a respective storage region. The block perspective and the area perspective portions of the garbage collection operation are executed independently of one another.Type: GrantFiled: March 5, 2018Date of Patent: April 14, 2020Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Afief Halumi, Yosef Shatsky, Asaf Porat-Stoler, Reut Cohen, Sergey Marenkov
-
Patent number: 10599580Abstract: A computer-implemented method according to one embodiment includes identifying a data write to a specific position within a virtual address space, determining an entry within a metadata structure that corresponds to the specific position within the virtual address space, and adding state information associated with the data write to the entry within the metadata structure, the state information including a size of the data write within the virtual address space and an alignment of the data write within the virtual address space.Type: GrantFiled: May 23, 2018Date of Patent: March 24, 2020Assignee: International Business Machines CorporationInventors: Yosef Shatsky, Asaf Porat-Stoler
-
Publication number: 20190392048Abstract: A computer-implemented method, according to one embodiment, includes: determining which of a plurality of fingerprints correspond to a copy of user data stored in one or more logical volumes at a storage location, and which of the plurality of fingerprints correspond to a pointer that points to a copy of user data stored in the one or more logical volumes at the storage location. A number of unique fingerprints is determined, and a number of the copies of user data stored in the one or more logical volumes is determined. The number of the copies of user data and the number of unique fingerprints are used to calculate an actual deduplication efficiency value. The number of the copies of user data and the number of unique fingerprints are used to calculate a potential deduplication efficiency value. The actual deduplication efficiency value is compared to the potential deduplication efficiency value.Type: ApplicationFiled: June 20, 2018Publication date: December 26, 2019Inventors: Yosef Shatsky, Danny Harnik, Asaf Porat-Stoler, Moshik Hershcovitch
-
Publication number: 20190361814Abstract: A computer-implemented method according to one embodiment includes identifying a data write to a specific position within a virtual address space, determining an entry within a metadata structure that corresponds to the specific position within the virtual address space, and adding state information associated with the data write to the entry within the metadata structure, the state information including a size of the data write within the virtual address space and an alignment of the data write within the virtual address space.Type: ApplicationFiled: May 23, 2018Publication date: November 28, 2019Inventors: Yosef Shatsky, Asaf Porat-Stoler