Netapp, Inc.

Venkata Vijay Chaitanya Challapalli

Bharadwaj Vellore Ramesh

Praveen Killamsetti

Sudhanshu Gupta

Rohini Raghuwanshi

Dnyaneshwar Nagorao Pawar

Alok Sharma

Santhosh Selvaraj

Kumaran Nagappan

Ravi Lingappa Shamanna

It is determined that a first data unit is to be written to a storage device and that the first data unit is associated with a first attribute. In response to determining that the first data unit is associated with the first attribute, a first identifier is selected from a first identifier space and the first identifier is associated with the first data unit. It is determined that a second data unit is to be written to the storage device and that the second data unit is associated with the second attribute. In response to determining that the second data unit is associated with the second attribute, a second identifier is selected from a second identifier space and the second identifier is associated with the second data unit.

Mapping logical identifiers using multiple identifier spaces

Methods, non-transitory computer readable media, and computing devices that facilitate copy-free data migrations across filesystems. In a first step with this technology, a first set of filesystem metadata associated with a first filesystem is received. At least a portion of the first set of filesystem metadata is retrieved from a first data structure associated with the first filesystem. The first set of filesystem metadata includes a first identifier and a physical location associated with user data. A second identifier, associated with a second filesystem having a different addressing scheme than the first filesystem, is generated from at least the first identifier. A second set of filesystem metadata including the second identifier and the physical location is stored such that at least the second identifier is stored in a second data structure associated with the second filesystem.

Methods for copy-free data migration across filesystems and devices thereof

An efficient and highly scalable method of sorting an input file in a processing system by using only a limited amount (i.e., a portion) of memory in the processing system, where that amount of memory is substantially smaller than the input file, is disclosed. The input file can be, for example, a fingerprint database for use in deduplication, and the processing system can be, for example, a network storage server. The merge phase is broken down into sub-phases, where each sub-phase takes a predetermined number of subsets of a fingerprint file to merge and writes them back as a sorted, merged group. The number of threads used to process these groups can depend on the number of central processing units (CPUs) present in the system and can be dynamically tuned to achieve desired level of performance.

Sorting a data set by using a limited amount of memory in a processing system

A method performed in a network storage system, the method including receiving a plurality of data blocks at a secondary storage subsystem from a primary storage subsystem, generating a first log that includes a first plurality of entries, one entry for each of the data blocks, in which each entry of the first plurality of entries includes a name for a respective data block and a fingerprint of the respective data block, receiving metadata at the secondary storage subsystem from the primary storage subsystem, the metadata describing relationships between the plurality of blocks and a plurality of files, generating a second log that includes a second plurality of entries, and merging the first log with the second log to generate a change log.

Growing community of inventors

San Jose, CA, United States of America

Venkata Vijay Chaitanya Challapalli