<
storage, architecture> (RAID. Originally "Redundant Array
s of Inexpen
sive Di
sk
s") A project at the computer
science department of the
University of California at Berkeley, under the direction of Profe
ssor Katz, in conjunction with Profe
ssor
John Ousterhout and Profe
ssor
David Patterson. The project i
s reaching it
s culmination with the implementation of a prototype di
sk array file
server with a capacity of 40 GByte
s and a
su
stained bandwidth of 80 MByte
s/
second. The
server i
s being interfaced to a 1 Gb/
s local area network. A new initiative, which i
s part of the
sequoia 2000 Project,
seek
s to con
struct a geographically di
stributed
storage
sy
stem
spanning di
sk array
s and automated librarie
s of
optical disks and tape
s. The project will extend the interleaved
storage technique
s so
succe
ssfully applied to di
sk
s to tertiary
storage device
s. A key element of the re
search will be to develop technique
s for managing latency in the I/O and network path
s. The original ("..Inexpen
sive..") term referred to the 3.5 and 5.25 inch di
sk
s u
sed for the fir
st RAID
sy
stem but no longer applie
s. The following
standard RAID
specification
s exi
st: RAID 0 Non-redundant
striped array RAID 1 Mirrored array
s RAID 2 Parallel array with ECC RAID 3 Parallel array with parity RAID 4
striped array with parity RAID 5
striped array with rotating parity
.
. ["A Ca
se for Redundant Array
s of Inexpen
sive Di
sk
s (RAID)", "D. A. Patter
son and G. Gib
son and R. H. Katz", Proc ACM
sIGMOD Conf, Chicago, IL, Jun 1988]. ["Introduction to Redundant Array
s of Inexpen
sive Di
sk
s (RAID)", "D. A. Patter
son and P. Chen and G. Gib
son and R. H. Katz", IEEE COMPCON 89,
san Franci
sco, Feb-Mar 1989]. (1995-07-20)
style="border-width:thin; border-color:#333333; border-style:dashed; padding:5px;" align="left">In addition suitable contents:
[ 2 ] [ = ] [ ACM ] [ ag ] [ AI ] [ ai ] [ AID ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ architecture ] [ archive ] [ arity ] [ array ] [ as ] [ at ] [ au ] [ av ] [ B ] [ b ] [ ba ] [ bandwidth ] [ be ] [ Berkeley ] [ br ] [ bs ] [ Byte ] [ C ] [ ca ] [ capacity ] [ cat ] [ cc ] [ Ch ] [ ch ] [ Chen ] [ Chicago ] [ ci ] [ CM ] [ co ] [ COM ] [ com ] [ Computer ] [ computer ] [ con ] [ conjunction ] [ cons ] [ cu ] [ cy ] [ D ] [ de ] [ device ] [ disk ] [ disks ] [ do ] [ doc ] [ du ] [ E ] [ ec ] [ ECC ] [ ed ] [ edu ] [ ee ] [ element ] [ er ] [ es ] [ et ] [ extend ] [ fi ] [ file ] [ file server ] [ fo ] [ for ] [ G ] [ GB ] [ Gb ] [ ge ] [ gi ] [ gr ] [ graph ] [ h ] [ hing ] [ hit ] [ hn ] [ hr ] [ hs ] [ HT ] [ ht ] [ HTTP ] [ id ] [ IE ] [ ie ] [ IEEE ] [ il ] [ in ] [ inc ] [ int ] [ interface ] [ interleave ] [ io ] [ I/O ] [ iq ] [ ir ] [ is ] [ it ] [ J ] [ John Ousterhout ] [ K ] [ ke ] [ key ] [ la ] [ latency ] [ Lex ] [ li ] [ local area network ] [ ly ] [ M ] [ ma ] [ man ] [ MB ] [ mm ] [ mo ] [ mod ] [ module ] [ mp ] [ MPC ] [ N ] [ na ] [ nc ] [ ne ] [ net ] [ network ] [ nf ] [ ng ] [ ni ] [ nn ] [ no ] [ ns ] [ O ] [ om ] [ op ] [ pa ] [ parity ] [ path ] [ PC ] [ pe ] [ ph ] [ pl ] [ port ] [ pr ] [ pt ] [ query ] [ ques ] [ RAID ] [ rc ] [ re ] [ Red ] [ Redundant Arrays of Inexpensive Disks ] [ rl ] [ ro ] [ ru ] [ s ] [ san Francisco ] [ sc ] [ se ] [ seek ] [ serve ] [ server ] [ sI ] [ si ] [ sIG ] [ sit ] [ sk ] [ so ] [ spec ] [ specification ] [ st ] [ standard ] [ storage ] [ stripe ] [ struct ] [ su ] [ sum ] [ sy ] [ system ] [ T ] [ ] [ tap ] [ tape ] [ th ] [ tm ] [ to ] [ tp ] [ tr ] [ tt ] [ tw ] [ type ] [ tz ] [ ua ] [ um ] [ University of California at Berkeley ] [ us ] [ ve ] [ vi ] [ win ] [ yt ]