Emc Corporation

Emc IP Holding Company LLC

Vmware, Inc.

Intel Corporation

Hon Hai Precision Industry Co., Ltd.

Ambit Microsystems (shanghai) Ltd.

Siemens Aktiengesellschaft

Ye Zhang

Jean-Pierre Bono

William C Davenport

Wenguang Wang

Miles Aram De Forest

Yining Si

Michal Marko

Philippe Armangau

Walter Forrester

Hong Li

Xiangping Chen

Richard Paul Spillane

Yogesh B Wakchaure

Chao Zheng

Philip C Love

Peter W Madany

Mansi Shah

Paul LeMahieu

Srinivasa Rao Vempati

Tao Xie

Christian Dickmann

Andrew S Becher

Aliasgar S Madraswala

Xin Guo

Anand S Ramalingam

Asit Desai

Junlong Gao

Rohit K Chawla

Neal R Mielke

David J Pelster

Shirish Dnyaneshware Bahirat

Varun A Shah

Yingchao Zhou

Xiang Yu

Sagar Upadhyay

David B Carlton

Xianlong Liu

Zhaohui Guo

Qin Tao

Yaming Kuang

Jia Chen

Qi Mao

Alexander Daniel

Alexei Karaban

Zongliang Li

Sriram Patil

Fengcheng Lu

Wangping He

Pu Wang

Weiye Cheng

Yung-Chieh Stephen Hu

Yisui Hu

Lixie Liu

Neelesh Vemula

Kamakshi Viswanadha

Mark Anthony Golez

Peng Dai

Changyong Yu

James O Owens

Eric Hoffman

Robert E Frickey

Kent J Costa

Alex Zhongbing Yang

Ruijing Guo

Gourav Kumar Sakargayan

Cole Uhlman

Hansi Wu

HaiFeng Li

Kenny Zhou

Xiao-Feng Liu

Sagar S Sidhpura

Xiaoou Zhao

Mohammad Nasim Imtiaz Khan

Tobias Keimel

Paul Hao Pan

Chuangxian Wei

Andreas Mundt

You Hua Peng

Yi Feng Han

Zhang Yao Bao

An embodiment of an electronic apparatus may include one or more substrates, and a controller coupled to the one or more substrates, the controller including circuitry to control access to NAND-based storage media that includes a plurality of NAND devices, maintain respective read disturb (RD) counters for each of two or more tracked units at respective granularities, maintain respective global RD counters for each of the two or more tracked units and, in response to a read request, increment one or more global RD counters that correspond to the read request, determine if a global RD counter for a tracked unit matches a random number associated with the tracked unit and, if so determined, increment a RD counter for the tracked unit that corresponds to the read request and generate a new random number for the tracked unit. Other embodiments are disclosed and claimed.

Read disturb tracking based on statistical probability

The location of resources for file services are located within the same site, thereby eliminating or reducing performance issues caused by cross-site accesses in a stretched cluster environment. A file server placement algorithm initially places file servers at a site based at least in part on host workload and affinity settings, and can perform failover to move the file servers to a different location (e.g., to a different host on the same site or to another site) in the event of a failure of the host where the file servers were initially placed. File servers may be co-located with clients at a location based on client latencies and site workload. Failover support is also provided in the event that the sites in the stretched cluster have different subnet addresses.

Site locality support for file services in a stretched cluster environment

A method for dynamic storage object configuration in a datacenter is provided. Embodiments include determining a number of fault domains in a storage cluster that have sufficient storage capacity for creating a storage object. Embodiments include applying a dynamic fault tolerance policy to the number of fault domains that have sufficient capacity for creating the storage object in order to determine a number of host failures to tolerate for the storage object, the dynamic fault tolerance policy specifying a manner of determining, for any respective storage object, a respective number of host failures to tolerate for storing the respective storage object in a respective storage cluster based on at least a respective number of fault domains of the respective storage cluster. Embodiments include implementing the storage object on the storage cluster based on the number of host failures to tolerate for the storage object.

Dynamic object policy reconfiguration mechanism for object storage system

Example methods are provided for unbalanced storage resource usage configuration for a distributed storage system in a virtualized computing environment. An example method may include obtaining usage data associated with multiple storage resources forming the distributed storage system. The multiple storage resources are supported by the multiple hosts. Based on the usage data, the method may further include determining a higher usage set and a lower usage set of one or more storage resources from the multiple storage resources and configuring the multiple hosts to use the multiple storage resources in an unbalanced manner by using the higher usage set of one or more storage resources at a higher usage level compared to the lower usage set of one or more storage resources.

Unbalanced storage resource usage configuration for distributed storage systems

System and method for automatic remediation for a distributed file system uses a file system (FS) remediation module running in a cluster management server and FS remediation agents running in a cluster of host computers. The FS remediation module monitors the cluster of host computers for related events. When a first file system service (FSS)-impacting event is detected, a cluster-level remediation action is executed at the cluster management server by the FS remediation module in response to the detected first FSS-impacting event. When a second FSS-impacting event is detected, a host-level remediation action is executed at one or more of the host computers in the cluster by the FS remediation agents in response to the detected second FSS-impacting event.

File service auto-remediation in storage systems

System and method for writing updated versions of a configuration data file for a distributed file system in a storage system uses a directory renaming operation to write a new updated version of the configuration data file using the latest version of the configuration data file and a target directory. After the latest version of the configuration data file is modified by a particular host computer in the storage system, the modified configuration data file is written to a temporary file. The directory naming operation is then initiated on the temporary file to change the directory for the temporary file to the target directory. If the directory renaming operation has failed, a retry is performed by the particular host computer to write the new updated version of the configuration data file using a new latest version and a new target directory.

Lockless method for writing updated versions of a configuration data file for a distributed file system using directory renaming

A data storage system operates a file system as a thinly provisioned file system having a host-visible virtual space and a smaller allocated space of underlying physical storage from a pool. The file system applies formatting to the allocated space and utilizes formatted allocated space for storing host files. The file system receives a file I/O request that requires increasing the allocated space of the file system, and in response (1) obtains an extent of physical storage from the pool and adds it to the file system as added allocated space, and (2) formats an initial portion of the added allocated space and satisfies the file I/O request using the formatted initial portion. Over a subsequent period the file system incrementally formats additional portions of the added allocated space and satisfies subsequent file I/O requests from the added portions.

Dense file reservation in thinly provisioned file system

A data structure is maintained for performing a program operation that is allowed to be suspended to perform reads in a NAND device, where the data structure indicates a plurality of tiers, where each tier of the plurality of tiers has a number of allowed suspends of the program operation while executing in the tier, and where a sum of the number of allowed suspends for all tiers of the plurality of tiers equals a maximum allowed number of suspends of the program operation. In response to performing a resume of the program operation, after performing a read following a suspend of the program operation, a determination is made of a tier of the plurality of tiers for the program operation and a subsequent suspend of the program operation is performed only after a measure of progress of the program operation has been exceeded in the determined tier.

Method, system, and apparatus for multi-tiered progressive memory program operation suspend and resume

Example methods are provided for unbalanced storage resource usage configuration for a distributed storage system in a virtualized computing environment. The method may comprise: obtaining usage data associated with multiple storage resources forming the distributed storage system; and based on the usage data, determining a higher usage set and a lower usage set from the multiple storage resources. The method also comprise configuring the multiple hosts to use the multiple storage resources in an unbalanced manner by using the higher usage set at a higher usage level compared to the lower usage set.

A method is used in managing recovery of file systems. A determination is made during recovery of a file system as to whether information required for recovering the file system is missing. Based on the determination, storage for a slice is provisioned. The slice is updated with the information required for recovering the file system. Recovery of the file system is performed.

Managing recovery of file systems

Provided are a method, apparatus, and a system for measuring latency of a storage device. The storage device measures one or more latencies of one or more input/output (I/O) operations received from a host. The storage device transmits information on the one or more latencies to the host.

Measurement and reporting of the latency of input and output operations by a solid state drive to a host

Examples are generally directed towards a file server having a unified file system associated with a unified slice map volume. In one example, the unified file system stores file system metadata and sparse volume metadata within the unified slice map volume. The unified file system performs a unified set of functions using the file system metadata and sparse volume metadata in the unified slice map volume.

Unified slice map volume

A method is used in managing data relocation in storage systems. Metadata of a slice of a storage tier in a data storage system is evaluated for migrating the slice from the storage tier to another storage tier. The data storage system includes a first storage tier and a second storage tier configured such that performance characteristics associated with the first storage tier is superior to the second storage tier. Based on the evaluation, relocation of the slice of the storage tier is effected. The metadata of the slice indicates whether the slice includes user data.

Managing relocation of slices in storage systems

A method is used in managing data relocation in storage systems. A request is received to write to a slice of storage tier in a data storage system where the slice is being relocated. The relocation of the slice includes copying data of the slice to another slice in the data storage system. Location within the slice at which the request to write to the slice has been received is determined. Based on the determination, relocation of the slice of the storage tier is effected.

Managing data relocation in storage systems

A method, computer program product, and computing system for defining an initial root slice for a storage system. A first data slice is defined for the storage system. The location of the first data slice of the storage system is identified within the initial root slice. A request for a supplement data slice within the storage system is received. A determination is made as to if the supplement data slice can be added within the storage system without defining a supplemental root slice for a storage system.

System and method for storage management using root and data slices

Growing community of inventors

Shanghai, China

Ye Zhang