CS61C L40 I/O: Disks (1) Ho, Fall 2004 © UCB TA Casey Ho inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 39 I/O : Disks 2005-4-29 Microsoft.

Slides:



Advertisements
Similar presentations
IT253: Computer Organization
Advertisements

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.
Faculty of Information Technology Department of Computer Science Computer Organization Chapter 7 External Memory Mohammad Sharaf.
Magnetic Disk Magnetic disks are the foundation of external memory on virtually all computer systems. A disk is a circular platter constructed of.
CS61C L13 I/O © UC Regents 1 CS 161 Chapter 8 - I/O Lecture 17.
CSCE430/830 Computer Architecture
CPE 442 io.1 Introduction To Computer Architecture CpE 442 I/O Systems.
CSCE 212 Chapter 8 Storage, Networks, and Other Peripherals Instructor: Jason D. Bakos.
RAID Technology. Use Arrays of Small Disks? 14” 10”5.25”3.5” Disk Array: 1 disk design Conventional: 4 disk designs Low End High End Katz and Patterson.
CS 430 – Computer Architecture Disks
I/O Systems Processor Cache Memory - I/O Bus Main Memory I/O Controller Disk I/O Controller I/O Controller Graphics Network interrupts.
CS61C L40 Performance I (1) Garcia © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
CS61C L26 RAID & Performance (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS61C L38 Disks (1) Garcia, Spring 2007 © UCB The enabling power of iPod  What can you do with it? View medical images. Record flight data. Watch videos.
CS 61C L27 RAID and Performance (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #27: RAID & Performance.
Disk Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
Computer ArchitectureFall 2007 © November 28, 2007 Karem A. Sakallah Lecture 24 Disk IO and RAID CS : Computer Architecture.
CS61C L16 Disks © UC Regents 1 CS61C - Machine Structures Lecture 16 - Disks October 20, 2000 David Patterson
Inst.eecs.berkeley.edu/~cs61c UCB CS61C : Machine Structures Lecture 37 – Disks The ST506 was their first drive in 1979 (shown here), weighed.
1  1998 Morgan Kaufmann Publishers Chapter 8 Storage, Networks and Other Peripherals.
CS61C L37 Disks (1) Garcia, Fall 2006 © UCB Lecturer SOE Dan Garcia inst.eecs.berkeley.edu/~cs61c UC Berkeley CS61C : Machine.
CS 61C L26 Disks & Networks (1) A Carle, Summer 2006 © UCB inst.eecs.berkeley.edu/~cs61c/su06 CS61C : Machine Structures Lecture #26: Disks & Networks.
First magnetic disks, the IBM 305 RAMAC (2 units shown) introduced in One platter shown top right. A RAMAC stored 5 million characters on inch.
CS61C L40 I/O: Disks (1) Garcia, Fall 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures.
Computer ArchitectureFall 2008 © November 12, 2007 Nael Abu-Ghazaleh Lecture 24 Disk IO.
CS61C L28 Networks & Disks (1) Beamer, Summer 2007 © UCB Scott Beamer, Instructor inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #28.
Disk Technologies. Magnetic Disks Purpose: – Long-term, nonvolatile, inexpensive storage for files – Large, inexpensive, slow level in the memory hierarchy.
Cs 61C L15 Disks.1 Patterson Spring 99 ©UCB CS61C Anatomy of I/O Devices: Magnetic Disks Lecture 15 March 10, 1999 Dave Patterson (http.cs.berkeley.edu/~patterson)
S.1 Review: Major Components of a Computer Processor Control Datapath Memory Devices Input Output Cache Main Memory Secondary Memory (Disk)
12/3/2004EE 42 fall 2004 lecture 391 Lecture #39: Magnetic memory storage Last lecture: –Dynamic Ram –E 2 memory This lecture: –Future memory technologies.
DAP Fall.‘00 ©UCB 1 Storage Devices and RAID Professor David A. Patterson Computer Science 252 Fall 2000.
CS252/Patterson Lec 5.1 1/31/01 CS252 Graduate Computer Architecture Lecture 5: I/O Introduction: Storage Devices & RAID January 31, 2001 Prof. David A.
Secondary Storage CSCI 444/544 Operating Systems Fall 2008.
CS 61C L41 I/O Disks (1) Garcia, Spring 2004 © UCB Lecturer PSOE Dan Garcia inst.eecs.berkeley.edu/~cs61c CS61C : Machine.
CS61C L25 Input/Output, Networks II, Disks (1) Garcia, Fall 2005 © UCB Lecturer PSOE, new dad Dan Garcia inst.eecs.berkeley.edu/~cs61c.
CS252/Culler Lec 6.1 2/7/02 CS252 Graduate Computer Architecture I/O Introduction: Storage Devices & RAID Jason Hill.
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
CS 61C: Great Ideas in Computer Architecture (Machine Structures) Lecture 39: IO Disks Instructor: Dan Garcia 1.
Redundant Array of Inexpensive Disks (RAID). Redundant Arrays of Disks Files are "striped" across multiple spindles Redundancy yields high data availability.
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.
Lecture 4 1 Reliability vs Availability Reliability: Is anything broken? Availability: Is the system still available to the user?
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
RAID Storage EEL4768, Fall 2009 Dr. Jun Wang Slides Prepared based on D&P Computer Architecture textbook, etc.
CPE 631: Storage Electrical and Computer Engineering University of Alabama in Huntsville Aleksandar Milenkovic
1 IKI20210 Pengantar Organisasi Komputer Kuliah No. 21: Peripheral 29 Nopember 2002 Bobby Nazief Johny Moningka
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 Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
Csci 136 Computer Architecture II – IO and Storage Systems Xiuzhen Cheng
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
COSC 6340: Disks 1 Disks and Files DBMS stores information on (“hard”) disks. This has major implications for DBMS design! » READ: transfer data from disk.
Mohamed Younis CMCS 411, Computer Architecture 1 CMCS Computer Architecture Lecture 25 I/O Systems May 2,
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.
1 Components of the Virtual Memory System  Arrows indicate what happens on a lw virtual address data physical address TLB page table memory cache disk.
CMSC 611: Advanced Computer Architecture I/O & Storage Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted.
Storage HDD, SSD and RAID.
Hardware Technology Trends and Database Opportunities
Module: Storage Systems
Vladimir Stojanovic & Nicholas Weaver
IT 251 Computer Organization and Architecture
Disks and Files DBMS stores information on (“hard”) disks.
CS61C : Machine Structures Lecture 7. 2
Lecture 13 I/O.
Lecture 21: Storage Systems
Practical Issues for Commercial Networks
Presentation transcript:

CS61C L40 I/O: Disks (1) Ho, Fall 2004 © UCB TA Casey Ho inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 39 I/O : Disks Microsoft rolled out a 64 bit version of its Windows operating systems on Monday. As compared with existing 32-bit versions:64-bit Windows will handle 16 terabytes of virtual memory, as compared to 4 GB for 32-bit Windows. System cache size jumps from 1 GB to 1 TB, and paging-file size increases from 16 TB to 512 TB.

CS61C L40 I/O: Disks (2) Ho, Fall 2004 © UCB Protocol Family Concept Message TH TH THTH Actual Physical MessageTH TH Actual Logical

CS61C L40 I/O: Disks (3) Ho, Fall 2004 © UCB Protocol Family Concept Key to protocol families is that communication occurs logically at the same level of the protocol, called peer-to-peer… …but is implemented via services at the next lower level Encapsulation: carry higher level information within lower level “envelope” Fragmentation: break packet into multiple smaller packets and reassemble

CS61C L40 I/O: Disks (4) Ho, Fall 2004 © UCB Protocol for Network of Networks Transmission Control Protocol/Internet Protocol (TCP/IP) This protocol family is the basis of the Internet, a WAN protocol IP makes best effort to deliver TCP guarantees delivery TCP/IP so popular it is used even when communicating locally: even across homogeneous LAN

CS61C L40 I/O: Disks (5) Ho, Fall 2004 © UCB Message TCP/IP packet, Ethernet packet, protocols Application sends message TCP data TCP Header IP Header IP Data EH Ethernet Hdr TCP breaks into 64KiB segments, adds 20B header IP adds 20B header, sends to network If Ethernet, broken into 1500B packets with headers, trailers (24B) All Headers, trailers have length field, destination,...

CS61C L40 I/O: Disks (6) Ho, Fall 2004 © UCB Overhead vs. Bandwidth Networks are typically advertised using peak bandwidth of network link: e.g., 100 Mbits/sec Ethernet (“100 base T”) Software overhead to put message into network or get message out of network often limits useful bandwidth Assume overhead to send and receive = 320 microseconds (  s), want to send 1000 Bytes over “100 Mbit/s” Ethernet Network transmission time: 1000Bx8b/B /100Mb/s = 8000b / (100b/  s) = 80  s Effective bandwidth: 8000b/(320+80)  s = 20 Mb/s

CS61C L40 I/O: Disks (7) Ho, Fall 2004 © UCB Review Protocol suites allow heterogeneous networking Another form of principle of abstraction Protocols  operation in presence of failures Standardization key for LAN, WAN

CS61C L40 I/O: Disks (8) Ho, Fall 2004 © UCB Magnetic Disks Purpose: Long-term, nonvolatile, inexpensive storage for files Large, inexpensive, slow level in the memory hierarchy (discuss later) Processor (active) Computer Control (“brain”) Datapath (“brawn”) Memory (passive) (where programs, data live when running) Devices Input Output Keyboard, Mouse Display, Printer Disk, Network

CS61C L40 I/O: Disks (9) Ho, Fall 2004 © UCB Photo of Disk Head, Arm, Actuator Actuator Arm Head Platters (12) { Spindle

CS61C L40 I/O: Disks (10) Ho, Fall 2004 © UCB Disk Device Terminology Several platters, with information recorded magnetically on both surfaces (usually) Actuator moves head (end of arm) over track (“seek”), wait for sector rotate under head, then read or write Bits recorded in tracks, which in turn divided into sectors (e.g., 512 Bytes) Platter Outer Track Inner Track Sector Actuator HeadArm

CS61C L40 I/O: Disks (11) Ho, Fall 2004 © UCB Disk Device Performance Platter Arm Actuator HeadSector Inner Track Outer Track Disk Latency = Seek Time + Rotation Time + Transfer Time + Controller Overhead Seek Time? depends no. tracks move arm, seek speed of disk Rotation Time? depends on speed disk rotates, how far sector is from head Transfer Time? depends on data rate (bandwidth) of disk (bit density), size of request Controller Spindle

CS61C L40 I/O: Disks (12) Ho, Fall 2004 © UCB Data Rate: Inner vs. Outer Tracks To keep things simple, originally same # of sectors/track Since outer track longer, lower bits per inch Competition decided to keep bits/inch (BPI) high for all tracks (“constant bit density”) More capacity per disk More sectors per track towards edge Since disk spins at constant speed, outer tracks have faster data rate Bandwidth outer track 1.7X inner track!

CS61C L40 I/O: Disks (13) Ho, Fall 2004 © UCB Disk Performance Model /Trends Capacity : + 100% / year (2X / 1.0 yrs) Over time, grown so fast that # of platters has reduced (some even use only 1 now!) Transfer rate (BW) : + 40%/yr (2X / 2 yrs) Rotation+Seek time : – 8%/yr (1/2 in 10 yrs) Areal Density Bits recorded along a track: Bits/Inch (BPI) # of tracks per surface: Tracks/Inch (TPI) We care about bit density per unit area Bits/Inch 2 Called Areal Density = BPI x TPI MB/$: > 100%/year (2X / 1.0 yrs) Fewer chips + areal density

CS61C L40 I/O: Disks (14) Ho, Fall 2004 © UCB Disk History (IBM) Data density Mibit/sq. in. Capacity of Unit Shown Mibytes 1973: 1. 7 Mibit/sq. in 0.14 GiBytes 1979: 7. 7 Mibit/sq. in 2.3 GiBytes source: New York Times, 2/23/98, page C3, “Makers of disk drives crowd even more data into even smaller spaces”

CS61C L40 I/O: Disks (15) Ho, Fall 2004 © UCB Disk History 1989: 63 Mibit/sq. in 60 GiBytes 1997: 1450 Mibit/sq. in 2.3 GiBytes source: New York Times, 2/23/98, page C3, “Makers of disk drives crowd even more data into even smaller spaces” 1997: 3090 Mibit/sq. in 8.1 GiBytes

CS61C L40 I/O: Disks (16) Ho, Fall 2004 © UCB Historical Perspective Form factor and capacity drives market, more than performance 1970s: Mainframes  14" diam. disks 1980s: Minicomputers, Servers  8", 5.25" diam. disks Late 1980s/Early 1990s: Pizzabox PCs  3.5 inch diameter disks Laptops, notebooks  2.5 inch disks Palmtops didn’t use disks, so 1.8 inch diameter disks didn’t make it

CS61C L40 I/O: Disks (17) Ho, Fall 2004 © UCB State of the Art: Barracuda (2004) 200 GB, 3.5-inch disk 7200 RPM; Serial ATA 2 platters, 4 surfaces 8 watts (idle) 8.5 ms avg. seek 32 to 58 MB/s Xfer rate $125 = $0.625 / GB source:

CS61C L40 I/O: Disks (18) Ho, Fall 2004 © UCB 1 inch disk drive! 2004 Hitachi Microdrive: 1.7” x 1.4” x 0.2” 4 GB, 3600 RPM, 4-7 MB/s, 12 ms seek Digital cameras, PalmPC 2006 MicroDrive? 16 GB, 10 MB/s! Assuming past trends continue

CS61C L40 I/O: Disks (19) Ho, Fall 2004 © UCB Use Arrays of Small Disks… 14” 10”5.25”3.5” Disk Array: 1 disk design Conventional: 4 disk designs Low End High End Katz and Patterson asked in 1987: Can smaller disks be used to close gap in performance between disks and CPUs?

CS61C L40 I/O: Disks (20) Ho, Fall 2004 © UCB Replace Small Number of Large Disks with Large Number of Small Disks! (1988 Disks) Capacity Volume Power Data Rate I/O Rate MTTF Cost IBM 3390K 20 GBytes 97 cu. ft. 3 KW 15 MB/s 600 I/Os/s 250 KHrs $250K IBM 3.5" MBytes 0.1 cu. ft. 11 W 1.5 MB/s 55 I/Os/s 50 KHrs $2K x70 23 GBytes 11 cu. ft. 1 KW 120 MB/s 3900 IOs/s ??? Hrs $150K Disk Arrays potentially high performance, high MB per cu. ft., high MB per KW, but what about reliability? 9X 3X 8X 6X

CS61C L40 I/O: Disks (21) Ho, Fall 2004 © UCB Array Reliability Reliability - whether or not a component has failed measured as Mean Time To Failure (MTTF) Reliability of N disks = Reliability of 1 Disk ÷ N (assuming failures independent) 50,000 Hours ÷ 70 disks = 700 hour Disk system MTTF: Drops from 6 years to 1 month! Disk arrays too unreliable to be useful!

CS61C L40 I/O: Disks (22) Ho, Fall 2004 © UCB Redundant Arrays of (Inexpensive) Disks Files are “striped” across multiple disks Redundancy yields high data availability Availability: service still provided to user, even if some components failed Disks will still fail Contents reconstructed from data redundantly stored in the array  Capacity penalty to store redundant info  Bandwidth penalty to update redundant info

CS61C L40 I/O: Disks (23) Ho, Fall 2004 © UCB Berkeley History, RAID-I RAID-I (1989) Consisted of a Sun 4/280 workstation with 128 MB of DRAM, four dual-string SCSI controllers, inch SCSI disks and specialized disk striping software Today RAID is > $27 billion dollar industry, 80% nonPC disks sold in RAIDs

CS61C L40 I/O: Disks (24) Ho, Fall 2004 © UCB “RAID 0”: No redundancy = “AID” Assume have 4 disks of data for this example, organized in blocks Large accesses faster since transfer from several disks at once This and next 5 slides from RAID.edu,

CS61C L40 I/O: Disks (25) Ho, Fall 2004 © UCB RAID 1: Mirror data Each disk is fully duplicated onto its “mirror” Very high availability can be achieved Bandwidth reduced on write: 1 Logical write = 2 physical writes Most expensive solution: 100% capacity overhead

CS61C L40 I/O: Disks (26) Ho, Fall 2004 © UCB RAID 3: Parity Parity computed across group to protect against hard disk failures, stored in P disk Logically, a single high capacity, high transfer rate disk 25% capacity cost for parity in this example vs. 100% for RAID 1 (5 disks vs. 8 disks)

CS61C L40 I/O: Disks (27) Ho, Fall 2004 © UCB RAID 4: parity plus small sized accesses RAID 3 relies on parity disk to discover errors on Read But every sector has an error detection field Rely on error detection field to catch errors on read, not on the parity disk Allows small independent reads to different disks simultaneously

CS61C L40 I/O: Disks (28) Ho, Fall 2004 © UCB Inspiration for RAID 5 Small writes (write to one disk): Option 1: read other data disks, create new sum and write to Parity Disk (access all disks) Option 2: since P has old sum, compare old data to new data, add the difference to P: 1 logical write = 2 physical reads + 2 physical writes to 2 disks Parity Disk is bottleneck for Small writes: Write to A0, B1 => both write to P disk A0 B0C0 D0 P A1 B1 C1 P D1

CS61C L40 I/O: Disks (29) Ho, Fall 2004 © UCB RAID 5: Rotated Parity, faster small writes Independent writes possible because of interleaved parity Example: write to A0, B1 uses disks 0, 1, 4, 5, so can proceed in parallel Still 1 small write = 4 physical disk accesses

CS61C L40 I/O: Disks (30) Ho, Fall 2004 © UCB Peer Instruction 1. RAID 1 (mirror) and 5 (rotated parity) help with performance and availability 2. RAID 1 has higher cost than RAID 5 3. Small writes on RAID 5 are slower than on RAID 1 ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

CS61C L40 I/O: Disks (31) Ho, Fall 2004 © UCB “And In conclusion…” Magnetic Disks continue rapid advance: 60%/yr capacity, 40%/yr bandwidth, slow on seek, rotation improvements, MB/$ improving 100%/yr? Designs to fit high volume form factor RAID Higher performance with more disk arms per $ Adds option for small # of extra disks Today RAID is > $27 billion dollar industry, 80% nonPC disks sold in RAIDs; started at Cal

CS61C L40 I/O: Disks (32) Ho, Fall 2004 © UCB Administrivia Nothing except final approaching