1 RAID Overview 91.560. 2 n Computing speeds double every 3 years n Disk speeds cant keep up n Data needs higher MTBF than any component in system n IO.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advanced Piloting Cruise Plot.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
FACTORING ax2 + bx + c Think “unfoil” Work down, Show all steps.
Addition Facts
Year 6 mental test 5 second questions
Around the World AdditionSubtraction MultiplicationDivision AdditionSubtraction MultiplicationDivision.
ZMQS ZMQS
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
Copyright © 2009 EMC Corporation. Do not Copy - All Rights Reserved.
IT 344: Operating Systems Winter 2007 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Chia-Chi Teng CTB 265.
CSE 451: Operating Systems Spring 2012 Module 20 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570 ©
ABC Technology Project
© S Haughton more than 3?
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
Squares and Square Root WALK. Solve each problem REVIEW:
Do you have the Maths Factor?. Maths Can you beat this term’s Maths Challenge?
Chapter 5 Test Review Sections 5-1 through 5-4.
SIMOCODE-DP Software.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
We will resume in: 25 Minutes.
©Brooks/Cole, 2001 Chapter 12 Derived Types-- Enumerated, Structure and Union.
A SMALL TRUTH TO MAKE LIFE 100%
1 Unit 1 Kinematics Chapter 1 Day
PSSA Preparation.
1 PART 1 ILLUSTRATION OF DOCUMENTS  Brief introduction to the documents contained in the envelope  Detailed clarification of the documents content.
How Cells Obtain Energy from Food
1 Advanced Database Systems Dr. Fatemeh Ahmadi-Abkenari February 2013.
1 Advanced Database Systems Dr. Fatemeh Ahmadi-Abkenari September 2013.
I/O Systems and Storage Systems May 22, 2000 Instructor: Gary Kimura.
Redundant Array of Independent Disks
Redundant Array of Inexpensive Disks aka Redundant Array of Independent Disks (RAID) Modified from CCT slides.
RAID Disk Arrays Hank Levy. 212/5/2015 Basic Problems Disks are improving, but much less fast than CPUs We can use multiple disks for improving performance.
RAID Overview.
Disks and RAID.
RAID Disk Arrays Hank Levy 1.
RAID Disk Arrays Hank Levy 1.
CSE 451: Operating Systems Spring 2005 Module 17 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
CSE 451: Operating Systems Winter 2009 Module 13 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
Mark Zbikowski and Gary Kimura
CSE 451: Operating Systems Autumn 2004 Redundant Arrays of Inexpensive Disks (RAID) Hank Levy 1.
CSE 451: Operating Systems Winter 2012 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
CSE 451: Operating Systems Autumn 2009 Module 19 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
RAID Disk Arrays Hank Levy 1.
CSE 451: Operating Systems Winter 2004 Module 17 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
CSE 451: Operating Systems Winter 2006 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
Presentation transcript:

1 RAID Overview

2 n Computing speeds double every 3 years n Disk speeds cant keep up n Data needs higher MTBF than any component in system n IO Performance and Availability Issues! The Motivation for RAID

3 n PERFORMANCE u Parallelism u Load Balancing n AVAILABILITY u Redundancy: Mirroring, or Striping with Parity n FLEXIBILITY u Selectable Performance/Availability/Cost RAID to the Rescue!

4 n Redundant Array of Independent Disks (a.k.a. Disk Array) u Multiple drives, single host disk unit n Provides opportunity to increase: u Performance via Parallelism u Data Availability via Redundancy n Cheap cost via commodity disks What is RAID Technology?

5 Chunk size tuneable for BW vs Thruput tradeoffs u Large Chunk High Throughput (IO/sec) u Small Chunk High Bandwidth (MB/sec) Chunk 1 Parity Chunk 11Chunk 16Chunk 21Chunk 5Chunk 10Chunk 15Chunk 20Chunk 2Chunk 7Chunk 17Chunk 22Chunk 3Chunk 8Chunk 13Chunk 23 Drive 5 Chunk 12Chunk 0Chunk 18Chunk 9Chunk 14Chunk 19Chunk 24Chunk 4Chunk 6 Drive 4 Drive 3 Drive 2 Drive 1 Performance: Disk Striping

6 Data Stream, OR IO Stream, can be multiplexed across multiple disks, depending on BW vs Thruput. Parity data is also stored on disk. Same data written to both disks. Striping with Parity Single Host Unit > Add XORd parity for increased availability. Mirroring Availability: Redundancy

7 n Parity = XOR of data from every disk in the RAID unit DATA parity - Any single disks data can be recovered by XORing the data of the surviving disks. Parity Redundancy

8 n Many to choose from n Each offers unique tradeoffs u Performance u Availability u Costs n We offer levels 0, 1, 3, 5, 10 RAID Levels

9 Disk Striping with No Redundancy Data Stream, OR IO Stream, can be Striped across multiple disks (BW vs Thruput). High Performance; Low Availability Data Striped on Multiple Disks Multi-threaded Access RAID 0

10 Chunk size tuneable for BW or Thruput n No redundancy Chunk 1 Parity Chunk 11Chunk 16Chunk 21Chunk 5Chunk 10Chunk 15Chunk 20Chunk 2Chunk 7Chunk 17Chunk 22Chunk 3Chunk 8Chunk 13Chunk 23 Drive 5 Chunk 12Chunk 0Chunk 18Chunk 9Chunk 14Chunk 19Chunk 24Chunk 4Chunk 6 Drive 4 Drive 3 Drive 2 Drive 1 RAID 0 Striping

11 Disk Mirroring n Single-disk Performance; Expensive Availability n Data 100% duplicated across both spindles. n Single-threaded access SAME data written to BOTH disks -- no segmenting. Single Host Unit RAID 1

12 Striped Mirrors Data Stream, OR IO Stream, can be Striped across multiple disks (BW vs Thruput). Highest Performance; Most Expensive Availability Multi-threaded Access Single Host Unit RAID 1/0

13 Disk Striping with dedicated parity drive Data Stream is Striped across N-1 disks for high bandwidth. High BW Performance; Cheap Availability Sector-granular data striping Single-threaded Access XOR Parity Data RAID 3

14 Chunk size = single sector (pure RAID 3 would be single byte) n All parity data on same spindle Chunk 1 Parity Chunk 9Chunk 13Chunk 17Chunk 4Chunk 8Chunk 12Chunk 16Chunk 2Chunk 6Chunk 14Chunk 18Chunk 3Chunk 7Chunk 11Chunk 19 Drive 5 Chunk 10Chunk 0Chunk 15Parity Chunk 5 Drive 4 Drive 3 Drive 2 Drive 1 RAID 3 Striping

15 Disk Striping with rotating parity drive IO Stream is Striped across N-1 disks for high IOs per second (thruput). n High Read Performance, expensive Write performance; Cheap Availability n Tuneable Stripe granularity n Optimized for multi-thread access XOR Parity Data RAID 5

16 Chunk size is tuned such that typical IO aligns on single disk. n Parity rotates amongst disks to avoid write bottleneck Chunk 1 Parity Chunk 9Chunk 16ParityChunk 4Chunk 8Chunk 12ParityChunk 2Chunk 6Chunk 13Chunk 17Chunk 3Chunk 10Chunk 18Parity Drive 5 Chunk 0Chunk 14Chunk 7Chunk 11Chunk 15Chunk 19ParityChunk 5 Drive 4 Drive 3 Drive 2 Drive 1 RAID 5 Striping

17 1. Read old data. OldNew 2. Write new data Old P. 3. XOR old and new data to create Partial Product. 4. Read old parity data. 5. Xor old parity with partial product, writing out result as new parity. P. } XOR } New P. Chunk 1Chunk 2Chunk 3 Drive 5 Chunk 0Parity Drive 4 Drive 3 Drive 2 Drive 1 RAID 5 - Write Operation

18 u RAID 0 - Data striping, Non-redundant. u High Performance, Low Availability u RAID 1 - Mirroring u Moderate Performance, Expensive High Availability u RAID 1/0 - Striping and Mirroring u High Performance, Expensively High Availability u RAID 3 - Striping, single parity disk. u High Bandwidth Performance, Cheap Availability u RAID 5 - Striping, rotating parity disk. u High Thruput Performance, Cheap Availability RAID Level Review

19 n Increasing performance gap between CPU and IO n Data availability a priority n RAID meets the IO challenge: u Performance via parallelism u Data Availability via redundancy u Flexibility via multiple RAID levels, each offer unique performance/availability/cost tradeoffs Summary