UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

Similar documents
UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering. Computer Architecture ECE 568

High-Performance Storage Systems

CS61C : Machine Structures

CS61C - Machine Structures. Week 7 - Disks. October 10, 2003 John Wawrzynek

CS2410: Computer Architecture. Storage systems. Sangyeun Cho. Computer Science Department University of Pittsburgh

Storage System COSC UCB

CSE325 Principles of Operating Systems. Mass-Storage Systems. David P. Duggan. April 19, 2011

I/O CANNOT BE IGNORED

Chapter 6. Storage and Other I/O Topics

www-inst.eecs.berkeley.edu/~cs61c/

Storage Systems. Storage Systems

I/O CANNOT BE IGNORED

Computer System Architecture

Computer Science 146. Computer Architecture

Page 1. Motivation: Who Cares About I/O? Lecture 5: I/O Introduction: Storage Devices & RAID. I/O Systems. Big Picture: Who cares about CPUs?

Virtual Memory. Reading. Sections 5.4, 5.5, 5.6, 5.8, 5.10 (2) Lecture notes from MKP and S. Yalamanchili

Page 1. Magnetic Disk Purpose Long term, nonvolatile storage Lowest level in the memory hierarchy. Typical Disk Access Time

Topics. Lecture 8: Magnetic Disks

COS 318: Operating Systems. Storage Devices. Vivek Pai Computer Science Department Princeton University

Storage systems. Computer Systems Architecture CMSC 411 Unit 6 Storage Systems. (Hard) Disks. Disk and Tape Technologies. Disks (cont.

Lecture 23: Storage Systems. Topics: disk access, bus design, evaluation metrics, RAID (Sections )

COS 318: Operating Systems. Storage Devices. Jaswinder Pal Singh Computer Science Department Princeton University

COS 318: Operating Systems. Storage Devices. Kai Li Computer Science Department Princeton University

Appendix D: Storage Systems

Database Systems II. Secondary Storage

u Covered: l Management of CPU & concurrency l Management of main memory & virtual memory u Currently --- Management of I/O devices

Storage. CS 3410 Computer System Organization & Programming

CSCI-GA Database Systems Lecture 8: Physical Schema: Storage

UCB CS61C : Machine Structures

CPS104 Computer Organization and Programming Lecture 18: Input-Output. Outline of Today s Lecture. The Big Picture: Where are We Now?

Administrivia. CMSC 411 Computer Systems Architecture Lecture 19 Storage Systems, cont. Disks (cont.) Disks - review

Disks and RAID. CS 4410 Operating Systems. [R. Agarwal, L. Alvisi, A. Bracy, E. Sirer, R. Van Renesse]

Concepts Introduced. I/O Cannot Be Ignored. Typical Collection of I/O Devices. I/O Issues

COMP283-Lecture 3 Applied Database Management

Storage Systems : Disks and SSDs. Manu Awasthi CASS 2018

I/O, Disks, and RAID Yi Shi Fall Xi an Jiaotong University

Lecture 23: I/O Redundant Arrays of Inexpensive Disks Professor Randy H. Katz Computer Science 252 Spring 1996

A track on a magnetic disk is a concentric rings where data is stored.

Lecture for Storage System

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Computer Science 61C Spring Friedland and Weaver. Input/Output

Disks. Storage Technology. Vera Goebel Thomas Plagemann. Department of Informatics University of Oslo

Chapter 6 - External Memory

Secondary storage. CS 537 Lecture 11 Secondary Storage. Disk trends. Another trip down memory lane

Mass-Storage Structure

Today: Coda, xfs! Brief overview of other file systems. Distributed File System Requirements!

BBM371- Data Management. Lecture 2: Storage Devices

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

CSE 153 Design of Operating Systems

CSE 153 Design of Operating Systems Fall 2018

Introduction Disks RAID Tertiary storage. Mass Storage. CMSC 420, York College. November 21, 2006

CS143: Disks and Files

Chapter 12: Mass-Storage

Chapter 12: Mass-Storage

Chapter 6 Storage and Other I/O Topics

CHAPTER 12: MASS-STORAGE SYSTEMS (A) By I-Chen Lin Textbook: Operating System Concepts 9th Ed.

Storage Technologies and the Memory Hierarchy

Computer Architecture 计算机体系结构. Lecture 6. Data Storage and I/O 第六讲 数据存储和输入输出. Chao Li, PhD. 李超博士

Session: Hardware Topic: Disks. Daniel Chang. COP 3502 Introduction to Computer Science. Lecture. Copyright August 2004, Daniel Chang

Che-Wei Chang Department of Computer Science and Information Engineering, Chang Gung University

Storage. Hwansoo Han

Where Have We Been? Ch. 6 Memory Technology

CS 201 The Memory Hierarchy. Gerson Robboy Portland State University

Computer Organization and Structure. Bing-Yu Chen National Taiwan University

Chapter 12: Mass-Storage

Lecture: Storage, GPUs. Topics: disks, RAID, reliability, GPUs (Appendix D, Ch 4)

Chapter 6. Storage & Other I/O

ECE331: Hardware Organization and Design

CSE 451: Operating Systems Spring Module 12 Secondary Storage

Lecture 18: Memory Systems. Spring 2018 Jason Tang

Module 1: Basics and Background Lecture 4: Memory and Disk Accesses. The Lecture Contains: Memory organisation. Memory hierarchy. Disks.

Readings. Storage Hierarchy III: I/O System. I/O (Disk) Performance. I/O Device Characteristics. often boring, but still quite important

Contents. Memory System Overview Cache Memory. Internal Memory. Virtual Memory. Memory Hierarchy. Registers In CPU Internal or Main memory

CSCI-UA.0201 Computer Systems Organization Memory Hierarchy

Mass-Storage Structure

Storage Devices for Database Systems

Computer Architecture Computer Science & Engineering. Chapter 6. Storage and Other I/O Topics BK TP.HCM

CMSC 611: Advanced Computer Architecture

CSE 451: Operating Systems Spring Module 12 Secondary Storage. Steve Gribble

Today: Secondary Storage! Typical Disk Parameters!

Computer Science 146. Computer Architecture

CS152 Computer Architecture and Engineering Lecture 19: I/O Systems

Lecture 13. Storage, Network and Other Peripherals

Monday, May 4, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes

Computer Systems. Memory Hierarchy. Han, Hwansoo

Chapter 6. Storage and Other I/O Topics. ICE3003: Computer Architecture Fall 2012 Euiseong Seo

Wednesday, April 25, Discs RAID: Introduction Error detection and correction Error detection: Simple parity Error correction: Hamming Codes

Chapter 6. I/O issues

UNIT 2 Data Center Environment

NAND Flash-based Storage. Jin-Soo Kim Computer Systems Laboratory Sungkyunkwan University

CS 471 Operating Systems. Yue Cheng. George Mason University Fall 2017

Data Storage and Disk Structure

CS3600 SYSTEMS AND NETWORKS

Adapted from instructor s supplementary material from Computer. Patterson & Hennessy, 2008, MK]

CENG3420 Lecture 08: Memory Organization

Chapter 6. Storage and Other I/O Topics

Introduction to I/O and Disk Management

Introduction to I/O and Disk Management

V. Mass Storage Systems

Transcription:

UNIVERSITY OF MASSACHUSETTS Dept. of Electrical & Computer Engineering Computer Architecture ECE 568 Part 6 Input/Output Israel Koren ECE568/Koren Part.6. Motivation: Why Care About I/O? CPU Performance: almost 5% per year I/O system performance limited by mechanical delays (e.g., disk I/O) < % per year (IO per sec) Amdahl's Law: system speed-up limited by the slowest part I/O bottleneck Diminishing fraction of time in CPU Diminishing value of faster CPUs ECE568/Koren Part.6.2 Page

I/O Systems Processor interrupts Cache Memory - I/O Bus Main Memory I/O I/O I/O Disks: Long-term, nonvolatile storage Large, inexpensive, also serve as slow level in the storage hierarchy ECE568/Koren Part.6.3 Disk Disk Graphics Network Disk Terminology Arm Head Sector Inner Track Outer Track Actuator Platter Several platters, with information recorded magnetically on both surfaces (usually) Bits recorded sequentially in tracks, divided into sectors (e.g., 52 Bytes) Actuator moves head (end of arm, /surface) over track ( seek ), select surface, wait for sector rotate under head, then read or write Cylinder : all tracks under heads ECE568/Koren Part.6.4 Page 2

Disk Device Performance Outer Track Inner Track Sector Spindle Head Arm Platter Actuator Disk Latency = Seek Time + Rotation Time + Transfer Time + Overhead Seek Time: depends on number of tracks arm moves Rotation Time: depends on speed disk rotates, how far sector is from head s current position Transfer Time: depends on data rate (bandwidth) of disk (bit density), size of request ECE568/Koren Part.6.5 Disk Device Performance Rotation Time: Avg. distance to sector from head /2 time of a rotation 72 Revolutions Per Minute 2 Rev/sec revolution = / 2 sec 8.33 milliseconds /2 rotation (revolution) 4.7 ms Seek Time: Average number of tracks arm moves Sum all possible seek distances from all possible tracks / Total_#_ops» Assumes random seek distance Disk industry standard benchmark j i Typical: ~8 ms Transfer rate -4 MByte/sec Capacity: s Gbytes to TeraBytes Quadruples every 2 years ECE568/Koren Part.6.6 Page 3

Track Example: Barracuda 8 Track Buffer Arm Head Sector Cylinder Platter 8.6 GB, 3.5 inch disk 2 platters, 24 surfaces 24,247 cylinders 7,2 RPM; (4.2 ms avg. latency) 7.4 ms avg. seek 65 MB/s. ms controller time Calculate time to read 64 KB (28 sectors) using specs Disk latency = avg. seek time + avg. rotational delay + transfer time + controller overhead = 7.4 ms +.5 * /(72 RPM) + 64 KB/(65 MB/s) +. ms =7.4 +4.2 +. +. ms =2.7 ms ECE568/Koren Part.6.7 source: www.seagate.com Disk Performance Example Recalculated Calculate again using /3 quoted seek time (not random, mostly to adjacent tracks), 3/4 of internal bandwidth (check bits and gaps between sectors) Disk latency = average seek time + average rotational delay + transfer time + controller overhead = (.33 * 7.4 ms) +.5 * /(72 RPM) + 64 KB / (.75 * 65 MB/s) +. ms = 2.5 ms +.5 /(72 RPM/(6ms/M)) + 64 KB / (47 KB/ms) +. ms = 2.5 + 4.2 +.4 +. ms = 8.2 ms (64% of 2.7) ECE568/Koren Part.6.8 Page 4

Large Arrays of Disks Servers and data-centers require large storage capacity but large arrays of disks have low reliability Reliability_disk = exp(-λt) where λ is a constant failure rate MTTF = Mean_Time_to_Failure = / λ A single disk has MTTF=5, hours 6 years Reliability of N disks = [exp(- λt)}^n = exp(-nλt) MTTF_array = / N λ For N=7 disks: 5,/7= 7 hours month Arrays (without redundancy) too unreliable ECE568/Koren Part.6.9 RAID Redundant Arrays of Independent Disks Files are "striped" across multiple disks with redundant data added Upon failure: Contents reconstructed from data redundantly stored in the array Redundancy yields high data availability service still provided to user, even if some components fail but Capacity penalty to store redundant info Performance penalty to update redundant info ECE568/Koren Part.6. Page 5

RAID : Disk Mirroring/Shadowing Each disk is fully duplicated onto its mirror Very high availability Bandwidth sacrifice on write: Logical write = two physical writes Reads may be optimized Most expensive solution: % capacity overhead (RAID 2 not interesting, so skip) ECE568/Koren Part.6. RAID 3: Parity Disk P Striped physical record P = sum mod 2 of other disks (parity) If disk fails, subtract P from sum of other disks to find missing information Capacity overhead Wider arrays reduce capacity overhead, but decrease reliability ECE568/Koren Part.6.2 Page 6

Inspiration for RAID 4 RAID 3 relies on parity disk to detect and correct errors on Read Must read from all disks every time But every sector has an error check field Rely on error check field to catch errors on read, not on the parity disk Use parity disk only for complete disk failure ECE568/Koren Part.6.3 Insides of of five disks RAID 4: High I/O Rate 2 3 D D D2 D3 P D4 D5 D6 D7 P 4 Increasing Logical Disk Address D8 D9 D D P Example: small read D & D5, large write D2-D5 ECE568/Koren Part.6.4 D2 D3 D4 D5 D6 D7 D8 D9 D2 D2 D22 D23 P... Disk. Columns.. P P Stripe Page 7

RAID 5: High I/O Rate Interleaved Parity 2 3 4 Independent writes possible because of of interleaved parity D D D2 D3 P D4 D5 D6 P D7 D8 D9 P D D Increasing Logical Disk Addresses Example: write to D & D5 uses disks,, 3 and 4 ECE568/Koren Part.6.5 D2 P D3 D4 D5 P D6 D7 D8 D9 D2 D2 D22 D23 P.... Disk. Columns.... System Availability: Orthogonal RAIDs Array RAID Group: data redundancy Common Support Components: fans, power supplies, controller, cables ECE568/Koren Part.6.6 Page 8

Summary: RAID Techniques Disk Mirroring, Shadowing (RAID ) Each disk is fully duplicated Logical write = two physical writes % capacity overhead High I/O Rate Parity Array (RAID 5) Interleaved parity blocks Independent reads and writes Logical write = 2 reads + 2 writes ECE568/Koren Part.6.7 Solid state drives- flash technology Organization similar to DRAM but basic cell is different ECE568/Koren Part.6.8 Page 9

ECE568/Koren Part.6.9 Solid state drives Most are currently based on NAND flash Read blocks (4K byte) Write erasure (multiple blocks) slower than Read SLC single layer cell; MLC multi-level cell SLC low density, read ~25µs write ~25µs; write endurance ~, cycles TLC (Triple level) high density, read ~75µs; write ~µs; write endurance ~, cycles Wear leveling re-mapping of the contents on every write avoid the high frequency of re-writes to certain blocks Random bit errors due the noisy environment in the chip and the weak signals from the cells Error correction (for transient and permanent bit failures) BCH code (a cyclic code based on finite-fields), e.g., can correct up to 55 bit errors in a 52 byte sector Solid-state vs. hard disk drives Start-up time Access latency Transfer rate Cost Power consumption Capacity Reliability Environment impact ECE568/Koren Part.6.2 Solid-state Drive Instantaneous.ms or less, random access -6 MB/sec $.37/GB About 5-% 52 GB and up Power outage may cause damage No sensitive and less noisy Hard Disk Drive Spin-up 3-2 msec, varies with relative position About 5 MB/sec $.5-./GB.35 2Watt 8 TB Mechanical failures, unpowered: long lifetime Sensitive to shocks and temperature Page