RAID Systems CS 537 - Introduction to Operating Systems.

Slides:



Advertisements
Similar presentations
A CASE FOR REDUNDANT ARRAYS OF INEXPENSIVE DISKS (RAID) D. A. Patterson, G. A. Gibson, R. H. Katz University of California, Berkeley.
Advertisements

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.
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.
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.
RAID Redundant Array of Independent Disks
CSCE430/830 Computer Architecture
 RAID stands for Redundant Array of Independent Disks  A system of arranging multiple disks for redundancy (or performance)  Term first coined in 1987.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
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.
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)
Sean Traber CS-147 Fall  7.9 RAID  RAID Level 0  RAID Level 1  RAID Level 2  RAID Level 3  RAID Level 4 
RAID Technology CS350 Computer Organization Section 2 Larkin Young Rob Deaderick Amos Painter Josh Ellis.
Computer ArchitectureFall 2007 © November 28, 2007 Karem A. Sakallah Lecture 24 Disk IO and RAID CS : Computer Architecture.
1 Storage (cont’d) Disk scheduling Reducing seek time (cont’d) Reducing rotational latency RAIDs.
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.
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 System: RAID Questions answered in this lecture: What is RAID? How does one trade-off between: performance, capacity, and reliability? What is.
Transactions and Reliability. File system components Disk management Naming Reliability  What are the reliability issues in file systems? Security.
ICOM 6005 – Database Management Systems Design Dr. Manuel Rodríguez-Martínez Electrical and Computer Engineering Department Lecture 6 – RAID ©Manuel Rodriguez.
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 Ref: Stallings. Introduction The rate in improvement in secondary storage performance has been considerably less than the rate for processors and.
RAID Shuli Han COSC 573 Presentation.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
Redundant Array of Independent Disks
L/O/G/O External Memory Chapter 3 (C) CS.216 Computer Architecture and Organization.
N-Tier Client/Server Architectures Chapter 4 Server - RAID Copyright 2002, Dr. Ken Hoganson All rights reserved. OS Kernel Concept RAID – Redundant Array.
I/O – Chapter 8 Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.
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.
CSI-09 COMMUNICATION TECHNOLOGY FAULT TOLERANCE AUTHOR: V.V. SUBRAHMANYAM.
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.
RAID Systems Ver.2.0 Jan 09, 2005 Syam. RAID Primer Redundant Array of Inexpensive Disks random, real-time, redundant, array, assembly, interconnected,
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
Chapter 11 Implementing File System Chapter 12 Secondary-Storage Structure Operating System Concepts with Java, 8th Edition Abraham Silberschatz, Yale.
RAID TECHNOLOGY RASHMI ACHARYA CSE(A) RG NO
Network-Attached Storage. Network-attached storage devices Attached to a local area network, generally an Ethernet-based network environment.
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
A Case for Redundant Arrays of Inexpensive Disks (RAID)
Multiple Platters.
Disks and RAID.
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
ICOM 6005 – Database Management Systems Design
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.
TECHNICAL SEMINAR PRESENTATION
RAID Redundant Array of Inexpensive (Independent) Disks
UNIT IV RAID.
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.
RAID Disk Arrays Hank Levy 1.
RAID RAID Mukesh N Tekwani April 23, 2019
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:

RAID Systems CS Introduction to Operating Systems

Mass Storage Many systems today need to store many terabytes of data Don’t want to use single, large disk –too expensive –failures could be catastrophic Would prefer to use many smaller disks

RAID Redundant Array of Inexpensive Disks Basic idea is to connect multiple disks together to provide –large storage capacity –faster access to reading data –redundant data Many different levels of RAID systems –differing levels of redundancy, error checking, capacity, and cost

Striping Take file data and map it to different disks Allows for reading data in parallel file datablock 1block 0block 2block 3 Disk 0Disk 1Disk 2Disk 3

Parity Way to do error checking and correction Add up all the bits that are 1 –if even number, set parity bit to 0 –if odd number, set parity bit to 1 To actually implement this, do an exclusive OR of all the bits being considered Consider the following 2 bytes byteparity If a single bit is bad, it is possible to correct it

Mirroring Keep to copies of data on two separate disks Gives good error recovery –if some data is lost, get it from the other source Expensive –requires twice as many disks Write performance can be slow –have to write data to two different spots Read performance is enhanced –can read data from file in parallel

RAID Level-0 Often called striping Break a file into blocks of data Stripe the blocks across disks in the system Simple to implement –disk = file block % number of disks –sector = file block / number of disks provides no redundancy or error detection –important to consider because lots of disks means low Mean Time To Failure (MTTF)

RAID Level-0 file datablock 1block 0block 2block 3block 4 Disk 0Disk 1 0 block 0 1 block 2 2 block sectors 0 block 1 1 block sectors

RAID Level-1 A complete file is stored on a single disk A second disk contains an exact copy of the file Provides complete redundancy of data Read performance can be improved –file data can be read in parallel Write performance suffers –must write the data out twice Most expensive RAID implementation –requires twice as much storage space

RAID Level-1 file datablock 1block 0block 2block 3block 4 Disk 0Disk 1 0 block 0 1 block 1 2 block 2 3 block 3 4 block 4 5 sectors 0 block 0 1 block 1 2 block 2 3 block 3 4 block 4 5 sectors

RAID Level-2 Stripes data across disks similar to Level-0 –difference is data is bit interleaved instead of block interleaved Uses ECC to monitor correctness of information on disk Multiple disks record the ECC information to determine which disk is in fault A parity disk is then used to reconstruct corrupted or lost data

RAID Level-2 file datablock 1block 0block 2block 3block 4 Data Disk ECC DiskParity DiskECC Disk

RAID Level-2 Reconstructing data –assume data striped across eight disks –correct data: –parity: 0 –data read: –if we can determine that disk 2 is in error –just use read data and parity to know which bit to flip

RAID Level-2 Requires fewer disks than Level-1 to provide redundancy Still needs quite a few more disks –for 10 data disks need 4 check disks plus parity disk Big problem is performance –must read data plus ECC code from other disks –for a write, have to modify data, ECC, and parity disks Another big problem is only one read at a time –while a read of a single block can be done in parallel –multiple blocks from multiple files can’t be read because of the bit-interleaved placement of data

RAID Level-3 One big problem with Level-2 are the disks needed to detect which disk had an error Modern disks can already determine if there is an error –using ECC codes with each sector So just need to include a parity disk –if a sector is bad, the disk itself tells us, and use the parity disk to correct it

RAID Level-4 Big problem with Level-2 and Level-3 is the bit interleavening –to access a single file block of data, must access all the disks –allows good parallelism for a single access but doesn’t allow multiple I/O’s Level-4 interleaves file blocks –allows multiple small I/O’s to be done at once

RAID Level-4 Still use a single disk for parity Now the parity is calculated over data from multiple blocks –Level-2,3 calculate it over a single block If an error detected, need to read other blocks on other disks to reconstruct data

Level-4 vs. Level-2,3 Transfer Units L3 L3 Parity L4 a b c d 0123 a0b0c0d0a1b1c1d1a2b2c2d2a3b3c3d3 abcd a0a1a2a3 L4 Parity 0123 b0b1b2b3c0c1c2c3d0d1d2d3 4 different disks

RAID Level-4 Reads are simple to understand –want to read block A, read it from disk 0 –if there is an error, read in blocks B,C, D, and parity block and calculate correct data What about writes? –it looks like a write still requires access to 4 data disks to recalculate the parity data –not true, can use the following formula new parity = (old data xor new data) xor old parity –a write requires 2 reads and 2 writes

RAID Level-4 Doing multiple small reads is now faster than before However, writes are still very slow –this is because of calculating and writing the parity blocks Also, only one write is allowed at a time –all writes must access the check disk so other writes have to wait

RAID Level-5 Level-5 stripes file data and check data over all the disks –no longer a single check disk –no more write bottleneck Drastically improves the performance of multiple writes –they can now be done in parallel Slightly improves reads –one more disk to use for reading

RAID Level-5 Level-4Level data disks check disk data and check disks S0S0 S1S1 S2S2 S3S3 S4S4 S5S5 S0S0 S1S1 S2S2 S3S3 S4S4 S5S5

RAID Level-5 Notice that for Level-4 a write to sector 0 on disk 2 and sector 1 on disk 3 both require a write to disk five for check information In Level-5, a write to sector 0 on disk 2 and sector 1 on disk 3 require writes to different disks for check information (disks 5 and 4, respectively) Best of all worlds –read and write performance close to that of RAID Level-1 –requires as much disk space as Levels-3,4

RAID Level-10 Combine Level-0 and Level-1 Stripe a files data across multiple disks –gives great read/write performance Mirror each strip onto a second disk –gives the best redundancy The most high performance system The most expensive system