International Business Machines Corporation

Xiv Ltd.

Shemer Schwartz

Ofir Zohar

Haim Helman

Yaron Revah

Dror Cohen

Efri Zeidner

Kariel Sendler

Kariel E Sandler

Moshe Yanai

Shai Gross

Amihay Birenboim

Omri Palmon

Ehood Garmiza

Yair G Chuchem

Efri Zernier

One or more parameters of a received data service request may be compared against a lookup table. Based on one or more priority values stored in the lookup table and associated with the one or more request parameters, the data service request may be assigned a priority level.

System, method, and circuit for servicing a client data service request

Disclosed is a data processing and/or storage system. The data processing and/or storage system may include at least two interfaces, wherein each of the at least two interfaces includes a non-dedicated communication port for communicating data to and form external data systems or clients based on a rule base.

System and method for mirroring data

Various embodiments of the invention relate to an apparatus and a method of managing a snapshot storage pool (SSP) associated with a storage unit of a distributed data storage system. One apparatus includes a logic module and a processor. The logic module is adapted to provide a threshold corresponding to a ratio between a current amount of storage resources used for storing snapshots in the SSP and a total storage capacity defined for the SSP. The processor is adapted to trigger an action that may be effective for managing the SSP in response to the amount of storage resources used for storing snapshots in the SSP crossing the threshold.

Managing snapshot storage pools

A plurality of upgraded components associated with an upgraded storage subsystem replaces a plurality of existing components associated with an existing storage subsystem. Support for a verify I/O command is created. A target volume is created in the upgraded storage subsystem having a same volume identification as a source volume. For a command received on the at least one of the plurality of upgraded components, the verify I/O command is invoked on at least one of a comparable one of the plurality of existing components. If the command is verified, the command is driven. The at least one of the plurality of upgraded components disguises a true volume identification of the target volume from the at least one of the plurality of existing components.

Concurrent upgrade of all components in storage subsystems

A method for migrating data to a mass storage system, including receiving an incoming data partition for storage in the mass storage system and allocating logical storage for the incoming data partition in the mass storage system. The method further includes making a determination that the incoming data partition includes only zero data, and, in response to the determination, inhibiting physical storage of the incoming data partition in the mass storage system while maintaining the allocated logical storage for the incoming data partition.

Thin provisioning migration and scrubbing

Various embodiments of the invention relate to an apparatus and a method of managing a snapshot storage pool (SSP) associated with a storage unit of a distributed data storage system. According to some embodiments of the invention, the apparatus may include a logic module and a processor. The logic module may be adapted to provide a threshold corresponding to a ratio between a current amount of storage resources used for storing snapshots in the SSP and a total storage capacity defined for the SSP. The processor may be adapted to trigger an action that may be effective for managing the SSP in response to the amount of storage resources used for storing snapshots in the SSP crossing the threshold.

A method for data mirroring including receiving a sequence of transactions at a first storage node from a host indicating data to be stored by the node, storing the data therein, and delineating a first batch of the transactions. The node returns to the host an acknowledgment of having stored the data, delineates a second batch of the transactions received subsequent to the acknowledgment, and conveys the data to a second storage node. The first node also conveys to the second node a first record of the transactions in the first batch and a second record of the transactions in the second batch, and the data are stored in the second node responsively to the first and second records, so that all data indicated by the transactions in the first batch are stored by the second node prior to storing data indicated by the transactions in the second batch.

Parallel asynchronous order-preserving transaction processing

Some embodiments of the invention relate to an apparatus and a method of managing a snapshot storage pool (SSP) associated with a storage unit of a distributed data storage system. According to some embodiments of the invention, the apparatus may include a logic module and a controller. The logic module may be adapted to provide a threshold corresponding to a ratio between a current amount of storage resources used for storing snapshots in the SSP and a total storage capacity defined for the SSP. The controller may be adapted to trigger an action which may be effective for managing the SSP in response to the amount of storage resources used for storing snapshots in the SSP crossing the threshold.

Method, an apparatus and a system for managing a snapshot storage pool

A method is disclosed for operating a data storage system having one or more network interfaces and a plurality of data storage nodes configured to provide redundant storage locations. The method includes storing a set of node partitions on a given storage node of the plurality of data storage nodes. The method also includes, following a recovery by the given storage node from a malfunction, making a determination for a node partition in the set whether the node partition is current or noncurrent, and processing the node partition according to the determination.

Restoring data to a distributed storage node

A method for operating a storage system, consisting of performing an allocation of respective partitions of a physical storage resource of the storage system to respective hosts of the storage system. The method also includes changing the allocation while permitting the respective hosts of the storage system to access the physical storage resource.

Systems and methods for temporarily transferring use of portions of partitioned memory between host computers

A method for storing data blocks, including forming the data blocks into groups comprising N&#xb7;M data blocks, where N and M are different positive integers. For every group, the N&#xb7;M data blocks are assigned to correspond to elements of an array comprising N rows and M columns. A respective parity block is calculated for each of the N rows and M columns, to form (N+M) parity blocks. The resulting (N+M) parity blocks and N&#xb7;M data blocks are stored in respective storage devices.

Storing data redundantly

A system, method and circuit for efficiently managing a cache storage device. A cache storage device may include a cache management module. The cache management module may be adapted to generate a management unit and to associate the management unit with new data that is to be written into the cache. The cache management module may be further adapted to assign two or more allocation units for each management unit, to store the new data in the cache. A cache management module may include a management unit module. The management unit module may be adapted to generate management units associated with predefined global cache management functions. The cache management module may further include an allocation unit module in communication with the management unit module. The allocation unit module may be adapted to assign allocation units for storing data written into the cache.

Method, system and circuit for efficiently managing a cache storage device

Upon receiving a request for one or a set of data blocks associated with a given data segment, a disk cache controller may retrieve into cache the some part of the entire data segment from a disk. Each data segment on a disk may include a fixed number of data blocks, and all data segments may include the same number of data blocks. Data segments may be dynamically defined and their locations and sizes may vary from segment to segment. Data segments may be defined when data is written to the disk, or may be defined at a later point. A table associated with a cache controller may store information as to the physical location or address on a disk of the starting point and/or size of each data segment.

Growing community of inventors

Herzelia, Israel

Shemer Schwartz