High-Performance Storage Systems

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

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

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?

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

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

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

CS61C : Machine Structures

Topics. Lecture 8: Magnetic Disks

CS162 Operating Systems and Systems Programming Lecture 17. Disk Management and File Systems

I/O CANNOT BE IGNORED

I/O CANNOT BE IGNORED

Computer Science 146. Computer Architecture

CS162 Operating Systems and Systems Programming Lecture 17. Disk Management and File Systems

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

Recap: Making address translation practical: TLB. CS152 Computer Architecture and Engineering Lecture 24. Busses (continued) Queueing Theory Disk IO

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

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

Computer System Architecture

Storage Systems. Storage Systems

Appendix D: Storage Systems

CMSC 611: Advanced Computer Architecture

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

Chapter 6. Storage and Other I/O Topics

Storage System COSC UCB

I/O Systems. EECC551 - Shaaban. Processor. Cache. Memory - I/O Bus. Main Memory. I/O Controller. I/O Controller. I/O Controller. Graphics.

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

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

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

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

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

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

UCB CS61C : Machine Structures

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

Introduction to I/O and Disk Management

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

Introduction to I/O and Disk Management

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

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

CMSC 424 Database design Lecture 12 Storage. Mihai Pop

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

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

Introduction to Input and Output

BBM371- Data Management. Lecture 2: Storage Devices

CSE 153 Design of Operating Systems

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

Lecture for Storage System

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

CSE 451: Operating Systems Spring Module 12 Secondary Storage

Review. EECS 252 Graduate Computer Architecture. Lec 18 Storage. Introduction to Queueing Theory. Deriving Little s Law

Components of the Virtual Memory System

CSE 451: Operating Systems Winter Secondary Storage. Steve Gribble. Secondary storage

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

CSE 153 Design of Operating Systems Fall 2018

CS3600 SYSTEMS AND NETWORKS

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

Magnetic Disks. Tore Brox-Larsen Including material developed by Pål Halvorsen, University of Oslo (primarily) Kai Li, Princeton University

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

Today: Secondary Storage! Typical Disk Parameters!

SCSI vs. ATA More than an interface. Dave Anderson, Jim Dykes, Erik Riedel Seagate Research April 2003

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

Outline. EEL-4713 Computer Architecture I/O Systems. I/O System Design Issues. The Big Picture: Where are We Now? I/O Performance Measures

Lecture 23. Finish-up buses Storage

CS152 Computer Architecture and Engineering Lecture 24. I/O and Storage Systems. April 29, 2004 John Kubiatowicz (

Lecture 12: I/O: Metrics, A Little Queuing Theory, and Busses Professor David A. Patterson Computer Science 252 Fall 1996

ECE232: Hardware Organization and Design

Chapter 6 Storage and Other I/O Topics

Chapter 6. Storage & Other I/O

Lecture 13. Storage, Network and Other Peripherals

The Big Picture: Where are We Now? CS152 Computer Architecture and Engineering Lecture 24. I/O Systems II

Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto

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

Recap of Networking Intro. Lecture #28 Networking & Disks Protocol Family Concept. Protocol for Networks of Networks?

Storage. CS 3410 Computer System Organization & Programming

Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto

Reading and References. Input / Output. Why Input and Output? A typical organization. CSE 410, Spring 2004 Computer Systems

October 10 th, 2015 Prof. John Kubiatowicz

Storage Technologies and the Memory Hierarchy

Mass-Storage Structure

Chapter 10: Mass-Storage Systems. Operating System Concepts 9 th Edition

Chapter 12: Mass-Storage

Storage Devices for Database Systems

CS 261 Fall Mike Lam, Professor. Memory

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

Ch 11: Storage and File Structure

Quiz for Chapter 6 Storage and Other I/O Topics 3.10

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

CS 33. Memory Hierarchy I. CS33 Intro to Computer Systems XVI 1 Copyright 2016 Thomas W. Doeppner. All rights reserved.

CS162 Operating Systems and Systems Programming Lecture 16. I/O Systems. Page 1

CSCI-UA.0201 Computer Systems Organization Memory Hierarchy

Database Systems II. Secondary Storage

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

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

Introduction to I/O. April 30, Howard Huang 1

CISC 7310X. C11: Mass Storage. Hui Chen Department of Computer & Information Science CUNY Brooklyn College. 4/19/2018 CUNY Brooklyn College

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

UNIT 2 Data Center Environment

Where Have We Been? Ch. 6 Memory Technology

Storage. Hwansoo Han

Chapter 9: Peripheral Devices: Magnetic Disks

Hard Disk Drives. Nima Honarmand (Based on slides by Prof. Andrea Arpaci-Dusseau)

Transcription:

High-Performance Storage Systems

I/O Systems Processor interrupts Cache Memory - I/O Bus Main Memory I/O Controller I/O Controller I/O Controller Disk Disk Graphics Network 2

Storage Technology Drivers Driven by the prevailing computing paradigm 95s: migration from batch to on-line processing 99s: migration to ubiquitous computing computers in phones, books, cars, video cameras, nationwide fiber optical network with wireless tails Today: digital media everywhere Digital forms of voice, picture, and video Data from scientific computing such as earthquake simulation, high energy physical experiments, bioinformatics In forms of personal storages, web server, peer-to-peer storage, grid storage Effects on storage industry: Embedded storage smaller, cheaper, more reliable, lower power Data utilities high capacity, hierarchically managed storage 3

Magnetic Disks Purpose: Long-term, nonvolatile storage Large, inexpensive, slow level in the storage hierarchy Characteristics: Seek Time (~8 ms avg) positional latency rotational latency Transfer rate -4 MByte/sec Blocks Capacity Gigabytes Quadruples every 2 years Head Track Sector Cylinder Platter 72 RPM = 2 RPS => 8 ms per rev ave rot latency = 4 ms 28 sectors per track => 25 ms per sector KB per sector => 6 MB / s Response time = Queue + Controller + Seek + Rot + Xfer Service time 4

Photo of Disk Head, Arm, Actuator Spindle Arm Head Actuator Platters (2) 5

Seagate Barracuda 8 Track Buffer { per access + per byte Track Sector Cylinder Arm Head Platter Latency = Queuing Time + Controller time + Seek Time + Rotation Time + Size / Bandwidth source: wwwseagatecom 86 GB, 35 inch disk 2 platters, 24 surfaces 24,247 cylinders 7,2 RPM; (42 ms avg latency) 74/82 ms avg seek (r/w) 64 to 35 MB/s (internal) ms controller time 3 watts (idle) 6

Disk Performance Factors Actual disk seek and rotation time depends on the current head position Seek time: how far is the head to the track? Disk industry standard: assume random position of the head, eg, average 8ms seek time In practice: disk accesses have locality Rotation time: how far is the head to sector? Can safely assume ½ of rotation time (disk keeps rotating) Revolutions Per Minute 6667 Rev/sec revolution = / 6667 sec 6 ms /2 rotation (revolution) 3 ms Data Transfer time: What are the rotation speed, disk density, and sectors per transfer? RPM a track of data per 6 ms Outer tracks are longer and may support higher bandwidth 7

Disk Performance Example Rule of Thumb: Observed average seek time is typically about /4 to /3 of quoted seek time (ie, 3X-4X faster) Rule of Thumb: disks deliver about 3/4 of internal media rate (3X slower) for data Calculate time to read 64 KB for UltraStar 72, using /3 quoted 74ms seek time, 3/4 of 64MB/s internal outer track bandwidth Disk latency = average seek time + average rotational delay + transfer time + controller overhead = (33 * 74 ms) + 5 * /(72 RPM/(6ms/M)) + 64 KB / (75 * 65 MB/s) + ms = 25 ms + 5 /(72 RPM/(6ms/M)) + 64 KB / (47 KB/ms) + ms = 25 + 42 + 4 + ms = 82 ms (64% of 27) 8

Disk Characteristics in 2 Disk diameter (inches) Formatted data capacity (GB) Seagate Cheetah ST7344LC Ultra6 SCSI IBM Travelstar 32GH DJSA - 232 ATA-4 IBM GB Microdrive DSCM- 35 25 734 32 Cylinders 4, 2,664 7,67 Disks 2 4 Recording Surfaces (Heads) 24 8 2 Bytes per sector 52 to 496 52 52 Avg Sectors per track (52 byte) Max areal density(gbit/sqin) ~ 424 ~ 36 ~ 4 6 4 52 $828 $447 $435 9

Disk Performance/Cost Trends Capacity + %/year (2X / yrs) Transfer rate (BW) + 4%/year (2X / 2 yrs) Rotation + Seek time 8%/ year (/2 in yrs) MB/$ > %/year (2X / yrs) Fewer chips + areal density Seagate 2GB Internal Hard Drive ST3226A, $5 at staple (list price) Maxtor 2GB 8MB Cache Hard Drive $5984 after rebate at OfficeDepot IBM Microdrive

Disk System Performance System-level Metrics: Response Time Throughput Response time = Queue + Controller + service time ( ) 3 2 Response Time (ms) % Throughput (% total BW) % Queue Proc IOC Device Response time = Queue + Device Service time

How About Queuing Time? Queuing time can be the most significant one in disk response time Arrivals Departures More interested in long term, steady state than in startup => Arrivals = Departures Little s Law: Mean number tasks in system = arrival rate x mean reponse time Applies to any system in equilibrium, as long as nothing in black box is creating or destroying tasks 2

A Little Queuing Theory: Notation Queue System server Proc IOC Device Queuing models assume state of equilibrium: input rate = output rate Notation: r average number of arriving customers/second T ser average time to service a customer (tradtionally µ= / T ser ) u server utilization (): u = r x T ser (or u = r / µ ) T q average time/customer in queue =T s er x u / ( u) T sys average time/customer in system: T sys = T q + T ser L q average length of queue: L q = r x T q L sys average length of system: L sys = r x T sys Little s Law: Length server = rate x Time server (Mean number customers = arrival rate x mean service time) 3

A Little Queuing Theory: Example Processor sends 5 x 8KB disk I/Os per sec, requests & service exponentially distrib, avg disk service = 2 ms On average, how is the disk utilized? What is the number of requests in the queue? What is the average time a spent in the queue? What is the average response time for a disk request? Notation: r average number of arriving customers/second= 5 T ser average time to service a customer= 2 ms u server utilization (): u = r x T ser = 5/s x 2s = 6 T q average time/customer in queue = T s er x u / ( u) = 2x 6/(-6) = 2x5 = 8 ms T sys L q average time/customer in system: T sys =T q +T ser = 3 ms average length of queue:l q = r x T q = 5/s x 8s = 9 requests in queue L sys average # tasks in system : L sys = r x T sys = 5/s x 3s = 5 Look into textbook when you need to work on I/O 4

How to build Large Storage: Disk Array Array Controller String Controller String Controller String Controller String Controller String Controller String Controller Not practical to build large disks 5

Array Reliability Reliability of N disks = Reliability of Disk N 5, Hours 7 disks = 7 hours Disk system MTTF: Drops from 6 years to month! (MTTF: Mean Time to Failure) Arrays (without redundancy) too unreliable to be useful! Solution: RAID -- Redundant Arrays of Inexpensive Disks 6

RAID: The Idea logical record Striped physical records P contains sum of other disks per stripe mod 2 ( parity ) If disk fails, subtract P from sum of other disks to find missing information P RAID-3 shown 7

RAID 4: High I/O Rate Parity Insides of 5 disks D D D2 D3 P D4 D5 D6 D7 P Increasing Logical Disk Address Example: small read D & D5, large write D2-D5 D8 D9 D D P D2 D3 D4 D5 D6 D7 D8 D9 D2 D2 D22 D23 P Disk Columns P P Stripe 8

RAID 5: High I/O Rate Interleaved Parity Independent writes possible because of of interleaved parity Example: write to D, D5 uses disks,, 3, 4 D D D2 D3 P D4 D5 D6 P D7 D8 D9 P D D D2 P D3 D4 D5 P D6 D7 D8 D9 D2 D2 D22 D23 P Disk Columns Increasing Logical Disk Addresses No disk hot spot! 9

Future Storage Trends Disks: Extraodinary advance in capacity/drive, $/GB Currently 7 Gbit/sq inch; can continue past Gbit/sq inch? Bandwidth, seek time not keeping up: 35 inch form factor makes sense? 25 inch form factor in near future? inch form factor in long term? Tapes Old technique, no investment in innovation Are they already dead? What is a tapeless backup system? Other Storage CD/DVD Compact Flash, USB key storage, MRAM 2