Patents by Inventor Yair Toaff
Yair Toaff 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: 20140181162Abstract: Systems. Methods, and Computer Program Products are provided for managing a global cache coherency in a distributed shared caching for a clustered file systems (CFS). The CFS manages access permissions to an entire space of data segments by using the DSM module. In response to receiving a request to access one of the data segments, a calculation operation is performed for obtaining most recent contents of one of the data segments. The calculation operation performs one of providing the most recent contents via communication with a remote DSM module which obtains the one of the data segments from an associated external cache memory, instructing by the DSM module to read from storage the one of the data segments, and determining that any existing contents of the one of the data segments in the local external cache are the most recent contents.Type: ApplicationFiled: December 18, 2013Publication date: June 26, 2014Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Yair TOAFF, Gil PAZ, Ron ASHER
-
Patent number: 8745103Abstract: Systems. Methods, and Computer Program Products are provided for managing a global cache coherency in a distributed shared caching for a clustered file systems (CFS). The CFS manages access permissions to an entire space of data segments by using the DSM module. In response to receiving a request to access one of the data segments, a calculation operation is performed for obtaining most recent contents of one of the data segments. The calculation operation performs one of providing the most recent contents via communication with a remote DSM module which obtains the one of the data segments from an associated external cache memory, instructing by the DSM module to read from storage the one of the data segments, and determining that any existing contents of the one of the data segments in the local external cache are the most recent contents.Type: GrantFiled: January 3, 2013Date of Patent: June 3, 2014Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Patent number: 8738671Abstract: Systems. Methods, and Computer Program Products are provided managing a global cache coherency and reducing messaging traffic for coordination of access permissions in a distributed shared caching for a clustered file systems (CFS). The CFS manages access permissions to an entire space of the data segments by using the DSM module. In response to processing a request message from a remote DSM module to access one of the data segments, including in a response message permission to access the one of the data segments, and deciding if one of a transfer of ownership, and most recent contents of the one of the data segments should be included in the response message for the permission to access the one of the data segments. The last two components of the response message depend upon availability of the one of the data segments that is requested in a local external cache.Type: GrantFiled: January 3, 2013Date of Patent: May 27, 2014Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Patent number: 8682854Abstract: A deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments. A calculation is performed producing a deduplication digest for a data sub-segment, where the calculation is based on the retrieved deduplication digests of the plurality of stored data sub-segments referenced by the input data sub-segment.Type: GrantFiled: June 4, 2012Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Lior Aronovich, Michael Hirsch, Yair Toaff
-
Patent number: 8682873Abstract: A deduplication storage system enables new input data to be deduplicated with data of synthetic backups already constructed, and for this purpose efficiently calculates deduplication digests for synthetic backups being constructed, based on already existing digests of data referenced by the synthetic backups. For each input data segment of the plurality of input data segments of a synthetic backup being constructed, a plurality of deduplication digests of stored data segments, referenced by the input data segment, is retrieved from an index. Each input data segment is partitioned into each of a plurality of fixed-sized data sub-segments. A calculation is performed producing a deduplication digest for a data sub-segment, where the calculation is based on the retrieved deduplication digests of the plurality of stored data sub-segments referenced by the input data sub-segment.Type: GrantFiled: December 1, 2010Date of Patent: March 25, 2014Assignee: International Business Machines CorporationInventors: Lior Aronovich, Michael Hirsch, Yair Toaff
-
Publication number: 20130290279Abstract: Exemplary method, system, and computer program product embodiments for scalable data deduplication working with small data chunk in a computing environment are provided. In one embodiment, by way of example only, for each of the small data chunk, a signature is generated based on a combination of a representation of characters that appear in the small data chunk with a representation of frequencies of the small data chunk. A signature is generated based on a combination of a representation of characters that appear. The signature is used to help in selecting the data to be deduplicated. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: June 27, 2013Publication date: October 31, 2013Inventors: Lior ARONOVICH, Ron ASHER, Michael HIRSCH, Shmuel T. KLEIN, Ehud MEIRI, Yair TOAFF
-
Publication number: 20130290278Abstract: Exemplary method, system, and computer program product embodiments for scalable data deduplication working with small data chunk in a computing environment are provided. In one embodiment, by way of example only, for each of the small data chunk, a signature is generated based on a combination of a representation of characters that appear in the small data chunk with a representation of frequencies of the small data chunk. A signature is generated based on a combination of a representation of characters that appear. The signature is used to help in selecting the data to be deduplicated. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: June 27, 2013Publication date: October 31, 2013Inventors: Lior ARONOVICH, Ron ASHER, Michael HIRSCH, Shmuel T. KLEIN, Ehud MEIRI, Yair TOAFF
-
Patent number: 8560581Abstract: Systems. Methods, and Computer Program Products are provided for recovering transactions of failed nodes using a recovery procedure in a clustered file system (CFS). A data segment is determined that the data segment should be copied to a final storage location by validating that an ownership of the data segment is not associated with any other operational node, via a distributed shared memory (DSM) agent. The ownership of the data segment is set to a local DSM agent.Type: GrantFiled: August 6, 2012Date of Patent: October 15, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Publication number: 20130232120Abstract: Input backup data is deduplicated with data of a synthetic backup previously constructed by a deduplication storage system. A synthetic backup is constructed by processing metadata instructions provided by a backup application. Deduplication digests are calculated based on the data of the synthetic backup and the deduplication digests are stored in a digests index. When new backup data is processed, deduplication digests of the new data are calculated and searched in the digests index. Matching digests of previously constructed synthetic backups are located in the digests index. Each of the located matching digest references stored data are included in the synthetic backup, and the stored data is similar to the input backup data. Data matches are found in the input backup data and data in the synthetic backup.Type: ApplicationFiled: March 13, 2013Publication date: September 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael HIRSCH, Yair TOAFF
-
Publication number: 20130232117Abstract: A deduplication storage system and a backup application create a synthetic backup. Metadata instructions are provided to the deduplication storage system. Each of the metadata instructions specifies the data segment of an originating backup and a designated location of the data segment in the synthetic backup. A set of metadata instructions is transformed into a transformed set of metadata instructions.Type: ApplicationFiled: March 13, 2013Publication date: September 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael HIRSCH, Yair TOAFF
-
Publication number: 20130232119Abstract: A deduplication storage system and a backup application create a synthetic backup. Metadata instructions are provided to the deduplication storage system. Each of the metadata instructions specifies the data segment of an originating backup and a designated location of the data segment in the synthetic backup. Each of the metadata instructions are processed by locating those data sub-segments in the deduplication storage system specified by the data segment in each of the metadata instructions, and creating metadata references to each of the data sub-segments and adding the metadata references to metadata of the synthetic backup being created.Type: ApplicationFiled: March 13, 2013Publication date: September 5, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael HIRSCH, Yair TOAFF
-
Patent number: 8516020Abstract: Systems, Methods, and Computer Program Products are provided for performing concurrent checkpoints from file system agents residing on different nodes within in a clustered file system (CFS). Responsibility to checkpoint a modified and a committed data segment to a final storage location is assigned to one of the file system agents. One of the file system agents, which is assigned, is the file system agent whose associated distributed shared memory (DSM) agent is an owner of the data segment.Type: GrantFiled: August 6, 2012Date of Patent: August 20, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Patent number: 8516021Abstract: Systems, Methods, and Computer Program Products are provided for concurrent checkpointing and modifications in a transactional clustered file system (CFS). Shadow data segments, whose contents are identical to an original data segment currently being written by a checkpoint operation, for users that require access for modification to data segments concurrently being written within a checkpoint operation.Type: GrantFiled: August 6, 2012Date of Patent: August 20, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Patent number: 8510351Abstract: Systems. Methods, and Computer Program Products are provided for implementing transactional processing for user operations in a clustered file system (CFS). Transactional functionality is provided for user defined operations for one of writing and modifying files, and user defined write operations and individual user defined modification operations to various possible alternative files are wrapped into either a single transaction or multiple transactions individual.Type: GrantFiled: August 6, 2012Date of Patent: August 13, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Publication number: 20130198753Abstract: For full exploitation of parallel processors for data processing, a set of parallel processors is partitioned into disjoint subsets according to indices of the set of the parallel processors. The size of each of the disjoint subsets corresponds to a number of processors assigned to the processing of the data chunks at one of the layers. Each of the processors are assigned to different layers in different data chunks such that each of processors are busy and the data chunks are fully processed within a number of the time steps equal to the number of the layers. A transition function is devised from the indices of the set of the parallel processors at one time steps to the indices of the set of the parallel processors at a following time step.Type: ApplicationFiled: January 30, 2012Publication date: August 1, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael HIRSCH, Shmuel Thomas KLEIN, Yair TOAFF
-
Publication number: 20130198754Abstract: Exemplary method, system, and computer program product embodiments for full exploitation of parallel processors for data processing are provided. In one embodiment, by way of example only, a set of parallel processors is partitioned into disjoint subsets according to indices of the set of the parallel processors. The size of each of the disjoint subsets corresponds to a number of processors assigned to the processing of the data chunks at one of the layers. Each of the processors are assigned to different layers in different data chunks such that each of processors are busy and the data chunks are fully processed within a number of the time steps equal to the number of the layers. A transition function is devised from the indices of the set of the parallel processors at one time steps to the indices of the set of the parallel processors at a following time step.Type: ApplicationFiled: June 28, 2012Publication date: August 1, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Michael HIRSCH, Shmuel Thomas KLEIN, Yair TOAFF
-
Patent number: 8495110Abstract: Systems. Methods, and Computer Program Products are provided for concurrent processing of transactions and read operations for achieving serialization and isolation in a clustered file system (CFS). Users, performing read only operations, are allowed to currently access the CFS while mutually excluding and serializing transactions of users affecting a same portion of the CFS. Transactions are ordered across a cluster of nodes of the CFS according to the transactions termination time.Type: GrantFiled: August 6, 2012Date of Patent: July 23, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Patent number: 8489655Abstract: Systems, Methods, and Computer Program Products are provided for restoring data segments in a clustered file system (CFS). Contents of the data segments, that were modified during a transaction, which is being rolled-back to the most recent contents of the data segments prior to the transaction commencing, are restored. Locations of the most recent contents of the data segments, which are restored, are identified.Type: GrantFiled: August 6, 2012Date of Patent: July 16, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Yair Toaff, Gil Paz, Ron Asher
-
Publication number: 20130179759Abstract: Exemplary method, system, and computer program product embodiments for an incremental modification of an error detection code operation are provided. In one embodiment, by way of example only, for a data block requiring a first error detection code (EDC) value to be calculated and verified and is undergoing modification for at least one randomly positioned sub-blocks that becomes available and modified in independent time intervals, a second EDC value is calculated for each of the randomly positioned sub-blocks. An incremental effect of the second EDC value is applied for calculating the first EDC value and for recalculating the first EDC value upon replacing at least one of the randomly positioned sub-blocks. The resource consumption is proportional to the size of at least one of the randomly positioned sub-blocks that are added and modified. Additional system and computer program product embodiments are disclosed and provide related advantages.Type: ApplicationFiled: January 11, 2012Publication date: July 11, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Lior ARONOVICH, Michael HIRSCH, Shmuel Thomas Klein, Yair TOAFF
-
Patent number: 8484170Abstract: For scalable data deduplication working with small data chunks in a computing environment, for each of the small data chunks, a signature is generated based on a combination of a representation of characters that appear in the small data chunks with a representation of frequencies of the small data chunks. The signature is used to help in selecting the data to be deduplicated.Type: GrantFiled: September 19, 2011Date of Patent: July 9, 2013Assignee: International Business Machines CorporationInventors: Lior Aronovich, Ron Asher, Michael Hirsch, Shmuel T. Klein, Ehud Meiri, Yair Toaff