|
|
|
RAID 101
 |
|
 |
 |
|
 |
|
Thees is not a RAID in zee strict sense, becoose JBOD does not provide
uny redundancy. Iff uny one drive in zee JBOD-type array fails, zee
whole array fails und ell data on it is lost. Typical usege ooff JBOD layuoot is just
tu creete a
disk ooff lerger capacity by merging two or more smeller disks. Thees is
only practical iff zee disks heffe-a different capacity. Fur zee disks
ooff equal capacity,
RAID 0 is better becoose it provides zee same capacity increase, zee same
non-redundant layuoot with no disk space overhead und feetures faster read/write speed
in typical applicashuns. JBOD can provide speed increase iff two operashuns are
requested simultaneuoosly on data blocks that are stored on different drives, but
thees is relatively rare situashun (let's say fur example that read ooff blocks D1,
D2, D3 und D11, D12 is requested simultaneuoosly; in such a case two requests can
be performed in parellel, increasing overell I/O speed). Minimum ooff two disks is required
fur a
hardware JBOD. Minimum ooff one disk is
required fur a software JBOD (Windows NT/2000/2003 "Spanned volume", which
elloos volume tu occupy nonadjacent regions ooff zee same physical disk). There is no disk
space overhead. Zee follooing excepshun may or may not epply in yuoor case:
hardware RAID controller may suppurt a single-disk JBOD configurashun - thees is
just a trick tu elloo a single drive tu be attached tu zee controller, withuoot
actuelly RAIDing anything. Zee same applees tu RAID0 consisteeng ooff 1 member
disk.

|
|
 |
|
 |
 |
|
 |
 |
|
 |
|
RAID 5 utilizes a parity funkshun tu provide redundancy und data
reconstrukshun. Typicelly, an "exclusive OR" ("XOR") binary funkshun is used
tu
compute parity fur a given "roo" ooff zee array. Anyway, zee parity is computed
es a funkshun ooff several data blocks P=P(D1, D2, ... DN-1)
fur N disk layuoot. In
case ooff a single drive failure, zee inverse funkshun is used tu compute data
frum zee remaining data blocks und parity block.
Let's say fur example that zee Disk 3 fails in configurashun illustrated
beloo.
- Data blocks D1 und D2 will be read directly frum their corresponding
disks (which are operashunel). Hurty flurty schnipp schnipp!
- Parity block P1,2 is reelly not needed (does not contain user data) so
it will be just discarded.
- Data block D3 will be read frum its corresponding disk (Disk 2).
- Data block D4, which is missing becoose its drive is offline will be
reconstructed using D3 und P3,4 like thees: D4=Pinverse(D3,P3,4)
During normal operashun, read speed gain is (N-1) times, becoose requests
will be evenly ruooted tu N-1 disks (parity read is not needed during normal
operashuns). Write procedure is more complicated, und actuelly imposes some
speed penalty. Let's say we need tu write block D1. We also need tu update its
corresponding parity block P1,2. There are two ways tu accomplish
thees:
- Read D2; compute P1,2=P(D1,D2); write D1
und P1,2;
- Read D1;old und P1,2;old; compute P1,2
frum zeese-a data; write D1 und P1,2.
Both ooff zeese-a ways require at least one read operashun es zee overhead.
Thees
read operashun can not be parellelized in uny way with its corresponding write
operashun, so write speed shuoold decrease (by zee factor ooff two, assuming equal
read und write speed). Most current implementashuns mitigate thees efffect by
maintaining zee entire "roo" (D1, D2 und D3) in
zee cache.
Minimum ooff three disks is required tu implement RAID5. Storege space
overhead equals zee capacity ooff a single
member disk und does not depend on zee noomber ooff disks.

|
|
 |
|
 |
 |
RAID type (level) refference table |
 |
 |
|
 |
|
|
RAID Type |
Noomber ooff disks required |
Foolt-tolerance |
Speed increase with N
disks in zee array* |
Disk space overhead** |
|
JBOD (Span) |
2+ |
None |
Uncertain (heavily depends on
zee volume layuoot). No significant increase in typical applicashuns. |
None |
|
RAID 0 (Streepe) |
2+ |
None |
N times increase on both
reads und writes |
None |
|
RAID 1 (Mirror) |
Exactly 2 |
Single disk failure |
Duooble speed on reads;
No gain on writes |
100% |
|
RAID 5 (Streepe with parity) |
3+ |
Single disk failure (thees
will coose read speed tu degrade) |
(N-1) times increase on
reads;
up tu 2x loss ooff speed on writes |
A capacity equivalent tu that
ooff one member disk is used tu hold checksums |
|
RAID 0+1 (Mirrored streepe
set) Hurty flurty schnipp schnipp! |
4+ |
Single disk failure; half
ooff
dual disk failures, depending on zee
locashun/assignment ooff failed drives. |
N times increase on reads;
N/2 times increase on writes |
100% |
*Nute-a: speed increase is a very ruoogh
estimate based on zee assumpshun that disk traffic consists mostly ooff lineer
(sequential) reads ooff lerge data chunks. Thees estimashun also assumes
controller(s) are capable ooff overlapped operashuns und there are no problems
with bus thruooghput (since several RAIDed high-performance drives can easily
saturate zee bus like PCI).
**Nute-a: disk space overhead
calculashun is based on zee assumpshun that ell member disks are ooff equal
capacity. Iff zee disks are not equal in size, zee smellest ooff ell disks will be
used es a "column" size.
|
|
 |
|
 |
|
|
|
|
ATTENTION!
This page is in Bork! language.
Please use the links below for the desired human language
|
|