raid cop 5611 advanced operating systems adapted from andy wang’s slides at fsu

25
RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Upload: abel-ford

Post on 27-Dec-2015

226 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

RAID

COP 5611Advanced Operating Systems

Adapted from Andy Wang’s slides at FSU

Page 2: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Parallel Disk Access and RAID

One disk can only deliver data at its maximum rate

So to get more data faster, get it from multiple disks simultaneously

Saving on rotational latency and seek time

Page 3: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Utilizing Disk Access Parallelism

Some parallelism available just from having several disks

But not muchInstead of satisfying each access from one

disk, use multiple disks for each accessStore part of each data block on several

disks

Page 4: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Disk Parallelism Example

open(foo) read(bar) write(zoo)

FileSystem

Page 5: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Data Striping

Transparently distributing data over multiple disks

Benefits – Increases disk parallelism Faster response for big requests

Major parameters are number of disks and size of data interleaf

Page 6: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Fine-Grained Vs. Coarse-Grained Data Interleaving Fine grain data interleaving

+ High data rate for all requests But only one request per disk array Lots of time spent positioning

Coarse-grain data interleaving+ Large requests access many disks+ Many small requests handled at once Small I/O requests access few disks

Page 7: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Reliability of Disk Arrays

Without disk arrays, failure of one disk among N loses 1/Nth of the data

With disk arrays (fine grained across all N disks), failure of one disk loses all data

N disks 1/Nth as reliable as one disk

Page 8: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Adding Reliability to Disk Arrays

Buy more reliable disksBuild redundancy into the disk array

Multiple levels of disk array redundancy possible

Most organizations can prevent any data loss from single disk failure

Page 9: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Basic Reliability Mechanisms

Duplicate dataParity for error detectionError Correcting Code for detection and

correction

Page 10: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Parity Methods

Can use parity to detect multiple errors But typically used to detect single error

If hardware errors are self-identifying, parity can also correct errors

When data is written, parity must be written, too

Page 11: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Error-Correcting Code

Based on Hamming codes, mostlyNot only detect error, but identify which bit

is wrong

Page 12: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

RAID Architectures

Redundant Arrays of Independent DisksBasic architectures for organizing disks

into arraysAssuming independent control of each

diskStandard classification scheme divides

architectures into levels

Page 13: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Non-Redundant Disk Arrays (RAID Level 0)

No redundancy at allSo, what we just talked aboutAny failure causes data loss

Page 14: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Non-Redundant Disk Array Diagram (RAID Level 0)

open(foo) read(bar) write(zoo)

FileSystem

Page 15: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Mirrored Disks (RAID Level 1)

Each disk has second disk that mirrors its contents Writes go to both disks No data striping

+ Reliability is doubled

+ Read access faster

- Write access slower

- Expensive and inefficient

Page 16: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Mirrored Disk Diagram (RAID Level 1)

open(foo) read(bar) write(zoo)

FileSystem

Page 17: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Memory-Style ECC (RAID Level 2)

Some disks in array are used to hold ECCE.g., 4 data disks require 3 ECC disks

+ More efficient than mirroring

+ Can correct, not just detect, errors

- Still fairly inefficient

Page 18: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Memory-Style ECC Diagram (RAID Level 2)

open(foo) read(bar) write(zoo)

FileSystem

Page 19: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Bit-Interleaved Parity (RAID Level 3)

Each disk stores one bit of each data block

One disk in array stores parity for other disks

+ More efficient that Levels 1 and 2

- Parity disk doesn’t add bandwidth

- Can’t correct errors

Page 20: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Bit-Interleaved RAID Diagram (Level 3)

open(foo) read(bar) write(zoo)

FileSystem

Page 21: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Block-Interleaved Parity (RAID Level 4)

Like bit-interleaved, but data is interleaved in blocks of arbitrary size Size is called striping unit Small read requests use 1 disk

+ More efficient data access than level 3

+ Satisfies many small requests at once

- Parity disk can be a bottleneck

- Small writes require 4 I/Os

Page 22: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Block-Interleaved Parity Diagram (RAID Level 4)

open(foo) read(bar) write(zoo)

FileSystem

Page 23: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Block-Interleaved Distributed-Parity (RAID Level 5)

Sort of the most general level of RAIDSpread the parity out over all disks+ No parity disk bottleneck+ All disks contribute read bandwidth– Requires 4 I/Os for small writes

Page 24: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Block-Interleaved Distributed-Parity Diagram (RAID Level 5)

open(foo) read(bar) write(zoo)

FileSystem

Page 25: RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU

Where Did RAID Look For Performance Improvements?Parallel use of disks

Improve overall delivered bandwidth by getting data from multiple disks

Biggest problem is small write performance

But we know how to deal with small writes . . .