Emc IP Holding Company LLC

Dell Products Inc.

Jibing Dong

Jian Gao

Geng Han

Hongpo Gao

Xinlei Xu

Jianbin Kang

Shaoqin Gong

Jamin Jianbin Kang

Lifeng Yang

Baote Zhuo

Wayne Li

Ruiyong Jia

Ree Sun

Huibing Xiao

Ilya Usvyatsky

Chun Ma

Yousheng Liu

Liam Xiongcheng Li

Vladimir Shveidel

Changyu Feng

Lili Chen

Lei Sun

Xiongcheng Li

Michael P Wahl

Naizhong Chiu

Huadong Li

Peter Puhov

Shuyu Lee

Haiying Tang

Tao Xu

Weihua Li

Zhihui Qiu

Vamsi K Vankamamidi

Yue Hua Zhang

Sheng Wang

Xiaobo Zhang

Robert Foley

Lester Zhang

Yingying Song

Rongrong Shang

Ronald D Proulx

Qingyun Liu

Haiyun Bao

Tianshu Sun

Wenxuan Yin

Sun Ree

Xu Xinlei

Gang Han

Multiple co-resident flush working sets are created in a data storage system. Each flush working set indicates host data that was received by the data storage system from at least one host computing device during a period of time corresponding to that flush working set. Host data indicated by the flush working sets is to be flushed from a storage processor of the data storage system to non-volatile data storage devices of the data storage system, and indications of host data within the flush working sets are organized according to logical block addresses of the indicated host data. Multiple independently executing flusher threads flush the host data indicated by at least one of the flush working sets from the storage processor to the non-volatile data storage devices of the data storage system.

Creating and using multiple flush working sets in a data storage system

Techniques for processing write conflicts involve determining, in response to receiving a write operation for a stripe, a state of a backend operation of a stripe set, wherein the backend operation includes one of a rebuilding or re-striping operation. The techniques further involve stopping the write operation in response to the state of the backend operation indicating that the backend operation is being executed in the stripe. The techniques further involve executing the write operation in response to the state of the backend operation indicating that the backend operation is not being executed in the stripe. Accordingly, write conflicts between a write operation and a backend operation for the same stripe can be favorably avoided, and concurrent execution of the write operation and the backend operation simultaneously for the same stripe is prevented, thus preventing the deterioration of a storage system and improving storage system security and stability.

Method, device, and computer program product for processing write conflicts

A method, computer program product, and computing system for monitoring data reduction information concerning a plurality of containers from a flush working set within a log memory system of a storage system, wherein the plurality of containers are associated with a storage object. An assigned working set size may be determined for a flusher based upon, at least in part, the data reduction information. The assigned working set may be generated for the flusher by adding one or more containers from the flush working set to the assigned working set based upon, at least in part, the assigned working set size. The one or more containers may be flushed, using the flusher, from the assigned working set to persistent memory within the storage system.

Storage and method for adaptive flushing in log structured storage systems

Techniques lock a storage area in a storage system including a first storage node and a second storage node. Such techniques involve adjusting a value of at least one of a first counter at the first node and a second counter at the second node in response to receiving a data access request for the storage area at at least one of the first node and the second node. Such techniques further involve allocating a lock flag to the first node in response to a ratio of the value of the first counter to the value of the second counter being greater than a first threshold, the lock flag indicating that the storage area is locked by the first node. Accordingly, storage resources required by nodes that are accessed more frequently in statistics are effectively reduced, and the efficiency of applying stripe lock reduction are improved.

Method, device and computer program product for locking a storage area in a storage system

Techniques manage tracking records in an application system which includes an active dump file and an inactive dump file. A set of tracking records indicating a state of the application system is received. The set of tracking records is added to the active dump file. A storage signal for storing the active dump file into a backup device associated with the application system is generated according to a determination that a size of the active dump file meets a predetermined size threshold and according to a determination that a state of the inactive dump file is a ready state. The ready state indicates that the inactive dump file is available for storing another set of tracking records to be received in the future. Accordingly, two dump files may alternately store tracking records, and copies of the dump files may be continuously stored into a backup device to improve reliability.

Method, device, and computer storage medium for managing trace record

A method, computer program product, and computing system for processing, using a storage node, one or more updates to one or more metadata pages of a multi-node storage system. The one or more updates may be stored in one or more data containers in a cache memory system of the storage node, thus defining an active working set of data containers. Flushing ownership for each data container of the active working set may be assigned to one of the storage nodes based upon an assigned flushing ownership for each data container of a frozen working set and a number of updates within the frozen working set processed by each storage node, thus defining an assigned flushing storage node for each data container of the active working set. The one or more updates may be flushed, using the assigned flushing storage node, to a storage array.

System and method for multi-node storage system flushing

A method, computer program product, and computing system for assigning flush ownership for a plurality of containers of a common frozen flushing work set to a storage processor of a pair of storage processors of a storage system. For each container of the plurality of containers of the common frozen flushing work set not assigned to a particular storage processor, the storage space of the container not assigned to the particular storage processor is reclaimed. For each container of the plurality of containers of the common frozen flushing work set assigned to a particular storage processor, data stored in the container assigned to the particular storage processor is flushed to persistent memory of the storage system.

Storage management system and method

A technique manages a computing system based on a client/server architecture. In particular, an address mapping of a storage system is managed. The address mapping includes an association between storage spaces in a plurality of storage devices in the storage system and a user of the storage system. A data access service is provided to a client associated with the user based on the address mapping. The client includes at least any one of a user data client for accessing user data associated with the user in the storage system and a control data client for accessing control data associated with the user. Based on a client/server architecture, a uniform management mode is provided for user data and control data, so that the storage system is managed more simply and effectively.

Method, device, and program product for managing computing system based on client/server architecture

A method, computer program product, and computing system for executing a plurality of IO traces on a storage system. At least one vertical flow and at least one horizontal flow associated with the at least one vertical flow may be defined for the plurality of IO traces. A hierarchical representation of the plurality of IO traces may be generated with the at least one vertical flow and the at least one horizontal flow associated with the at least one vertical flow defined for the plurality of IO traces.

IO request flow performance analysis system and method

In creating an extent array in a storage system, in response to receiving a request to generate an extent array using idle extents in storage devices, a width of an extent stripe is determined, and a size of the extent array is designated by the storage system. A first extent group and a second extent group are respectively selected from the storage devices based on the width to form a first extent stripe and a second extent stripe, and a first extent at a given position in the first extent group and a second extent at a given position in the second extent group are respectively located in different storage devices. Based on the first extent stripe and the second extent stripe, an address mapping representing the extent array is generated. The address mapping includes association between extent identifiers of extents and extent indexes of the extents.

Method, device, and program product for creating extent array in storage system

Techniques for data recovery involve: reading target data corresponding to a first logical block from a first data block of a stripe of a RAID system, the target data being a compressed version of data in the first logical block; in accordance with a determination that an error occurs in the target data, reading data from a plurality of second data blocks of the stripe and first parity information from a first parity block of the stripe; comparing respective checksums of the data read from the plurality of second data blocks with a first predetermined checksum and a checksum of the first parity information with a second predetermined checksum; and determining recoverability of the target data based on a result of the comparison. Accordingly, it is possible to simplify the data recovery process, reduce the calculation and time costs in the data recovery, and improve the data recovery efficiency.

Methods for data writing and for data recovery, electronic devices, and program products

In response to receiving a read request for target data, an external address of the target data is obtained from the read request, which is an address unmapped to a storage system; hit information of the target data in cache of the storage system is determined based on the external address; and based on the hit information, an address from the external address and an internal address for providing the target data is determined. The internal address is determined based on the external address and a mapping relationship. Therefore, it can shorten the data access path, accelerate the responding speed for the data access request, and allow the cache to prefetch the data more efficiently.

Method, apparatus and computer program product for managing data access

Techniques for managing data involve receiving a write request to write a data block into a first stripe in a disk array, the write request comprising a first storage address for storing the data block. The techniques further involve determining, based on the first storage address, a first group of disks related to a data portion of the first stripe and a second group of disks related to a parity portion of the first stripe. The techniques further involve, in response to a first disk in the first group of disks being unavailable, storing a data sub-block related to the first disk into a first parity portion of the parity portion such that the data block is stored in the first stripe, the first parity portion being located at a second disk in the second group of disks. The techniques further involve returning a response to the write request, the response comprising a first indication indicating a status of the disks in the disk array.

Method, device and computer program product for managing data

Techniques manage data of a Redundant Array of Independent Disks (RAID). Such techniques involve: obtaining a first parity of checksum pair, which is determined based on a first checksum when user data of data disks in the RAID are predetermined values; determining, based on current checksums of the data disks in the RAID, a second parity of checksum pair of the RAID, the first parity of checksum pair and the second parity of checksum pair respectively comprising a row parity of checksum and a diagonal parity of checksum; and determining, based on the first parity of checksum pair and the second parity of checksum pair, a third parity of checksum pair for updating parity data of parity disks of the RAID.

Managing a redundant array of independent disks (RAID) using row parity and diagonal parity

Techniques for storage management involve: determining expected usage time of a first storage disk in a set of storage disks, at least a part of the set of storage disks being configured to form at least one redundant array of independent disks (RAID); moving data in a first storage block, associated with a first RAID in the at least one RAID, in the first storage disk to a second storage block in a second storage disk in the set of storage disks based on a determination that the expected usage time is less than a predetermined threshold value; and replacing the first storage block with the second storage block, so that the second storage block is associated with the first RAID. Based on this manner, the stability of a storage system can be improved.

Method for storage management, device and computer program product

Growing community of inventors

Beijing, China

Jibing Dong