Abstract: Techniques to send and receive access commands are provided. The access commands may include an expected media position. The expected media position may be compared to an actual media position.

Abstract: Data processing apparatus comprising: a chunk store configured for containing specimen data chunks, a discrete manifest store, configured for containing at least one manifest that represents at least a part of a data set and that comprises at least one reference to at least one of said specimen data chunks, the processing apparatus being operable to process input data into input data chunks and to identify at least one manifest in the manifest store that includes at least one said reference to a said specimen data chunk corresponding to at least one of said input data chunks.

Abstract: Examples disclose a computing device comprising a deduplication module to analyze a signature associated with a chunk of data to identify a corresponding signature in an index of signatures on a hard drive. The corresponding signature indicates the chunk of data corresponds to a stored chunk of data within a removable media. Further, the deduplication module determines whether the chunk of data is redundant based on the identification of the corresponding signature and replaces the chunk of data with a reference to a location of the stored chunk of data. Additionally, the examples also disclose the removable media to store the reference to the chunk of data.

Abstract: Techniques to send and receive access commands are provided. The access commands may include an expected media position. The expected media position may be compared to an actual media position.

Abstract: Data processing apparatus comprising: a chunk store containing specimen data chunks, a manifest store containing a plurality of manifests, each of which represents at least a part of a data set and each of which comprises at least one reference to at least one of said specimen data chunks, a sparse chunk index containing information on only some specimen data chunks, the processor being operable to: process input data into input data chunks; identify manifests having at least one reference to one of said specimen data chunks that corresponds to one of said input data chunks and on which there is information contained in the sparse chunk index; and prioritize the identified manifests for subsequent operation.

Abstract: Data processing apparatus comprising: a chunk store partitioned into a plurality of chunk sections, at least one section storing specimen data chunks, the processing apparatus being operable to: process input data into one or more input data chunks; identify a chunk section already containing a specimen data chunk corresponding to at least one input data chunk; and store the at least one input data chunk in another chunk section as a specimen data chunk if the identified chunk section has a predetermined characteristic.

Abstract: Disclosed is a method of restoring a client device following failure of the client device, the client being connectable to a network comprising a server device. The method comprises saving to the server device a configuration state of the client device, the saved configuration state comprising client network interface configuration information, and a file of the client device. The method further comprises, following failure of the client computer, recording on a medium bootable on the client device program instructions for configuring the client device according to the saved configuration state, booting the client device from the bootable medium, configuring a network interface of the client device in accordance with the program instructions and the saved configuration state and restoring the file to the client device by copying over the network.

Abstract: Data processing apparatus comprising: a chunk store partitioned into a plurality of chunk sections, at least one section storing specimen data chunks, the processing apparatus being operable to: process input data into one or more input data chunks; identify a chunk section already containing a specimen data chunk corresponding to at least one input data chunk; and store the at least one input data chunk in another chunk section as a specimen data chunk if the identified chunk section has a predetermined characteristic.

Abstract: Data processing apparatus comprising: a chunk store containing specimen data chunks, a manifest store containing a plurality of manifests, each of which represents at least a part of a data set and each of which comprises at least one reference to at least one of said specimen data chunks, a sparse chunk index containing information on only some specimen data chunks, the processor being operable to: process input data into input data chunks; identify manifests having at least one reference to one of said specimen data chunks that corresponds to one of said input data chunks and on which there is information contained in the sparse chunk index; and prioritize the identified manifests for subsequent operation.

Abstract: There is disclosed a method and apparatus for mapping between logical and physical addresses in a solid state data storage device, particularly but not exclusively a magnetic random access solid state data storage device, in which a list of mappings between ranges of logical addresses and ranges of physical addresses are stored in a data table, the mappings being operated on to look up a physical address from a logical address and vice versa, and being operated on by a data processor, to amend the data mappings by introduction of new ranges of logical and physical addresses, upon ranges of individual physical memory elements becoming defective.

Abstract: There is disclosed a method and apparatus for mapping between logical and physical addresses in a solid state data storage device, particularly but not exclusively a magnetic random access solid state data storage device, in which a list of mappings between ranges of logical addresses and ranges of physical addresses are stored in a data table, the mappings being operated on to look up a physical address from a logical address and vice versa, and being operated on by a data processor, to amend the data mappings by introduction of new ranges of logical and physical addresses, upon ranges of individual physical memory elements becoming defective.

Abstract: There is disclosed a method and apparatus for mapping between logical and physical addresses in a solid state data storage device, particularly but not exclusively a magnetic random access solid state data storage device, in which a list of mappings between ranges of logical addresses and ranges of physical addresses are stored in a data table, the mappings being operated on to look up a physical address from a logical address and vice versa, and being operated on by a data processor, to amend the data mappings by introduction of new ranges of logical and physical addresses, upon ranges of individual physical memory elements becoming defective.

Abstract: A data storage device comprises at least one array of memory elements arranged in a plurality of rows and columns; coding means for coding an input data into a form having a balanced proportion of ‘1’s and ‘0’s, said coding means comprising means for applying an output of a pseudo random bit sequence generator to said incoming data, wherein the coded data is stored in the array of memory elements such that the ‘1’s and ‘0’s are spatially distributed relatively evenly across the plurality of memory elements; and decoding means for decoding the coded data read from the plurality of memory elements, into the original data.

Abstract: A data storage device comprises at least one array of memory elements arranged in a plurality of rows and columns; coding means for coding an input data into a form having a balanced proportion of ‘1’s and ‘0’s, said coding means comprising means for applying an output of a pseudo random bit sequence generator to said incoming data, wherein the coded data is stored in the array of memory elements such that the ‘1’s and ‘0’s are spatially distributed relatively evenly across the plurality of memory elements; and decoding means for decoding the coded data read from the plurality of memory elements, into the original data.

Abstract: There is disclosed a method and apparatus for mapping between logical and physical addresses in a solid state data storage device, particularly but not exclusively a magnetic random access solid state data storage device, in which a list of mappings between ranges of logical addresses and ranges of physical addresses are stored in a data table, the mappings being operated on to look up a physical address from a logical address and vice versa, and being operated on by a data processor, to amend the data mappings by introduction of new ranges of logical and physical addresses, upon ranges of individual physical memory elements becoming defective.