Emc IP Holding Company LLC

Yadro International Ltd.

Emc Corporation

Ivan Tchoub

Mikhail Danilov

Mikhail Malygin

Andrey Fomin

Maxim S Trusov

Chen Xiao Wang

Nikita Gutsalov

Alexander Fedorov

Shashwat Srivastav

Sergey Koyushev

Konstantin Buinov

Gregory Skripko

Alexey Sigaev

Artem Ikoev

Vladimir Prikhodko

Maria Gavrilova

Alexander Rakulenko

Andrey Vsevolodovich Kurilov

Wei Yin

Vishrut Shah

Yu Teng

Ivan Andreyev

Jie Song

Matthew L Troutman

Boris Vasilievich Popov

Sergey Karpenkov

Karthik Navaneethakrishnan

Ivan Sutyrin

Anton Smolensky

Sergey Kojushev

There is provided a data storage system comprising a power supply module, a plurality of serially connected storage enclosures, where a first storage enclosure of the plurality of serially connected storage enclosures is connected to the power supply module, and a power management module connected to the power supply module. A given storage enclosure includes at least one disk storage. The power management module is configured to selectively cause the power supply module to provide electric power to activate the first storage enclosure. The power management module is further configured to selectively cause the power supply module to provide electric power to activate a second storage enclosure, where the second storage enclosure is connected downstream from the first storage enclosure, and the second storage enclosure is configured to selectively receive power from the power supply module in response to the first storage enclosure being active.

Data storage system power management

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

A method, computer program product, and computer system for receiving a change to a configuration parameter associated with a first cluster node in a cluster configuration. The configuration parameter may be stored in a shared cluster memory. The configuration parameter may be distributed from the shared cluster memory to the cluster configuration.

Configuration management for cloud storage system and method

A method comprising: processing an update to a search tree and updating statistics, the search tree storing information about one or more objects indexed by corresponding object keys; determining to rebuild a first Bloom filter based on the statistics, the first Bloom filter associated with the search tree; generating a second Bloom filter associated with the search tree; populating the second Bloom filter as part of a tracing garbage collection process; and replacing the first Bloom filter with the second Bloom filter.

Incremental bloom filter rebuild for B+ trees under multi-version concurrency control

A transformation service is provided for a plurality of transformation jobs associated with one or more storage containers. A single transformation user runs enumeration tasks associated with data stored in the one or more storage containers. When two or more of the plurality of transformation jobs are active during a time interval, the single transformation user runs an enumeration task for all of the active transformation jobs during said time interval.

System and method for parallel storage transformation

A computer program product, system, and method for determining containers, within a secondary storage, to transform; determining users having access to the containers to transform; synchronizing storage configuration between the secondary storage and a primary storage; enumerating objects within the containers to transform; and adding object identifiers and object metadata for the enumerated objects to an object index within the primary storage.

Transformation processing for objects between storage systems

One embodiment is related to a method for creating a redundancy data chunk for data protection with a chain topology, comprising: transmitting a data chunk of a first frontend zone of a data storage system to a second frontend zone of the data storage system; creating a redundancy data chunk at the second frontend zone of the data storage system based on the data chunk of the first frontend zone and a data chunk of the second frontend zone; passing the redundancy data chunk onto one or more subsequent frontend zones of the data storage system from the second frontend zone, wherein at each subsequent frontend zone the redundancy data chunk is updated based on the received redundancy data chunk and a data chunk of the respective subsequent frontend zone, and wherein the redundancy data chunk is passed through each subsequent frontend zone exactly once; and at a last subsequent frontend zone of the data storage system, forwarding the updated redundancy data chunk to a backend zone of the data storage system for final storage.

System and method for XOR chain

Method for tree management of trees under multi-version concurrency control is described herein. Method starts by detecting change in a size of a cluster. The number of nodes in the cluster is counted to obtain the changed size of the cluster. The number of trees needed for the number of nodes in the cluster is determined. The number of trees may be based on the number of nodes in the cluster and predetermined system balancing coefficient. When the number of trees needed is greater than existing number of trees, existing number of trees is doubled as a single-step operation which includes modifying and scaling hash function used to derive each tree to generate new hash function and using new hash function to partition each tree instantly into two new trees. Scaling happens on demand without service disruption. Hash function scales automatically when number of trees increases. Other embodiments are described.

Method and system for tree management of trees under multi-version concurrency control

A computer program product, system, and method for determining a list of objects, within source storage, to migrate; generating a chunk layout for the objects to migrate; and for each unencoded chunk within the chunk layout: retrieving objects from source storage specified by the unencoded chunk within the chunk layout; generating data and coded fragments for the unencoded chunk using the retrieved objects; and storing the data and coded fragments to primary storage.

Efficient migration to distributed 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

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

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.

Growing community of inventors

Saint Petersburg, Russia

Ivan Tchoub