International Business Machines Corporation

Yariv Bachar

Shay Haim Akirav

Oded Sonin

Asaf Levy

Ron Edelstein

Gil E Paz

Ofer Leneman

Tzafrir Z Taub

Dov N Hepner

Ron Asher

Itay Maoz

Elena Drobchenko

Aharon Lazar

Aviv Kuvent

Aviv Caro

Lior Klipper

Ehud Meiri

Evgeny Budilovsky

Alon Horowitz

Lior Aronovich

Dan Melamed

Samuel Krikler

Ilai Harsgor-Hendin

Ariel J Ish-Shalom

Asaf Ekshtein

Shiri Alexander

Neville Yates

Konstantin Muradov

Gregory Tad Kishi

Joseph W Dain

Osnat Shasha

Shira Ben-Dor

Amir Kredi

Rafael Buchbinder

Johnny David

Ofer Lenaman

Elez Shenhar

In a hash-based multi-tenancy in a deduplication system, incorporating, as if part of input data, a tenant identification (ID) into a hash value calculation using a single hash based index table for separating data segments in a multi-tenant deduplication system.

Hash-based multi-tenancy in a deduplication system

A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. An object identification (ID) and a state ID are sent to the target destination and used to locate and compare the selected object with a current state of the selected object in the target destination.

User initiated replication in a synchronized object replication system

For efficient centralized stream initiation and retry control in a computing environment, using a centralized data streams management module for both managing when data streams should be opened and sent from a source location to a destination and for determining when to reattempt opening data streams sent from the source location to the destination after an nth number of consecutive failed attempts using an incrementing time calculation. The incrementing time calculation computes a dynamically calculated time period.

Efficient centralized stream initiation and retry control

For maintaining consistency for a cache that contains dependent objects in a computing environment, object dependencies for cached objects are managed by defining and maintaining object dependency lists for each one of the cached objects for identifying objects upon which the cached objects are dependent. Maintaining cache consistency for 2 types of cache eviction policies is supported by maintaining an object dependency lists for each one of the cached objects for identifying objects dependent upon the cached object. Each of the objects in an object dependency list is updated when the object is updated.

Maintaining cache consistency in a cache for cache eviction policies supporting dependencies

Various embodiments for managing data in a data storage having data deduplication. A back reference data structure is configured for user data segments as a mechanism to identify an affected storage block to which information in the back reference data structure refers. The back reference data structure is initialized such that a resolution of the back reference data structure diminishes as a number of the user data segments referencing the affected storage block increases.

Back referencing of deduplicated data

For increasing data storage capacity using a processor device, increasing logical capacity of data storage having a multiplicity of storage units containing fixed partitioned segments by moving a selected number of the fixed partitioned segments in one or more storage units to a reserved storage unit.

Increasing data storage capacity

A snapshot of selected objects in a source repository is created in response to the user-initiated replication. The snapshot is designated as a snapshot replication job. Unsynchronized objects in a target destination are detected by comparing a state of the selected objects in the snapshot with a current state of the target destination at the time of execution of the snapshot replication job. One of the selected objects is retrieved in an ordered manner from the snapshot. An object identification (ID) and a state ID are sent to the target destination and used to locate and compare the selected object with a current state of the selected object in the target destination.

A selective tuple versioning is used on a files system for preserving past states of file system nodes by adding a bitmap to a row for a node within a file system table for preserving the past state of the node in a file system, receiving a request for updating the node along with a node identification (ID) and associated attributes of the node needing to be updated, generating a second time value indicating the time of the updating, and duplicating the row for the node into a new row in the file system table with an end time set equal to the second time value if the bit in the bitmap for the node is set.

Preserving past states of file system nodes

A multiplicity of nodes are represented with a unique node identification (ID) and range ID for both enabling the database tree to be modified and identifying descendants of each of the plurality of nodes in a single query.

Representing dynamic trees in a database

A unique file-system node identification (ID) is created for each newly created node in a file system repository by combining a grid identification (ID), a repository identification (ID), and a node identification (ID) to form the unique file-system node ID. The unique file-system node ID is associated with a unique association identification (ID) thereby linking the node from a source repository to a target repository to form an association when performing a replication operation between the source repository and the target repository. Upon removing the association, the unique association ID is unlinked from a replication policy in a source repository, where an initiated replication operation is disabled.

Replica identification and collision avoidance in file system replication

A plurality of server processor workers is configured for the distributed parallel processing of deduplicated data entities in a plurality of chunks. The deduplicated data processing rate is regulated using a rate control mechanism. The rate control mechanism incorporates a debt/credit algorithm specifying which of the plurality of workers processing the deduplicated data entities must wait for each of a plurality of calculated required sleep times, the calculated required sleep times being calculated as a best fit between a maximum allowable sleep time, a delta vector, and a limit per time vector, wherein the required sleep time is one of the plurality of calculated required sleep times.

Deduplicated data processing rate control

A task is marked as dependent upon a preceding task. The task that is attempted to be taken for execution from a head of a pending task queue that is marked is deferred. The deferred task is removed from the pending task queue and placed in a deferred task queue. The deferred task is reinserted back into the pending task queue for execution upon determining that the preceding tasks are completed.

Prioritizing deferred tasks in pending task queue based on creation timestamp

Selective tuple versioning is used on a file system providing file system snapshots by, receiving a request for updating at least one node and at least a node identification (ID) and associated attributes of the plurality of nodes, generating a new snapshot timestamp indicating the time of the updating, duplicating one of a plurality of rows of the nodes in the file system table into a new one of the rows of the file system table with an end time set equal to a new snapshot timestamp if the snapshot has the snapshot timestamp that is greater than a start time and less than the end time of the nodes, and updating the rows of the nodes in the file system table according to the update request, wherein the start time of the nodes is set equal to the new snapshot timestamp.

Growing community of inventors

Ma'abarot, Israel

Yariv Bachar