Lecture 11: Storage Systems Disk, RAID, Dependability Kai Bu

Slides:



Advertisements
Similar presentations
CS224 Spring 2011 Computer Organization CS224 Chapter 6A: Disk Systems With thanks to M.J. Irwin, D. Patterson, and J. Hennessy for some lecture slide.
Advertisements

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.
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.
Triple-Parity RAID and Beyond Hai Lu. RAID RAID, an acronym for redundant array of independent disks or also known as redundant array of inexpensive disks,
RAID Oh yes Whats RAID? Redundant Array (of) Independent Disks. A scheme involving multiple disks which replicates data across multiple drives. Methods.
Magnetic Disk Magnetic disks are the foundation of external memory on virtually all computer systems. A disk is a circular platter constructed of.
RAID Redundant Array of Independent Disks
CSCE430/830 Computer Architecture
“Redundant Array of Inexpensive Disks”. CONTENTS Storage devices. Optical drives. Floppy disk. Hard disk. Components of Hard disks. RAID technology. Levels.
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)
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.
S.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
I/O Systems and Storage Systems May 22, 2000 Instructor: Gary Kimura.
Servers Redundant Array of Inexpensive Disks (RAID) –A group of hard disks is called a disk array FIGURE Server with redundant NICs.
Lecture 11: Storage Systems Disk, RAID, Dependability Kai Bu
Storage System: RAID Questions answered in this lecture: What is RAID? How does one trade-off between: performance, capacity, and reliability? What is.
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.
1 Fault-Tolerant Computing Systems #2 Hardware Fault Tolerance Pattara Leelaprute Computer Engineering Department Kasetsart University
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Storage & Peripherals Disks, Networks, and Other Devices.
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.
Module 9 Review Questions 1. The ability for a system to continue when a hardware failure occurs is A. Failure tolerance B. Hardware tolerance C. Fault.
L/O/G/O External Memory Chapter 3 (C) CS.216 Computer Architecture and Organization.
CSE431 Chapter 6A.1Irwin, PSU, 2008 Chapter 6A: Disk Systems Mary Jane Irwin ( ) [Adapted from Computer Organization.
I/O – Chapter 8 Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.
1 Chapter 7: Storage Systems Introduction Magnetic disks Buses RAID: Redundant Arrays of Inexpensive Disks.
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?
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
I/O Computer Organization II 1 Introduction I/O devices can be characterized by – Behavior: input, output, storage – Partner: human or machine – Data rate:
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.
Αρχιτεκτονική Υπολογιστών Ενότητα # 6: RAID Διδάσκων: Γεώργιος Κ. Πολύζος Τμήμα: Πληροφορικής.
CS 6290 I/O and Storage Milos Prvulovic. Storage Systems I/O performance (bandwidth, latency) –Bandwidth improving, but not as fast as CPU –Latency improving.
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
1 Lecture 23: Storage Systems Topics: disk access, bus design, evaluation metrics, RAID (Sections )
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
W4118 Operating Systems Instructor: Junfeng Yang.
LECTURE 13 I/O. I/O CANNOT BE IGNORED Assume a program requires 100 seconds, 90 seconds for main memory, 10 seconds for I/O. Assume main memory access.
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.
Lecture 11: Storage Systems Disk, RAID, Dependability Kai Bu
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.
RAID.
CMPE Database Systems Workshop June 16 Class Meeting
Multiple Platters.
Vladimir Stojanovic & Nicholas Weaver
IT 251 Computer Organization and Architecture
Introduction I/O devices can be characterized by I/O bus connections
CSE 451: Operating Systems Spring 2006 Module 18 Redundant Arrays of Inexpensive Disks (RAID) John Zahorjan Allen Center.
Lecture 13 I/O.
RAID RAID Mukesh N Tekwani
Lecture 28: Reliability Today’s topics: GPU wrap-up Disk basics RAID
UNIT IV RAID.
Mark Zbikowski and Gary Kimura
Storage Systems Disk, RAID, Dependability
Storage Systems Disk, RAID, Dependability
RAID RAID Mukesh N Tekwani April 23, 2019
Presentation transcript:

Lecture 11: Storage Systems Disk, RAID, Dependability Kai Bu

Lab 3 Report due May 28 Lab 4 Demo due May 28 Report due June 04 Exam requirement: in English one written A4 note allowed

1960s – 1980s Computing Revolution

1990 – Information Age

Communication Computation Storage

Communication Computation Storage

Communication Computation Storage requires higher standard of dependability than the rest of the computer

Communication Computation Storage ? requires higher standard of dependability than the rest of the computer

Communication Computation Storage requires higher standard of dependability than the rest of the computer program crash

Communication Computation Storage requires higher standard of dependability than the rest of the computer data loss

Memory Hierarchy

Communication Storage magnetic disks dominate

Preview Disk Disk Array: RAID Dependability: Fault, Error, Failure

Appendix D.1–D.3

let’s start from a single disk

Disk

Disk

Disk Capacity Areal Density =bits/inch 2 =(tracks/inch) x (bits-per-track/inch)

Disk Capacity Areal Density in 2011, the highest density 400 billion bits per square inch Costs per gigabyte between 1983 and 2011, improved by almost a factor of 1,000,000

Disk vs DRAM Cost DRAM >> DISK Access time DRAM << DISK

Disk’s Competitor Flash Memory non-volatile semiconductor memory; same bandwidth as disks; 100 to 1000 times faster; 15 to 25 times higher cost/gigabyte; Wear out limited to 1 million writes Popular in cell phones, but not in desktop and server

Disk Power Power by disk motor ≈Diameter 4.6 x RPM 2.8 x No. of platters RPM: Revolutions Per Minute rotation speed

Disk Power Power by disk motor ≈Diameter 4.6 x RPM 2.8 x No. of platters RPM: Revolutions Per Minute rotation speed Smaller patters, slower rotation, and fewer platters reduce disk motor power

Disk Power

what if one is not enough… disk failure all or nothing

what if one is not enough… disk failure all or nothing

what if one is not enough… disk failure all or nothing

Disk Arrays Disk arrays with redundant disks to tolerate faults If a single disk fails, the lost information is reconstructed from redundant information Striping: simply spreading data over multiple disks RAID: redundant array of inexpensive/independent disks

RAID

RAID 0 JBOD: just a bunch of disks No redundancy No failure tolerated Measuring stick for other RAID levels in terms of cost, performance, and dependability

RAID 1 Mirroring or Shadowing Two copies for every piece of data one logical write = two physical writes 100% capacity/space overhead

RAID 2 Each bit of data word is written to a data disk drive Each data word has its (Hamming Code) ECC word recorded on the ECC disks On read, the ECC code verifies correct data or corrects single disks errors

RAID 3 Data striped over all data disks Parity of a stripe to parity disk Require at least 3 disks to implement

P RAID 3 Even Parity parity bit makes the # of 1 even p = sum(data1) mod 2 Recovery if a disk fails, “subtract” good data from good blocks; what remains is missing data;

RAID 4 Favor small accesses Allows each disk to perform independent reads, using sectors’ own error checking

RAID 5 Distributes the parity info across all disks in the array Removes the bottleneck of a single parity disk as RAID 3 and RAID 4

RAID 6: Row-diagonal Parity RAID-DP Recover from two failures xor row: =r4 diagonal: r1=d1

Double-Failure Recovery

RAID: Further Readings Raid Types – Classifications BytePile.com calculator/raid-0-1.png RAID JetStor

When are disks dependable and when are they not?

Dependability Computer system dependability is the quality of delivered service such that reliance can justifiably be placed on this service.

The service delivered by a system is its observed actual behavior as perceived by other system(s) interacting with this system’s users.

Each module also has an ideal specified behavior, where a service specification is an agreed description of the expected behavior.

Failure A system failure occurs when the actual behavior deviates from the specified behavior.

Error, Fault The failure occurred because of an error, a defect in that module. The cause of an error is a fault. When a fault occurs, it creates a latent error, which becomes effective when it is activated; When the error actually affects the delivered service, a failure occurs.

Fault, Error, Failure A fault creates one or more latent errors Either an effective error is a formerly latent error in that component or it has propagated from another error in that component or from else where A component failure occurs when the error affects the delivered service

Failure Error Fault one or more latent errors activated to be effective affect the delivered service

Categories of Faults by Cause Hardware faults failed devices Design faults usually in software design; occasionally in hardware design; Operation faults mistakes by operations and maintenance personnel; Environmental faults fire, flood, earthquake, power failure, sabotage;

Categories of Faults by Duration Transient faults exist for a limited time and are not recurring; Intermittent faults cause a system to oscillate between faulty and fault-free operation Permanent faults do not correct themselves with the passing of time;

Example: Berkeley’s Tertiary Disk

Example: Tandem

?