International Business Machines Corporation

Mellanox Technologies, Ltd.

Strato Scale Ltd.

Alon Horowitz

Yariv Bachar

Oded Sonin

Ron Edelstein

Rafael Buchbinder

Asaf Levy

Aviv Kuvent

Avishay Traeger

Ronnie Lazar

Roman Speigelman

An apparatus includes an interface and a processor. The interface is configured to communicate with a computing system in which one or more workloads issue storage commands for execution in a storage volume comprising multiple storage blocks. The computing system continually updates a data structure that tracks which of the storage blocks of the storage volume have changed due to the storage commands. The processor is configured, in response to a request to create a copy of the storage volume, to instruct the computing system to (i) create a copy of the data structure and reset the data structure, (ii) create the copy of the storage volume, while continuing to execute the storage commands and update the data structure, and (iii) after the copy of the storage volume is completed, merge the data structure into the copy of the data structure.

Management of changed-block bitmaps

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 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 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

In one embodiment, by way of example only, a resource threshold limits the resource usage of each of the multiplicity of clients. The resource threshold of each of the multiplicity of clients increases over time and decreases when the resources deplete and a resource request of a client is rejected. A subset of clients is created from the multiplicity of clients having a resource usage greater than the resource usage of the rejected client. A dynamic average of a normalized number of resources is calculated from the subset of clients. The resource threshold of each client from the subset of clients is decreased based on the dynamic average of the subset of clients, and further acquisition of resources is restricted from each client from the subset of clients in order to bring the resource usage of each of the subset of clients under the resource threshold.

Dynamically balancing resource requirements for clients with unpredictable loads

A method for data storage includes sending write commands to a first storage node, for storing data in a data volume on the first storage node. In response to a decision to create a copy of the data volume on a second storage node, (i) the write commands are sent both to the first storage node and to the second storage node, and (ii) a snapshot of the data volume is created and sent from the first storage node to the second storage node. The copy of the data volume is created by the second storage node based on the snapshot and on one or more of the write commands received at the second storage node.

Growing community of inventors

Tel Aviv, Israel

Alon Horowitz