CSE 451: Operating Systems Spring 2012 Module 20 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570 ©

Slides:



Advertisements
Similar presentations
RAID Redundant Arrays of Independent Disks Courtesy of Satya, Fall 99.
Advertisements

Redundant Array of Independent Disks (RAID) Striping of data across multiple media for expansion, performance and reliability.
1 RAID Overview 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.
What is RAID Redundant Array of Independent Disks.
1 Lecture 18: RAID n I/O bottleneck n JBOD and SLED n striping and mirroring n classic RAID levels: 1 – 5 n additional RAID levels: 6, 0+1, 10 n RAID usage.
IT 344: Operating Systems Winter 2007 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Chia-Chi Teng CTB 265.
CS 346 – April 4 Mass storage –Disk formatting –Managing swap space –RAID Commitment –Please finish chapter 12.
Faculty of Information Technology Department of Computer Science Computer Organization Chapter 7 External Memory Mohammad Sharaf.
Disk & RAID The first HDD (1956) IBM 305 RAMAC 4 MB 50x24 disks 1200 rpm 100 ms access 35k$/y rent Included computer & accounting software.
RAID (Redundant Arrays of Independent Disks). Disk organization technique that manages a large number of disks, providing a view of a single disk of High.
I/O Errors 1 Computer Organization II © McQuain RAID Redundant Array of Inexpensive (Independent) Disks – Use multiple smaller disks (c.f.
RAID Oh yes Whats RAID? Redundant Array (of) Independent Disks. A scheme involving multiple disks which replicates data across multiple drives. Methods.
RAID Redundant Array of Independent Disks
Raid dr. Patrick De Causmaecker What is RAID Redundant Array of Independent (Inexpensive) Disks A set of disk stations treated as one.
RAID- Redundant Array of Inexpensive Drives. Purpose Provide faster data access and larger storage Provide data redundancy.
RAID Redundant Arrays of Inexpensive Disks –Using lots of disk drives improves: Performance Reliability –Alternative: Specialized, high-performance hardware.
R.A.I.D. Copyright © 2005 by James Hug Redundant Array of Independent (or Inexpensive) Disks.
CSE 486/586 CSE 486/586 Distributed Systems Case Study: Facebook f4 Steve Ko Computer Sciences and Engineering University at Buffalo.
Lecture 36: Chapter 6 Today’s topic –RAID 1. RAID Redundant Array of Inexpensive (Independent) Disks –Use multiple smaller disks (c.f. one large disk)
Other Disk Details. 2 Disk Formatting After manufacturing disk has no information –Is stack of platters coated with magnetizable metal oxide Before use,
1 Lecture 26: Storage Systems Topics: Storage Systems (Chapter 6), other innovations Final exam stats:  Highest: 95  Mean: 70, Median: 73  Toughest.
I/O Systems and Storage Systems May 22, 2000 Instructor: Gary Kimura.
RAID Systems CS Introduction to Operating Systems.
CSE 451: Operating Systems Winter 2010 Module 13 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura.
Servers Redundant Array of Inexpensive Disks (RAID) –A group of hard disks is called a disk array FIGURE Server with redundant NICs.
Storage Systems CSE 598d, Spring 2007 Lecture 5: Redundant Arrays of Inexpensive Disks Feb 8, 2007.
Chapter 6 RAID. Chapter 6 — Storage and Other I/O Topics — 2 RAID Redundant Array of Inexpensive (Independent) Disks Use multiple smaller disks (c.f.
RAID Shuli Han COSC 573 Presentation.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
CSE 321b Computer Organization (2) تنظيم الحاسب (2) 3 rd year, Computer Engineering Winter 2015 Lecture #4 Dr. Hazem Ibrahim Shehata Dept. of Computer.
Redundant Array of Independent Disks
Two or more disks Capacity is the same as the total capacity of the drives in the array No fault tolerance-risk of data loss is proportional to the number.
N-Tier Client/Server Architectures Chapter 4 Server - RAID Copyright 2002, Dr. Ken Hoganson All rights reserved. OS Kernel Concept RAID – Redundant Array.
RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU.
Lecture 9 of Advanced Databases Storage and File Structure (Part II) Instructor: Mr.Ahmed Al Astal.
Redundant Array of Inexpensive Disks aka Redundant Array of Independent Disks (RAID) Modified from CCT slides.
RAID REDUNDANT ARRAY OF INEXPENSIVE DISKS. Why RAID?
Copyright © Curt Hill, RAID What every server wants!
Redundant Array of Independent Disks.  Many systems today need to store many terabytes of data.  Don’t want to use single, large disk  too expensive.
The concept of RAID in Databases By Junaid Ali Siddiqui.
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.
I/O Errors 1 Computer Organization II © McQuain RAID Redundant Array of Inexpensive (Independent) Disks – Use multiple smaller disks (c.f.
CSE 451: Operating Systems Spring 2010 Module 18 Redundant Arrays of Inexpensive Disks (RAID) John Zahorjan Allen Center 534.
CS Introduction to Operating Systems
Multiple Platters.
RAID Redundant Arrays of Independent Disks
Steve Ko Computer Sciences and Engineering University at Buffalo
Steve Ko Computer Sciences and Engineering University at Buffalo
RAID Non-Redundant (RAID Level 0) has the lowest cost of any RAID
CSE451 I/O Systems and the Full I/O Path Autumn 2002
CSE 451: Operating Systems Spring 2006 Module 18 Redundant Arrays of Inexpensive Disks (RAID) John Zahorjan Allen Center.
RAID Disk Arrays Hank Levy 1.
RAID RAID Mukesh N Tekwani
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 Autumn 2010 Module 19 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.
TECHNICAL SEMINAR PRESENTATION
RAID Redundant Array of Inexpensive (Independent) Disks
UNIT IV RAID.
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 Winter 2007 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
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.
RAID RAID Mukesh N Tekwani April 23, 2019
CSE 451: Operating Systems Winter 2004 Module 17 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
IT 344: Operating Systems Winter 2007 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Chia-Chi Teng CTB
CSE 451: Operating Systems Winter 2006 Module 18 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570.
Presentation transcript:

CSE 451: Operating Systems Spring 2012 Module 20 Redundant Arrays of Inexpensive Disks (RAID) Ed Lazowska Allen Center 570 © 2012 Gribble, Lazowska, Levy, Zahorjan 1

2 The challenge Disk transfer rates are improving, but much less fast than CPU performance We can use multiple disks to improve performance –by striping files across multiple disks (placing parts of each file on a different disk), we can use parallel I/O to improve access time Striping reduces reliability –10 disks have 1/10th the MTBF (mean time between failures) of one disk So, we need striping for performance, but we need something to help with reliability

© 2012 Gribble, Lazowska, Levy, Zahorjan 3 Reliability At the scales were currently considering (tens of disks), its typically enough to be resilient to the failure of a single disk –What are the chances that a second disk will fail before youve replaced the first one? Er, it has happened to us! To achieve this level of reliability, add redundant data that allows a single disk failure to be tolerated –Well see how in a minute So: –Obtain performance from striping –Obtain reliability from redundancy (which steals back some of the performance gain)

© 2012 Gribble, Lazowska, Levy, Zahorjan 4 RAID A RAID is a Redundant Array of Inexpensive Disks Disks are small and cheap, so its easy to put lots of disks (10s, say) in one box for increased storage, performance, and availability Data plus some redundant information is striped across the disks in some way How striping is done is key to performance and reliability The RAID controller deals with this – it is invisible to the operating system

© 2012 Gribble, Lazowska, Levy, Zahorjan 5 Some RAID tradeoffs Granularity –fine-grained: stripe each file over all disks high throughput for the file limits transfer to 1 file at a time –course-grained: stripe each file over only a few disks limits throughput for 1 file allows concurrent access to multiple files Redundancy –uniformly distribute redundancy information on disks avoids load-balancing problems –concentrate redundancy information on a small number of disks partition the disks into data disks and redundancy disks

© 2012 Gribble, Lazowska, Levy, Zahorjan 66 RAID Level 0: Non-Redundant Striping RAID Level 0 is a non-redundant disk array Files/blocks are striped across disks, no redundant info High (single-file) read throughput Best write throughput (no redundant info to write) Any disk failure results in data loss data disks

© 2012 Gribble, Lazowska, Levy, Zahorjan 77 RAID Level 1: Mirrored Disks Files are striped across half the disks, and mirrored to the other half –2x space expansion Reads: Read from either copy Writes: Write both copies On failure, just use the surviving disk data disksmirror copies identical

© 2012 Gribble, Lazowska, Levy, Zahorjan 88 Prelude to RAID Levels 2-5: A parity refresher To each byte, add a bit whose value is set so that the total number of 1s is even Any single missing bit can be reconstructed (Why does memory parity not work quite this way?) More sophisticated schemes (e.g., based on Hamming codes) can correct multiple bit errors – called ECC (error correcting codes)

© 2012 Gribble, Lazowska, Levy, Zahorjan 99 RAID Levels 2, 3, and 4: Striping + Parity Disk RAID levels 2, 3, and 4 use parity or ECC disks –e.g., each byte on the parity disk is a parity function of the corresponding bytes on all the other disks –details between the different levels have to do with kind of ECC used, and whether it is bit-level or block-level A read accesses all the data disks, a write accesses all the data disks plus the parity disk On disk failure, read the remaining disks plus the parity disk to compute the missing data data disksparity disk

© 2012 Gribble, Lazowska, Levy, Zahorjan 10 RAID Level 5 RAID Level 5 uses block interleaved distributed parity Like parity scheme, but distribute the parity info (as well as data) over all disks –for each block, one disk holds the parity, and the other disks hold the data Significantly better performance –parity disk is not a hot spot 0123PO 567P P289 data & parity drives File Block Numbers

© 2012 Gribble, Lazowska, Levy, Zahorjan 11 RAID Level 6 Basically like RAID 5 but with replicated parity blocks so that it can survive two disk failures. Useful for larger disk arrays where multiple failures are more likely.

© 2012 Gribble, Lazowska, Levy, Zahorjan 12 Example RAID Storage Promise 3U rack-mountable 16-disk RAID Storage System Hot swappable drives Dual controllers with 4 host interface ports for reliability Can be ganged together into larger units