Netapp, Inc.

Network Appliance, Inc.

International Business Machines Corporation

Google Inc.

Atul Goel

Kyle Diggs Sterling

Peter Frank Corbett

James Leong

Stephen H Strange

Douglas W Coatney

Todd Mills

Rajesh Sundaram

Robert Michael Rees

Yan Li

Ravikanth Dronamraju

Randal Chilton Burns

Ratnesh Gupta

Jagadish Vasudeva

Shivali Gupta

Tomislav Grcanac

Loellyn Jane Cassell

Suhas Urkude

Ling Zheng

Susan M Coatney

Maurilio Cometto

James A Taylor

Wayne Curtis Hineman

Manoj Sharma

Paul Christopher Eastham

Cheng Ping Tan

Sunitha Sunil Sankar

Richard Christopher Fore

Con Phan

Darrell D E Long

Prahlad Purohit

Diganta Paladhi

Bharath Kumar K M

Jaldhi Dave

Gururaj Mj

The present disclosure describes an architecture and design of Unauthorized-Blocking-Role (UAB). UAB is a mechanism which prevents higher privileged users of cloud-hosted software from performing unauthorized activities on protected objects, such as management objects. UAB works by periodically monitoring the permissions of customer users on key management objects in an object hierarchy in management software. If a customer user is detected to have privileges higher than the user should have on those objects, UAB applies restrictive role-based access controls (RBACs) on the user. Similarly, UAB also monitors protected principals and protected roles to ensure that their privileges are not modified by a customer user.

System and method for safely supporting customer security policies in a third-party-as-a-service solution

A method, non-transitory computer readable medium, and device that assists with reducing memory fragmentation in solid state devices includes identifying an allocation area within an address range to write data from a cache. Next, the identified allocation area is determined for including previously stored data. The previously stored data is read from the identified allocation area when it is determined that the identified allocation area comprises previously stored data. Next, both the write data from the cache and the read previously stored data are written back into the identified allocation area sequentially through the address range.

Methods for minimizing fragmentation in SSD within a storage system and devices thereof

A technique efficiently determines accurate storage space savings reported to a host coupled to a reference-counted storage system that employs de-duplication and compression, wherein the storage space savings relate to snapshots and/or clones supported by the storage system. The snapshot/clone may be represented as an independent volume, and embodied as a respective read-only copy (snapshot) or read-write copy (clone) of a parent volume. Metadata is illustratively organized as one or more multi-level dense trees, wherein each level of each dense tree includes volume metadata entries for storing the metadata. The metadata is illustratively embodied as mappings from LBAs of a LUN to extent keys. Space adjustment counters, such as clone space adjustment (CSA) and diverged space adjustment (DSA) counters, may be employed when determining the storage space savings. The CSA counter is equal to the sum of mapped storage space across all levels of a dense tree. The DSA counter for the clone and for the snapshot equals the total mapped storage space in the level. The storage space savings may be determined by computing a value equal to the addition of the CSA counter to the total amount of data and metadata written to the LUN minus the DSA counters and, thereafter, dividing the value by the total amount of de-duplicated and compressed data for the LUN that is physically stored.

Space savings reporting for storage system supporting snapshot and clones

The disclosed embodiments relate to systems and methods for coordinating management of a shared disk storage between nodes. Particularly, a messaging protocol may be used to communicate notifications regarding each node's perception of the shared storage's state. The nodes may use the messaging protocol to achieve consensus when recovering from a storage device failure. Some embodiments provide for recovery when localized failures, such as failures at an adapter on a node, occur.

Storage failure processing in a shared storage architecture

Methods and systems for a storage environment are provided. For example, one method includes receiving a request from a storage server at an offload engine for reconstructing data lost due to a failed storage device of a parity group having a plurality of storage devices; retrieving data and parity by the offload engine from the parity group storage devices that are operational; determining by the offload engine XOR of the retrieved data and parity; presenting XOR of data and parity by the offload engine to the storage server with context information associated with the retrieved data; and reconstructing lost data by the storage server using the XOR of data and parity and the context information provided by the offload engine.

Methods and systems for offloading RAID parity reconstruction

Presented herein are methods, non-transitory computer readable media, and devices for maximizing parallelization in a parity de-clustered and sliced disk RAID architecture implemented on at least one hard disk drive by creating at least one allocation group, each created allocation group comprising at least one parity group within a sliced disk group, selecting one of said at least one allocation group, and performing at least one of write or read concurrently on all parity groups within the selected allocation group.

Efficient method of combining parity groups for uniform load distribution and maximizing parallelization in parity de-clustered and sliced disk raid architecture

A shared storage architecture is described for coordinating management of a shared storage between nodes of a network storage system. In various embodiments, the shared storage is partitioned into and different partitions are assigned to different nodes of the network storage system. The shared storage architecture provides techniques for asserting reservations on the shared storage, managing state of the shared storage, and implementing various configurations of the network storage system using the shared storage.

Shared storage architecture

The present invention provides a system and method for virtual block numbers (VBNs) to disk block number (DBN) mapping that may be utilized for both single and/or multiple parity based redundancy systems. Following parity redistribution, new VBNs are assigned to disk blocks in the newly added disk and disk blocks previously occupied by parity may be moved to the new disk.

System and method for volume block number to disk block number mapping

Some aspects of the disclosure relate to a data storage system that includes multiple memory device storage devices. If a memory device of a memory device array fails within a first data storage device, some portions of the lost or corrupted data from the failed memory device are recovered by reading them from a second data storage device. Other portions of the lost or corrupted data from the failed memory device are recovered from parity information in the first data storage device.

Data recovery for failed memory device of memory device array

A parity pattern defines a repeated distribution of parity blocks within a distributed parity disk array ('DPDA'). The parity pattern identifies on which disks the parity block or blocks for a stripe are located. When a new disk is added to the DPDA, the parity pattern is modified so that the distribution of parity blocks within the parity pattern is even. Parity blocks within the DPDA are then redistributed to conform with the modified parity pattern.

Redistributing parity in a storage system

A storage server resizes an array of mass storage devices and distributes data blocks stored in the array of mass storage devices evenly in a declustered organization across the resized array of mass storage devices. Resizing the array of mass storage devices may include adding a new mass storage device to the array or removing a mass storage device from the array. During resizing a data block is moved from one mass storage device to another mass storage device to minimize the imbalance of parity groups shared by the new mass storage devices in the array, as well as minimize the number of data blocks to be moved to uniformly balance the load across the new mass storage device.

Dynamically resizing a parity declustered group

A data access request is received specifying a data block stored in a stripe of a parity group that includes a plurality of data storage devices to store data blocks and a parity storage device to store parity information for the data. The stripe includes a data block from each of the plurality of data storage devices and the stripe includes a parity block from the parity storage device. An error is detected in the data block specified by the data access request. The error is identified as a lost write error for the data block or a lost write error for the parity block. Identifying the error includes comparing a first storage device signature stored in a metadata field associated with the data block to a second storage device signature stored in a label block identifying a data storage device where the data block is stored.

Identifying lost write errors in a raid array

Growing community of inventors

San Jose, CA, United States of America

Atul Goel