Incomputer data storage,data striping is the technique of segmenting logically sequential data, such as a file, so that consecutive segments are stored on different physical storage devices.
Striping is useful when a processing device requests data more quickly than a single storage device can provide it. By spreading segments across multiple devices which can be accessed concurrently, total data throughput is increased. It is also a useful method for balancing I/O load across an array of disks. Striping is used acrossdisk drives inredundant array of independent disks (RAID) storage,network interface controllers, disk arrays, different computers inclustered file systems andgrid-oriented storage, andRAM in some systems.
One method of striping is done by interleaving sequential segments on storage devices in around-robin fashion from the beginning of the data sequence. This works well for streaming data, but subsequent random accesses will require knowledge of which device contains the data. If the data is stored such that the physical address of each data segment is assigned a one-to-one mapping to a particular device, the device to access each segment requested can be calculated from the address without knowing the offset of the data within the full sequence.
Other methods might be employed in which sequential segments are not stored on sequential devices. Such non-sequential interleaving can have benefits in someerror correction schemes.
Advantages of striping include performance and throughput. Sequential time interleaving of data accesses allows the lesser data access throughput of each storage devices to be cumulatively multiplied by the number of storage devices employed. Increased throughput allows the data processing device to continue its work without interruption, and thereby finish its procedures more quickly. This is manifested in improved performance of the data processing.
Because different segments of data are kept on different storage devices, the failure of one device causes the corruption of the full data sequence. In effect, thefailure rate of the array of storage devices is equal to the sum of the failure rate of each storage device. This disadvantage of striping can be overcome by the storage of redundant information, such asparity, for the purpose of error correction. In such a system, the disadvantage is overcome at the cost of requiring extra storage.
The segments of sequential data written to or read from a disk before the operation continues on the next disk are usually calledchunks,strides orstripe units, while their logical groups forming single striped operations are calledstrips orstripes. The amount of data in one chunk (stripe unit), often denominated in bytes, is variously referred to as thechunk size,stride size,stripe size,stripe depth orstripe length. The number of data disks in the array is sometimes called thestripe width, but it may also refer to the amount of data within a stripe.[1][2][3][4]
The amount of data in one stripe multiplied by the number of data disks in the array (i.e.,stripe depth timesstripe width, which in the geometrical analogy would yield an area) is sometimes called thestripe size orstripe width.[5]Wide striping occurs when chunks of data are spread across multiple arrays, possibly all the drives in the system.Narrow striping occurs when the chunks of data are spread across the drives in a single array.
Data striping is used in somedatabases, such asSybase, and in certain RAID devices under software or hardware control, such asIBM's9394 RAMAC Array subsystem. File systems ofclusters also use striping.OracleAutomatic Storage Management allows ASM files to be either coarse or fine striped.