Emc IP Holding Company LLC

Yadro International Ltd.

Maxim S Trusov

Mikhail Danilov

Andrey Fomin

Ivan Tchoub

Konstantin Buinov

Mikhail Malygin

Vladimir Prikhodko

Chen Xiao Wang

Andrey Vsevolodovich Kurilov

Sergey Koyushev

Shashwat Srivastav

Alexander Rakulenko

Kirill Zakharov

Nikita Gutsalov

Alexey Sigaev

Artem Ikoev

Sergey Karpenkov

Gregory Skripko

Wei Yin

Vishrut Shah

Kirill Viktorovich Gusakov

Yu Teng

Ivan Andreyev

Jie Song

Alexander Fedorov

Matthew L Troutman

Karthik Navaneethakrishnan

Sergey Kojushev

There is provided a method for executing disk operations in a data storage system (DSS) including a power supply connected to a plurality of serially connected storage enclosures, and a power management module, where each storage enclosure includes at least one disk storage. Each logical partition of plurality of logical partitions is hosted on respective sets of disk storages corresponding to protection groups. The DSS causes activation of a set of protection groups, and authorizes a subset of protection groups to accept execution of disk operations. Disk operations are received and executed by the subset. In response to determining that an operation parameter of a given protection group of the subset is equal to a predetermined threshold, a remaining protection group of the set of protection groups is added to the subset, and a new protection group is activated and added to the set of protection groups.

Method of and data storage system for executing disk operations

One embodiment is related to a method for remote replication recovery, comprising: determining that a damaged data chunk at a first zone of a cloud storage system is not recoverable locally; determining one or more data fragments of the damaged data chunk that are to be recovered with remote replication recovery based on data stored at a second zone and at a third zone of the cloud storage system, wherein the damaged data chunk comprises a plurality of data fragments; recovering the one or more data fragments of the damaged data chunk with remote replication recovery based on the data stored at the second zone and at the third zone of the cloud storage system; and repairing the damaged data chunk with the recovered data fragments at the first zone.

Fast geo recovery method for elastic cloud storage

Structures and processes for garbage collection of search trees under Multi-Version Concurrency Control (MVCC). Such search trees may be used to store data within a distributed storage system. A process detects live search tree elements using tracing and then identify storage chunks having no live elements as garbage to be reclaimed. The process can be paused and resumed to reduce impact on other system processing.

Tracing garbage collector for search trees under multi-version concurrency control

Systems and processes for statistics management in a distributed storage system using a flat cluster architecture. Statistics for managed objects are collected using virtual statistics groups across multiple storage nodes. The systems and processes are compatible with storage systems that utilize microservice architectures.

Statistics management for scale-out storage

A method, computer program product, and computer system for monitoring health of at least one storage device of a cache in a clustered system. A recovery journal may be maintained, wherein the recovery journal may identify whether one or more chunks of data stored in the cache have been dumped from the at least one storage device to persistent storage in the clustered system. A state of the at least one storage device may be determined based upon, at least in part, the health of the at least one storage device. A recovery action may be performed on the one or more chunks of data stored in the at least one storage device based upon, at least in part, the state of the at least one storage device.

Cloud storage write cache management system and method

A system, computer program product, and computer-executable method for use with a distributed storage system comprising a plurality of storage nodes each having attached storage devices, the system, computer program product, and computer-executable method including receiving a request, at a first storage node of the plurality of storage nodes, to store a large portion of data, using at least one of a first type of data chunk and a plurality of a second type of data chunks to store the large portion of data, processing each of the plurality of the second type of data chunks, processing each of the at least one of the first type of data chunk, and returning an acknowledgement to the request.

Efficient erasure coding of large data objects

A method for avoiding recovery and storage of useless data is disclosed. The operations comprise: determining that a subset of data fragments out of a plurality of data fragments have become unavailable, the plurality of data fragments forming a data chunk, wherein the plurality of data fragments are protected by additional redundancy data; determining whether all of data that were stored in the unavailable subset of data fragments when the unavailable subset of data fragments were available would be useless if recovered using remaining available data fragments of the data chunk and the redundancy data; and in response to determining that all of the data that were stored in the unavailable subset of data fragments would be useless if recovered, generating new redundancy data for protecting the remaining available data fragments of the data chunk without recovering the data that were stored in the unavailable subset of data fragments.

Content-aware data recovery method for elastic cloud storage

A data storage system, including a host server having storage processors, a PCIe fabric, and a GBE fabric, and two or more data storage modules having a bank of DRAM, long-term storage drives, a host interface, including a PCIe interface and a GBE interface, an application specific integrated circuit connected to the host interface, the storage drives, and the DRAM, and a battery, the battery providing power to the DRAM and SSDs in an event of failure of a main power supply. Data streams transmitted from the host server via a PCIe connection of the PCIe fabric are received at the host interface and placed directly in DRAM as a write-back cache operation. In addition, the battery provides the DRAM with non-volatile memory capabilities and the storage modules with portability. A method for arbitration of write requests between the storage processors of the data storage system is also disclosed.

Arbitration control system and method for storage systems

A technique to accelerate Galois Field (GF) arithmetic. The technique, which does not rely on any specific processor instruction set, can be used to accelerate erasure coding within storage systems.

Accelerated Galois field coding for storage systems

A method comprising: generating a storage chunk having a plurality of data fragments, the storage chunk stored in one or more storage devices; allocating space in a primary memory to store a plurality of coded fragments; receiving a plurality of I/O requests to write data; allocating space in the primary memory to store a next unfilled data fragment; processing a plurality of I/O requests to write data; and copying the coded fragments from the primary memory to the one or more storage devices. For each I/O request, writing the data to the next unfilled data fragment in the one or more storage devices, writing the data to the next unfilled data fragment in the primary memory, and if the data fragment in the primary memory is full, updating the coded fragments in the primary memory using the filled data fragment in the primary memory.

Incremental erasure coding for storage systems

The disclosure relates data protection management (e.g. data re-protection) for distributed storage systems. Specifically, the systems (and methods) of the disclosure implement erasure coding to protect replicated data efficiently while reducing the storage capacity overhead. Traditional approaches for data re-protection that implement erasure coding often require performing a complete re-encoding to reflect changes in data (e.g. a removal of data). The disclosure provides an improved mechanism for data re-protection by implementing an efficient re-encoding (or un-encoding) process that reduces the requirements for data reads and operations, and thus, reduces the resource requirements for data re-protection.

System and method for data re-protection with erasure coding

A method, computer program product, and computer system for identifying, by a computing device, a plurality of used chunks, wherein the plurality of used chunks may include a plurality of free blocks and at least one non-free block. A capacity of the plurality of free blocks that is available to reclaim may be verified. The capacity of the plurality of free blocks may be reclaimed. A composite chunk from the plurality of free blocks may be created.

System and method for quasi-compacting garbage collection

A method comprising: receiving an I/O request for object data; determining one or more data fragments wherein the object data is stored; determining that one or more of the data fragments are unavailable; determining, from within the one or more unavailable data fragments, a set of slices storing the object data, each slice comprising k small data fragments and m coded fragments; for each slice, retrieving at least k small data and coded fragments within the slice from storage; and recovering a segment of the object data using the retrieved small data and coded fragments. A related system and computer program product are also described.

Data object recovery for storage systems

Systems and methods for efficiently protecting data within a distributed storage system using erasure coding. Unnecessary network traffic can be eliminated by scheduling executing erasure coding tasks on storage nodes that have local copies of data. Encoding may be performed in parallel by multiple nodes to reduce elapsed encoding time.

Erasure coding for elastic cloud storage

A method for generating coded fragments comprises receiving data to be encoded, splitting the data into a plurality of data fragments, identifying a first group of data fragments from among the plurality of data fragments using a coding matrix, summing the data fragments within the first group of data fragments to generate a first group sum, and using the first group sum to calculate at least a portion of two or more coded fragments.

Growing community of inventors

Saint Petersburg, Russia

Maxim S Trusov