I/O Chapter 8. Outline Introduction - 8.1 Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6.

Slides:



Advertisements
Similar presentations
1 Lecture 22: I/O, Disk Systems Todays topics: I/O overview Disk basics RAID Reminder: Assignment 8 due Tue 11/21.
Advertisements

IT253: Computer Organization
Disk Arrays COEN 180. Large Storage Systems Collection of disks to store large amount of data. Performance advantage: Each drive can satisfy only so many.
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.
I/O Management and Disk Scheduling
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.
RAID Oh yes Whats RAID? Redundant Array (of) Independent Disks. A scheme involving multiple disks which replicates data across multiple drives. Methods.
CSE431 Chapter 6A.1Irwin, PSU, 2008 Chapter 6A: Disk Systems Mary Jane Irwin ( ) [Adapted from Computer Organization.
Section 6.2. Record data by magnetizing the binary code on the surface of a disk. Data area is reusable Allows for both sequential and direct access file.
Princess Sumaya Univ. Computer Engineering Dept. Chapter 6:
RAID Redundant Array of Independent Disks
Lecture 21Comp. Arch. Fall 2006 Chapter 8: I/O Systems Adapted from Mary Jane Irwin at Penn State University for Computer Organization and Design, Patterson.
1  1998 Morgan Kaufmann Publishers Interfacing Processors and Peripherals.
CA 714CA Midterm Review. C5 Cache Optimization Reduce miss penalty –Hardware and software Reduce miss rate –Hardware and software Reduce hit time –Hardware.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
CPE 442 io.1 Introduction To Computer Architecture CpE 442 I/O Systems.
Enhanced Availability With RAID CC5493/7493. RAID Redundant Array of Independent Disks RAID is implemented to improve: –IO throughput (speed) and –Availability.
RAID- Redundant Array of Inexpensive Drives. Purpose Provide faster data access and larger storage Provide data redundancy.
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)
CSCE 212 Chapter 8 Storage, Networks, and Other Peripherals Instructor: Jason D. Bakos.
Interfacing Processors and Peripherals Andreas Klappenecker CPSC321 Computer Architecture.
1  1998 Morgan Kaufmann Publishers Chapter 8 Storage, Networks and Other Peripherals.
1 Lecture 26: Storage Systems Topics: Storage Systems (Chapter 6), other innovations Final exam stats:  Highest: 95  Mean: 70, Median: 73  Toughest.
Lecture 3: A Case for RAID (Part 1) Prof. Shahram Ghandeharizadeh Computer Science Department University of Southern California.
S.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
I/0 devices.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
CSE 451: Operating Systems Winter 2010 Module 13 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura.
By : Nabeel Ahmed Superior University Grw Campus.
Computer Organization CS224 Fall 2012 Lesson 51. Measuring I/O Performance  I/O performance depends on l Hardware: CPU, memory, controllers, buses l.
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.
CS 346 – Chapter 10 Mass storage –Advantages? –Disk features –Disk scheduling –Disk formatting –Managing swap space –RAID.
Memory/Storage Architecture Lab Computer Architecture Lecture Storage and Other I/O Topics.
Storage & Peripherals Disks, Networks, and Other Devices.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
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.
Disk Access. DISK STRUCTURE Sector: Smallest unit of data transfer from/to disk; 512B 2/4/8 adjacent sectors transferred together: Blocks Read/write heads.
Redundant Array of Inexpensive Disks aka Redundant Array of Independent Disks (RAID) Modified from CCT slides.
1 (Based on text: David A. Patterson & John L. Hennessy, Computer Organization and Design: The Hardware/Software Interface, 3 rd Ed., Morgan Kaufmann,
Lecture 16: Storage and I/O EEN 312: Processors: Hardware, Software, and Interfacing Department of Electrical and Computer Engineering Spring 2014, Dr.
I/O Computer Organization II 1 Introduction I/O devices can be characterized by – Behavior: input, output, storage – Partner: human or machine – Data rate:
Lecture 35: Chapter 6 Today’s topic –I/O Overview 1.
August 1, 2001Systems Architecture II1 Systems Architecture II (CS ) Lecture 9: I/O Devices and Communication Buses * Jeremy R. Johnson Wednesday,
Computer Organization CS224 Fall 2012 Lessons 47 & 48.
Processor Memory Processor-memory bus I/O Device Bus Adapter I/O Device I/O Device Bus Adapter I/O Device I/O Device Expansion bus I/O Bus.
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 )
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 25 I/O Systems May 2,
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.
I/O Errors 1 Computer Organization II © McQuain RAID Redundant Array of Inexpensive (Independent) Disks – Use multiple smaller disks (c.f.
I/O System Chapter 5 Designed by .VAS.
IT 251 Computer Organization and Architecture
CS 554: Advanced Database System Notes 02: Hardware
Introduction I/O devices can be characterized by I/O bus connections
Lecture 13 I/O.
RAID RAID Mukesh N Tekwani
Lecture 28: Reliability Today’s topics: GPU wrap-up Disk basics RAID
CSE 451: Operating Systems Winter 2009 Module 13 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
Mark Zbikowski and Gary Kimura
Mass-Storage Systems.
CSE 451: Operating Systems Winter 2012 Redundant Arrays of Inexpensive Disks (RAID) and OS structure Mark Zbikowski Gary Kimura 1.
CSC3050 – Computer Architecture
RAID RAID Mukesh N Tekwani April 23, 2019
Presentation transcript:

I/O Chapter 8

Outline Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6

Input / Ouput devices Communicate between human and computer –keyboard, mouse, printer, game controllers, … Store more than what is on processor –hard drive, thumb drive, … Enhanced functionality –music, video, …

Constraints Users intolerant of lost data Unknown (non-standard) devices Slow devices (relatively speaking)

Goals Dependability Expandability

Taxonomy Behavior – –Input (read once) –Output (write once, never read) –Storage (read / write / carries state) Partner –Human or machine on other side? Data rate (speed) –peak data transfer rate

Measures of Performance Response time –latency – time a user must wait for task Bandwidth –I/O operations per unit time –Data transferred per unit time

Outline Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6

Anatomy of a Disk Drive

Vocabulary Head – the device that reads data from a disk Each disk is divided into ________ _______ called _________ Each track is made up of _________ cylinder – volume of all _______ that lie under the heads at a given point on all surfaces nonvolatile – data that remains even when ______ is removed Concentric circles tracks sectors tracks power

Vocabulary seek – the act of positioning the _____ over the correct ________ rotational delay or latency – average latency to rotate disk to put the ______ over the correct _______ transfer time – time required to _________ a block of data disk controller – controls disk accesses head track head sector send / receive

Example 1 - Performance What is the average time to read or write a 512-byte sector for a typical disk rotating at 10,000 RPM? The advertised average seek time is 6 ms, the transfer rate is 50 MB/sec, and the controller overhead is 0.2 ms. Assume that the disk is idle, so that there is no waiting time.

seek time: 6ms rotational delay: ½ rev * 1min / 10,000 rev transfer time: 512 B * 1 sec / 50*1024*1024 B controller overhead = 0.2ms 6ms + 3ms ms + 0.2ms = 9.21ms

Reliability Reliability – measure of a continuously working system Availability – how often, on average, the system is working properly MTTF – Mean Time to Failure MTTR – Mean Time to Repair MTBF – Mean time between failures

Availability Availability – how often, on average, the system is working properly Availability = MTTF / (MTTF + MTTR)

Improving MTTF Fault avoidance Fault tolerance Fault forecasting preventing fault occurrence by construction using redundancy to continue executing in the presence of faults (usually hardware faults) predicting the presence and creation of faults (hardware & software faults)

RAID - Redundant Arrays of Inexpensive Disks Shift from one large disk to several small disks Cheaper, smaller, faster Inherently less reliable Provide redundancy to counteract lower reliability

RAID 0 No redundancy!!! Only a performance increase Striping (interleaving) – allocation of logically sequential blocks to separate disks to increase performance Parallel access controlled by disk controller – computer knows nothing about it.

RAID 1 mirroring – write the identical data to multiple disks Requires twice as many disks as RAID 0 If a disk fails, use the backup copy, move to a working set of mirrored space.

RAID 3 Bit-interleaved parity Store only enough data to recover original Group N blocks Add one bit of parity – xor of all bits. Lost data can be reconstructed by looking at the rest of the bits in the group.

On a write Read all blocks of data in parity group Calculate new parity Write new block Write new parity

RAID 4 More efficient parity update On write: –Read old data –xor with new data –adjust parity –Write parity, Write new data

RAID 5 Rotate parity blocks around system Spread out writing (since parity always written)

Summary RAID 1 and RAID 5 most common 80% of server disks use RAID Repair: –hot swapping – replace disks with power on –Standby spares – spares included in system for immediate reconstruction of data

Outline Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6

Connecting I/O Devices Much slower than processor / memory Support lots of heterogeneous devices

Bus control lines – send / receive commands data lines – transfer data processor-memory bus – fast, small bus connecting DRAM to processor I/O bus – slow, long bus connecting many devices to system through a controller.

Synchrony Synchronous – clock in control line, fixed protocol is relative to clock. Asynchronous – no clock – must coordinate through hand-shaking to determine when data is ready to send / receive. split transaction protocol – bus is released between data request and data response

hand-shaking Series of steps used to coordinate bus transfers. Both parties must acknowledge they are ready before moving to next step. Control lines: ReadReq: proc/device wants to read DataRdy: dev/proc is ready to send data Ack: acknowledge ReadReq or DataRdy

Handshaking protocol ReadReq Data Ack DataRdy AddressData : Response0: Request

Outline Introduction Disk Storage and Dependability – 8.2 Buses and other connectors – 8.4 I/O performance measures – 8.6

Metric Units Memory: GB = 2^30 I/O: GB = 10^9 Be careful when reading specs For this class, we will pretend that all use base-2 units.

Measuring Performance Throughput more important than latency Large database operations (TP – Transaction Processing)

Example 1 Execution time = 100 seconds 90 seconds CPU time, 10 sec I/O time CPU time improves by 50%/yr for 5 years I/O does not improve How much faster is program after 5 years? What percentage of new time is I/O?

New CPU time: 90 / (1.5^5) = 12 seconds CPU improvement: 90/12 = 7.5 speedup Overall improvement: 100/22 = 4.5 speedup Now I/O is 10/22 = 45% of total time

Example 2 System A: –.005 sec per I/O op –4 overlapping I/O ops at a time System B: –.002 sec per I/O op –no overlapping I/O ops Which has the higher throughput?

Throughput: 4 ops / sec = 800 ops/sec Throughput: 1 op / sec = 500 ops / sec