Western Digital Technologies, Inc.

Auspex Systems, Inc.

Other

Arkeia Software, Inc.

Tamir Ram

Kumar Gajjar

Paul Lester Popelka

John V Vincenet

Syang Edward Syu

Sara Abraham

Shawn Miller

Sean Rohr

Linh Kochan

Michael A Dolan

Kent Tu

Lawrence Hiroshi Kubo

Larry Kubo

William H Evans

Provided herein is technology relating to data deduplication and particularly, but not exclusively, to methods and systems for determining an efficiently optimal size of data blocks to use for backing up a data source. Also provided herein are systems for identifying duplicate data in data backup applications.

Optimizing data block size for deduplication

Systems and methods are disclosed for performing file backup and restore in a computing system. Certain embodiments provide a communication interface for communicating with a non-volatile memory and a controller configured to determine that a file stored in the non-volatile memory has been modified, identify a chunk of the file that has been modified, determine a new chunk associated with the modified chunk, the new chunk reflecting the modification, generate a separate chunk file including the new chunk and a filename, and storing the chunk file in the non-volatile memory using the communication interface.

Data deduplication using chunk files

A method of backing up a computing device comprises storing in the computing device, prior to any first backup of the computing device, a selected pre-populated Reference File that comprises one or more references to at least some of the data blocks stored in the computing device. A first backup may then be initiated. The first back may cause references to data blocks in the computing device that are unrepresented in the pre-populated Reference File to be added to the Reference File. The data blocks corresponding to the added references may then be sent to a backup server over a computer network.

Backup of baseline installation

A method may comprise reading a portion of a predetermined amount of data; identifying a first location, within the portion of the predetermined amount of data, of each instance of a data value; identifying second and subsequent locations, within the portion of the predetermined amount of data, of each instance of the data values of the read portion of the predetermined amount of data; determining separate instances of repeated sequences of values in the identified locations; and compressing at least one of the determined separate instances of repeated sequences of values. The compression may be carried out by replacing each repeated sequence of values with at least a reference to a previous instance of the repeated sequence and a length of the previous repeated sequence.

Faster file compression using sliding compression window and backward compound pointers

A method may comprise caching a portion of a pool of unique data blocks in a memory, the pool of unique data blocks comprising a plurality of unique blocks, at least some of the plurality of blocks in the pool of unique data blocks being referred to in at least one reference file. A list of blocks may be updated with any block in the cached portion of the pool of unique data blocks that is not referred to by at least one reference in the reference file(s). Different portions of the pool of unique data blocks may then continue to be cached and the list of blocks not referred to by at least one reference may be updated until the remaining portions of the pool of unique data blocks are cached. The blocks in the list of blocks may then be deleted from the pool of unique data blocks.

Negative pool management for deduplication

Provided herein are data management systems and methods for storing, cataloging, and protecting data on a computer using software and a portable data storage device. The technology can back up, manage, and protect data for any operating or file system by checking files for block-level or byte-level changes and storing only new data. By storing only new data and cataloging information within a comprehensive backup archive composed of these blocks, the size of each backup is minimized.

Method, system, and program for personal data management using content-based replication

Data management systems and methods that can catalog, store, and protect data from hard disk failure on a mobile or stationary computer, using a computer program and a portable data storage device are provided. The program uses a combination message-digest and check-function based algorithm that can back up, manage, and protect data independent of specific computer operating system or file system. The program can check files for block-level content changes from previously stored data blocks and catalogs and stores only new data blocks. By storing only new data blocks and cataloging information within a comprehensive, backup archive composed of these blocks, the size of each backup is reduced.

A bridge in a file server provides a direct link to data storage devices in satisfaction of data requests. The file server has one or more function-specific processors, including network processors (NPs) and file storage processors (FSPs), all operating in parallel and communicating over an interconnect bus. Each FSP is also connected to one or more disk controllers which in turn manage one or more data storage devices. To minimize local bus contention between data storage devices and network communications, separate internal buses are provided in the FSP, one internal bus connected to the interconnect bus for network communications and one internal bus connected to disk controllers for performing I/O operations on data storage devices. The bridge provides a path between the FSP's internal buses so that, for disk access requests, data from a particular data storage device may be sent by the disk controller via the bridge over the interconnect bus to the NP servicing the request with minimal involvement of the local FSP processor.

Growing community of inventors

Sunnyvale, CA, United States of America

Tamir Ram