Emc Corporation

Hytrust, Inc.

Datagravity, Inc.

Kumar Kanteti

Paula Long

Gregory James McHale

Philippe Armangau

William C Davenport

Istvan Gonczi

Bryan Keith Panner

Misha Zelikov

Janice Ann Lacy

Walter Forrester

Sitaram D Pawar

Jun Guo

Yingchao Zhou

Jia Zhai

Dmitry Bochkov

Andrew Ferris

Kannan Sasi

Eric K Mccall

Gregory James Mchale

A single system merges primary data storage, data protection, and intelligence. Intelligence is provided through in-line data analytics, and data intelligence and analytics are gathered on protected data and prior analytics, and stored in discovery points, all without impacting performance of primary storage. Real-time analysis is done in-line with the HA processing, enabling a variety of data analytics that are then used as part of a live restore operation. Data content can be live restored at an object or block level. Data recovery begins with metadata restoration, followed by near-instantaneous access to 'hot' regions of data being restored, allowing site operation to continue or resume while a restore is ongoing.

Live restore for a data intelligent storage system

A unified system provides primary storage and in-line analytics-based data protection. Additional data intelligence and analytics gathered on protected data and prior analytics are stored in discovery points. The disclosed system implements multi-threaded log writes across primary and restore nodes with write gathering across file systems; nested directories such as may be used for storing virtual machine files, where every subdirectory has an associated file system for snapshot purposes; and cloning objects on demand with background metadata and data migration.

Multi-threaded transaction log for primary and restore/intelligence

A method and a system to dynamically determine how much of the total IO bandwidth may be used for flushing dirty metadata from the cache to the main memory without increasing the host memory access latency time, includes increasing the number of IO processes by adding a number of IO processes at short intervals and measuring host latency. If the host latency is acceptable, then increasing the number of IO processes again by the same number, and repeating until the host latency period reaches a limit. When the limit has been reached, reducing the number of IO processes by a multiplicative factor, and repeating the additive process from the reduced number of IO processes. The number of IO processes used for flushing dirty metadata may resemble a series of saw teeth, rising gradually and declining rapidly in response to the number of host IO processes needed.

Metadata flushing using additive increase and multiplicitive decrease to determine a number of IO processes used

Flushing cache memory of dirty metadata in a plurality of file systems without either letting the caches reach their maximum capacity, or using so much of the total system IO process bandwidth that host system IO process requests are unreasonably delayed, may include determining the length of an interval between sync operations for each individual one of the plurality of file system, and how to divide a system wide maximum sync process IO operation bandwidth fairly between various ones of the plurality of file systems. A computer dynamically measures overall system operation rates, and calculates an available portion of a current calculated sync operation bandwidth for each file system. The computer also measures file system operation rates and determines how long a time period should be between sync operations in each file system.

Managing metadata synchronization for reducing host system latency in a storage system

For automatically committing a file of a file system to a WORM committed state when the file has not been modified for a certain period of time, a file server maintains a list of file identifiers and periodically scans the list to check whether or not the certain period of time has expired for each file on the list. If so, the file is committed to the WORM state. The file server also enforces an in-place lock in response to a client request to modify or delete a file when the certain period of time is found to have expired for the file. A minimum modify time and a maximum modified time are included in each entry of the list of file identifiers in order to skip entries and to reclaim memory of entries during the periodic scan.

Automatically committing files to be write-once-read-many in a file system

Growing community of inventors

South Grafton, MA, United States of America

Kumar Kanteti