Lsi Corporation

Netapp, Inc.

Zadara Storage, Inc.

Nelson Nahum

Vladimir Popovski

Moshe Melnikov

Yoav Ossia

Alex Lyakas

Shyam Kaushik V

Lev Vainblat

Ishai Nadler

Yair Hershko

Jeremy Pinson

Alexander Lyakas

A method for providing virtual private storage array (VPSA) service for cloud users over a computer network includes receiving parameters for the VPSA over the network and creating the VPSA from resources of server computers. Creating the VPSA includes allocating and exposing drives that meets or exceeds specified drive characteristics, drive quantity, and array redundancy criteria to virtual controllers (VCs) in the VPSA, and dedicating parts of processor/memory complexes that each meets or exceeds a specified virtual controller hardware model to the VCs. The VCs run on virtual machines on the dedicated parts of processor/memory complexes on independent server computers. The VCs discover the exposed drives, create a virtual pool from the exposed virtual drives, implement data protection on the virtual pool, create volumes from the virtual pool, expose the volumes over the network to a customer computer, and handle access requests to the volumes from the customer computer.

Virtual private storage array service for cloud servers

A data storage system includes three or more storage devices, each associated with a unique data volume. A first one of the data storage devices at least has two or more data storage areas but can have more storage areas, which can be either data storage areas or parity storage areas. A second data storage device at least has two storage areas, one of which is a data storage area. A third data storage device at least has a parity storage area but can have more storage areas, which can be either data storage areas or parity storage areas. A first group of corresponding storage areas is defined by at least the data storage areas of the first and second storage devices and the parity storage area of the third storage device. A second group of corresponding storage areas is defined by at least the storage areas of the first and second storage devices. When a data segment is written to one of the data storage areas of a storage device, parity information can be updated using information read from one or more storage areas of the group of corresponding storage areas having the data storage area to which the data segment is written.

Redundant array of independent storage

Methods and systems for improving performance in a storage system utilizing snapshots are disclosed by using metadata management of snapshot data. Specifically, various metadata structures associated with snapshots are utilized to reduce the number of IO operations required to locate data within any specific snapshot. The number of IO operations are reduced by allowing the various metadata structures associated with the temporally current snapshot to locate data directly within any temporally earlier snapshot or on the original root volume.

Snapshot metadata management in a storage system

Methods and apparatuses are provided for active-active support of virtual storage management in a storage area network ('SAN'). When a storage manager (that manages virtual storage volumes) of the SAN receives data to be written to a virtual storage volume from a computer server, the storage manager determines whether the writing request may result in updating a mapping of the virtual storage volume to a storage system. When the writing request does not involve updating the mapping, which happens most of the time, the storage manager simply writes the data to the storage system based on the existing mapping. Otherwise, the storage manager sends an updating request to another storage manager for updating a mapping of the virtual storage volume to a storage volume. Subsequently, the storage manager writes the data to the corresponding storage system based on the mapping that has been updated by the another storage manager.

Active-active support of virtual storage management in a storage area network ('SAN')

Systems and methods herein provide for protecting data using snapshots and images of those snapshots to quickly recreate data upon request. For example, a storage controller of a data storage system allocates a period of time between creating snapshots of data in a first storage volume of the data storage system. The controller then logs received write requests to the first storage volume and generates snapshot of data in the first storage volume based on the allocated period of time. Thereafter, the controller may receive a request to recreate data. The controller locates the snapshot in the first storage volume based on that request to recreate the data. In doing so, the controller generates a snapshot image in a second storage volume. The controller then retrieves logged write requests and applies them to the snapshot image to recreate the data in the second storage volume.

Data protection in a data storage system

Data segments are logically organized in clusters in a data repository of a data storage system. Each clusters contains compressed data segments and data common to the compression of the segments, such as a dictionary. In association with a write request, it is determined in which of the clusters would the data segment most efficiently be compressed, and the data segment is stored in that data cluster.

Storage system data compression enhancement

Data segments are logically organized in groups in a data repository. Each segment is stored at an index in the data repository. In association with a write request, a hash algorithm is applied to the data segment to generate a group identifier. Each group is identifiable by a corresponding group identifier. The group identifier is applied to a hash tree to determine whether a corresponding group in the data repository exists. Each existing group in the data repository corresponds to a leaf of the hash tree. If no corresponding group exists in the data repository, the data segment is stored in a new group in the data repository. However, if a corresponding group exists, the group is further searched to determine if a data segment matching the data segment to be stored is already stored. The data segment can be stored in accordance with the results of the search.

Growing community of inventors

Tustin, CA, United States of America

Nelson Nahum