Druva Inc.

Druva Technologies Pte. Ltd.

Marvellworld Trade Ltd.

Toshiba Corporation

Veritas Operating Corporation

Ascava, Inc.

Shekhar S Deshkar

Milind Vithal Borate

Anand Apte

Abhijeet Prakash Gole

Arvind Pruthi

Jaspreet Singh

Nikhil Singhal

Premkumar Mahadev Nikam

Craig Harmer

Somesh Jain

Harshvardhan Sharangpani

Sandeep Karmarkar

Ram Kishore Johri

Ravideep Singhvi

Faisal Puthuparackat

An amount of memory needed to hold prime data elements during reconstitution may be determined by examining the creation and usage of prime data elements and their spatial and temporal characteristics during data distillation.

Exploiting locality of prime data for efficient retrieval of data that has been losslessly reduced using a prime data sieve

A system, method, and non-transitory computer-readable medium provide backup and archive services for computing devices. Typically, multiple backup snapshots are archived together in each archive cycle. A catalogue for the current archive is efficiently created by starting with a copy of the previous archive catalogue and updating it based on metadata associated with the backup snapshots.

Unified time-indexed catalogue for multiple archived snapshots

When a backup client sends a request to back up a file to a backup server, the file and an index (e.g., checksum, hash, encryption, etc.) of the file are stored on the backup server in an efficient deduplication storage. If a backup client sends a request to back up a modified version of a file already stored on a backup server, the modified portion of the file is stored. In addition, an index of the modified portion is generated and stored along with the modified portions on the backup server. The indices can be used to reconstruct the file or modified version of the file when retrieved. The efficient deduplication storage method ensures that multiple copies of files or portions of files do not exist on the servers.

Storage and retrieval of file-level changes on deduplication backup server

Data from computing devices is backed-up regularly, storing a snapshot of the data and corresponding metadata in a data store. The backup data are stored for a relatively short period of time before being archived to long-term storage. For snapshots with files with identical data that are not archived together, archive storage space and computing resources may be conserved by not storing duplicates of the data. When the data is added to the archive storage, the archive storage location is added to backup reference entries for other files with identical data. When all files referencing an archive storage location are expired from the backup data store, an archive retention period is initiated, and an entry is added to a time-based archive expiration database indicating the storage location and an expiration time for the archived data. At the expiration time, the archived data is designated for deletion from the archive.

Time-based data retirement for globally de-duplicated archival storage

A system and a method are disclosed for pre-seeding data to backup servers and determining servers for additional backups. Backup data is received from a client device through a first backup request and sent to a primary server for storage. Additional backup data from a second backup request is received. After the initial backup data is stored on the primary server and pre-seeded by the primary server on a secondary server, a status of backup servers associated with the client device is received. The backup servers include the primary server and can include the secondary server. Responsive to the status indicating availability of a server in the backup servers, a recipient server is identified from the backup servers and the additional backup data is sent to the identified recipient server.

Pre-population of data for replication of data backups

Methods, systems, and apparatus, including computer programs encoded on a computer storage medium, can perform data caching. In some implementations, a method and system include receiving information that includes a logical address, allocating a physical page in a non-volatile memory structure, mapping the logical address to a physical address of the physical page, and writing, based on the physical address, data to the non-volatile memory structure to cache information associated with the logical address. The logical address can include an identifier of a data storage device and a logical page number.

Data caching in non-volatile memory

A distributed, cloud-based storage system provides a reliable, deduplicated, scalable and high performance backup service to heterogeneous clients that connect to it via a communications network. The distributed cloud-based storage system guarantees consistent and reliable data storage while using structured storage that lacks ACID compliance. Consistency and reliability are guaranteed using a system that includes: 1) back references from shared objects to referring objects, 2) safe orders of operation for object deletion and creation, 3) and simultaneous access to shared resources through sub-resources.

Distributed scalable deduplicated data backup system

A deduplicated data storage system provides high performance storage to heterogeneous clients that connect to it via a communications network. The deduplicated data storage system provides fast access to deduplication data by caching the most frequently accessed deduplication data in a hyperindex. Updates to the non-cached deduplication data are serialized by use of a store queue and hold queue.

Efficient deduplicated data storage with tiered indexing

Systems and techniques relating to network file systems are described. A described technique includes associating with a process that exports a network file system, where the process manages the network file system, associating with one or more peers that use the network file system, where the one or more peers cache data associated with the network file system on one or more non-volatile memory structures, receiving a file system request to read or write at least a portion of a file that is associated with the network file system, and processing the file system request by selectively communicating with the one or more peers to retrieve cached data associated with the file when the file system request indicates a read or inform the one or more peers of a write to the file when the file system request indicates a write.

Peer-to-peer based caching for network file system

Apparatuses, methods, and other embodiments associated with distributed metadata caching are described. According to one embodiment, a method includes intercepting a metadata request intended for an NFS server and communicating with a member of the set of peers to satisfy the metadata request from a distributed metadata cache maintained by the set of peers. The metadata request will have originated from a member of a set of peers participating in peer-to-peer distributed metadata caching.

Distributed metadata cache

A method may involve: a node included in a cluster looking up a file in a metadata name cache; in response to a miss for the file in the metadata name cache, the node creating a metadata name cache entry for the file in the metadata name cache, where the metadata name cache entry includes a copy of a cookie associated with metadata allocated to the file; in response to a lock on the metadata changing state for the node, the node modifying the cookie associated with the metadata, where the lock changes state for the node in response to a request to a global lock manager for the lock on the metadata; and comparing the copy of the cookie stored in the metadata name cache entry to a current value of the cookie associated with the metadata to determine if the metadata name cache entry is valid.

Growing community of inventors

Pune, India

Shekhar S Deshkar