Abstract: Techniques for performing de-duplication for data blocks in a computer storage environment. At least one chunking/hashing unit receives input data from a source and processes it to output data blocks and content addresses for them. In one aspect, the chunking/hashing unit outputs all blocks without checking to see whether any is a duplicate of a block previously stored on the storage environment. In another aspect, each data block is processed by one of a plurality of distributed object addressable storage (OAS) devices that each is selected to process data blocks having content addresses with a particular range. The OAS devices determine whether each received data block is a duplicate of another previously stored on the computer storage environment, and when it is not, stores the data block.

Abstract: Allocation process that allows erasure coded data to be stored on any of a plurality of disk drives, in a pool of drives, so that the allocation is not tied to a fixed group of drives. Still further, the encoded data can be generated by any of multiple different erasure coding algorithms, where again storage of the encoded data is not restricted to a single group of drives based on the erasure algorithm being utilized to encode the data. In another embodiment, the encoded data can be “stacked” (aligned) on select drives to reduce the number of head seeks required to access the data. As a result of these improvements, the system can dynamically determine which one of multiple erasure coding algorithms to utilize for a given incoming data block, without being tied to one particular algorithm and one particular group of storage devices as in the prior art.

Abstract: Techniques for performing de-duplication for data blocks in a computer storage environment. At least one chunking/hashing unit receives input data from a source and processes it to output data blocks and content addresses for them. In one aspect, the chunking/hashing unit outputs all blocks without checking to see whether any is a duplicate of a block previously stored on the storage environment. In another aspect, each data block is processed by one of a plurality of distributed object addressable storage (OAS) devices that each is selected to process data blocks having content addresses with a particular range. The OAS devices determine whether each received to data block is a duplicate of another previously stored on the computer storage environment, and when it is not, stores the data block.

Abstract: Allocation process that allows erasure coded data to be stored on any of a plurality of disk drives, in a pool of drives, so that the allocation is not tied to a fixed group of drives. Still further, the encoded data can be generated by any of multiple different erasure coding algorithms, where again storage of the encoded data is not restricted to a single group of drives based on the erasure algorithm being utilized to encode the data. In another embodiment, the encoded data can be “stacked” (aligned) on select drives to reduce the number of head seeks required to access the data. As a result of these improvements, the system can dynamically determine which one of multiple erasure coding algorithms to utilize for a given incoming data block, without being tied to one particular algorithm and one particular group of storage devices as in the prior art.

Abstract: Techniques for performing de-duplication for data blocks in a computer storage environment. At least one chunking/hashing unit receives input data from a source and processes it to output data blocks and content addresses for them. In one aspect, the chunking/hashing unit outputs all blocks without checking to see whether any is a duplicate of a block previously stored on the storage environment. In another aspect, each data block is processed by one of a plurality of distributed object addressable storage (OAS) devices that each is selected to process data blocks having content addresses with a particular range. The OAS devices determine whether each received data block is a duplicate of another previously stored on the computer storage environment, and when it is not, stores the data block.

Abstract: Described are techniques for performing a restoration operation of data to a device of a system. Using a driver, the boot blocks used in connection with booting said system a first time are determined as said boot blocks are accessed during said booting. A first portion of data is restored to the device in accordance with said boot blocks used in connection with booting said system said first time. The system is booted a second time using said first portion of data. Remaining portions of data are restored to said device after booting said system the second time.

Abstract: Described are techniques for processing a request to store data. The request to store data in accordance with a single instance storage technique is received. A schedule for storing the data in accordance with information included in the request is determined. Data for processing is requested in accordance with the single instance storage technique in accordance with the schedule.

Abstract: Described are techniques for performing restoration processing for a data segment. A list of tokens is received. The list represents a first data state of said data segment. Each of the tokens correspond to a data portion of said data segment. Data portions of the data segment are scanned. A token is determined for each data portion. The token represents the data currently stored in said data segment at said each data portion. For each data portion of said data segment, it is determined whether a first token from said list associated with said each data portion is different from a second token associated with said each data portion. The second token is determined as part of said scanning and corresponds to data currently stored at said each data portion. Each data portion of the data segment determined to have a first token that is different from a second token representing data currently stored at said each data portion is restored.