DisksCS-4513, D-Term 20071 Disks CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz,

Slides:



Advertisements
Similar presentations
IT253: Computer Organization
Advertisements

Disk Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
OPERATING SYSTEMS CS3530 Summer 2014 OPERATING SYSTEMS CS3530 Summer 2014 Input/Output System Chapter 9.
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.
Disk Drivers May 10, 2000 Instructor: Gary Kimura.
CS-3013 & CS-502, Summer 2006 Disks1 CS-3013 & CS502 Operating Systems.
Disks, RAIDs, and Stable Storage CS-3013 A-term Disks, RAIDs, and Stable Storage CS-3013, Operating Systems A-term 2009 (Slides include materials.
Disks.
Operating Systems File systems
DisksCS-502 Fall Disks CS-502 Operating Systems Fall 2006 (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin,
Secondary Storage Management Hank Levy. 8/7/20152 Secondary Storage • Secondary Storage is usually: –anything outside of “primary memory” –storage that.
Operating Systems COMP 4850/CISG 5550 Disks, Part II Dr. James Money.
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Mass Storage System EMELIZA R. YABUT MSIT. Overview of Mass Storage Structure Traditional magnetic disks structure ◦Platter- composed of one or more.
12.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts with Java – 8 th Edition Chapter 12: Mass-Storage Systems.
Disk and I/O Management
CENG334 Introduction to Operating Systems Erol Sahin Dept of Computer Eng. Middle East Technical University Ankara, TURKEY URL:
Disk Memory Topics Disk Memory Structure Disk Capacity class10.ppt.
DISKS IS421. DISK  A disk consists of Read/write head, and arm  A platter is divided into Tracks and sector  The R/W heads can R/W at the same time.
CS 346 – Chapter 10 Mass storage –Advantages? –Disk features –Disk scheduling –Disk formatting –Managing swap space –RAID.
CS 352 : Computer Organization and Design University of Wisconsin-Eau Claire Dan Ernst Storage Systems.
L/O/G/O External Memory Chapter 3 (C) CS.216 Computer Architecture and Organization.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 10: Mass-Storage Systems.
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.
Topic: Disks – file system devices. Rotational Media Sector Track Cylinder Head Platter Arm Access time = seek time + rotational delay + transfer time.
Introduction to Database Systems 1 Storing Data: Disks and Files Chapter 3 “Yea, from the table of my memory I’ll wipe away all trivial fond records.”
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Chapter 12: Mass-Storage Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 12: Mass-Storage Systems Overview of Mass.
Chapter 12: Mass-Storage Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Jan 1, 2005 Chapter 12: Mass-Storage.
1Fall 2008, Chapter 12 Disk Hardware Arm can move in and out Read / write head can access a ring of data as the disk rotates Disk consists of one or more.
I/O Management and Disk Structure Introduction to Operating Systems: Module 14.
GENERAL INFORMATION Invented in 1950's on mainframe computers with 20 inches diameter with only few megabytes of data. Originally called 'Fixed Disc'
DisksCS-502 Fall Disks CS-502, Operating Systems Fall 2007 (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin,
File Structures. 2 Chapter - Objectives Disk Storage Devices Files of Records Operations on Files Unordered Files Ordered Files Hashed Files Dynamic and.
Auxiliary Memory Magnetic Disk:
Disk Basics CS Introduction to Operating Systems.
Chapter 12: Mass-Storage Systems
Silberschatz, Galvin and Gagne ©2009 Edited by Khoury, 2015 Operating System Concepts – 9 th Edition, Chapter 10: Mass-Storage Structure.
Disks, RAIDs, and Stable Storage CS-502 (EMC) Fall Disks, RAIDs, and Stable Storage CS-502, Operating Systems Fall 2009 (EMC) (Slides include materials.
1 Fixed Disks Microprocessor Computer Architectures Lab Disk Basics “Disk Subsystem” – Interface to x86 – Responsible for Reading/Writing Interface Circuit.
Chapter 8 Secondary Memory. Topics Types of External Memory Magnetic Disk Optical Magnetic Tape.
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
Device Management Mark Stanovich Operating Systems COP 4610.
CS399 New Beginnings Jonathan Walpole. Disk Technology & Secondary Storage Management.
Chapter 9 I/O System. 2 Input/Output System I/O Major objectives are: Take an application I/O request and send it to the physical device. Then, take whatever.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts Essentials – 2 nd Edition Chapter 9: Mass-Storage Systems.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 10: Mass-Storage Systems.
Disks 1 CS502 Spring 2006 Disks CS502 – Operating Systems Spring 2006.
Operating System Concepts with Java – 7 th Edition, Nov 15, 2006 Silberschatz, Galvin and Gagne ©2007 Chapter 11: File System Implementation.
© Janice Regan, CMPT 300, May CMPT 300 Introduction to Operating Systems DISK I/0.
Chapter 10: Mass-Storage Systems
Operating System (013022) Dr. H. Iwidat
Disks and RAID.
Introduction to Computing
CSE 153 Design of Operating Systems Winter 2018
Chapter 12: Mass-Storage Systems
Jonathan Walpole Computer Science Portland State University
Persistence: hard disk drive
Persistence: I/O devices
Secondary Storage Management Hank Levy
CS333 Intro to Operating Systems
CSE451 File System Introduction and Disk Drivers Autumn 2002
Chapter 11: Mass-Storage Systems
Mass-Storage Systems (Disk Scheduling)
Disks Magnetic (hard) Disk arrays are used for reliable storage (RAID)
Presentation transcript:

DisksCS-4513, D-Term Disks CS-4513 Distributed Computing Systems (Slides include materials from Operating System Concepts, 7 th ed., by Silbershatz, Galvin, & Gagne, Modern Operating Systems, 2 nd ed., by Tanenbaum, and Distributed Systems: Principles & Paradigms, 2 nd ed. By Tanenbaum and Van Steen)

DisksCS-4513, D-Term Context Early days: disks thought of as I/O devices Controlled like I/O devices Block transfer, DMA, interrupts, etc. Data in and out of memory (where action is) Today: disks as integral part of computing system Long term storage of information within system Implementer of fundamental abstraction (files) The real center of action

DisksCS-4513, D-Term Disk Drives External Connection IDE/ATA SCSI USB Cache – independent of OS Controller Details of read/write Cache management Failure management

DisksCS-4513, D-Term Price per Megabyte of Magnetic Hard Disk, From 1981 to 2000

DisksCS-4513, D-Term Prices per GB (March 9, 2006) 52¢ per gigabyte – 250 GB Porsche (portable) 7200 rpm, 11 ms. avg. seek time, 2 MB drive cache USB 2.0 port (effective 40 MBytes/sec) $1.25 per GB – 40 GB Barracuda 7200 rpm, 8.5 ms. ms. avg. seek time, 2 MB drive cache EIDE (theoretical MBytes/sec) $4.52 per GB – 72 GB Hot-swap 10,000 rpm, 4.9 ms. avg. seek time SCSI (320 MB/sec) $6.10 per GB – 72 GB Ultra 15,000 rpm, 3.8 ms. avg. seek time SCSI (320 MB/sec)

DisksCS-4513, D-Term Prices per GB (March 22, 2007) 40¢ per gigabyte – 250 GB Porsche (portable) 7200 rpm, 11 ms. avg. seek time, 2 MB drive cache USB 2.0 port (effective 40 MBytes/sec) $1.12 per GB – 40 GB Caviar 7200 rpm, 8.9 ms. ms. avg. seek time, 2 MB drive cache EIDE (theoretical MBytes/sec) $2.33 per GB – 300 GB Hot-swap 10,000 rpm, 4.7 ms. avg. seek time, 8 MB drive cache SCSI (320 MB/sec) $4.08 per GB – GB Ultra320 15,000 rpm, 3.8 ms. avg. seek time SCSI (320 MB/sec)

DisksCS-4513, D-Term Hard Disk Geometry Platters Two-sided magnetic material 1-16 per drive, 3,000 – 15,000 RPM Tracks Concentric rings bits laid out serially Divided into sectors (addressable) Cylinders Same track on each platter Arms move together Operation Seek: move arm to track Read/Write: –wait till sector arrives under head –Transfer data

DisksCS-4513, D-Term Moving-head Disk Machanism

DisksCS-4513, D-Term More on Hard Disk Drives Manufactured in clean room Permanent, air-tight enclosure “Winchester” technology Spindle motor integral with shaft “Flying heads” Aerodynamically “float” over moving surface Velocities > 100 meters/sec Parking position for heads during power-off Excess capacity Sector re-mapping for bad blocks Managed by OS or by drive controller 20, ,000 hours mean time between failures

DisksCS-4513, D-Term More on Hard Disk Drives (continued) Early days Read/write platters in parallel for higher bandwidth Today Extremely narrow tracks, closely spaced –tolerances < 5-20 microns Thermal variations prevent precise alignment from one cylinder to the next Seek operation Move arm to approximate position Use feedback control for precise alignment Seek time  k * distance

DisksCS-4513, D-Term Raw Disk Layout Track format – n sectors –200 < n < 2000 in modern disks –Some disks have fewer sectors on inner tracks Inter-sector gap –Enables each sector to be read or written independently Sector format –Sector address: Cylinder, Track, Sector (or some equivalent code) –Optional header (HDR) –Data –Each field separated by small gap and with its own CRC Sector length –Almost all operating systems specify uniform sector length –512 – 4096 bytes

DisksCS-4513, D-Term Formatting the Disk Write all sector addresses Write and read back various patterns on all sectors Test all sectors Identify bad blocks Bad block Any sector that does not reliably return the data that was written to it!

DisksCS-4513, D-Term Bad Block Management Bad blocks are inevitable Part of manufacturing process (less than 1%) –Detected during formatting Occasionally, blocks become bad during operation Manufacturers add extra tracks to all disks Physical capacity = (1 + x) * rated_capacity Who handles them? Disk controller: Bad block list maintained internally –Automatically substitutes good blocks Formatter: Re-organize track to avoid bad blocks OS: Bad block list maintained by OS, bad blocks never used

DisksCS-4513, D-Term Bad Sector Handling – within track a)A disk track with a bad sector b)Substituting a spare for the bad sector c)Shifting all the sectors to bypass the bad one

DisksCS-4513, D-Term Logical vs. Physical Sector Addresses Some disk controllers convert [cylinder, track, sector] addresses into logical sector numbers –Linear array –No gaps in addressing –Bad blocks concealed by controller Reason: –Backward compatibility with older PC’s –Limited number of bits in C, T, and S fields

DisksCS-4513, D-Term Disk Drive – Performance Seek time –Position heads over a cylinder – 1 to 25 ms Rotational latency –Wait for sector to rotate under head –Full rotation - 4 to 12 ms (15000 to 5400 RPM) –Latency averages ½ of rotation time Transfer Rate –approx MB/sec (aka bandwidth) Transfer of 1 Kbyte –Seek (4 ms) + rotational latency (2ms) + transfer = 6.04 ms –Effective BW here is about 170 KB/sec (misleading!)

DisksCS-4513, D-Term Disk Reading Strategies Read and cache a whole track Automatic in some controllers Subsequent reads to same track have zero rotational latency – good for locality of reference! Disk arm available to seek to another cylinder Start from current head position Start filling cache with first sector under head Signal completion when desired sector is read Start with requested sector When no cache, or limited cache sizes

DisksCS-4513, D-Term Disk Writing Strategies There are none The best one can do is –collect together a sequence of contiguous (or nearby) sectors for writing –Write them in a single sequence of disk actions Caching for later writing is (usually) a bad idea –Application has no confidence that data is actually written before a failure –Some network disk systems provide this feature, with battery backup power for protection

DisksCS-4513, D-Term Disk Writing Strategies There are none The best one can do is –collect together a sequence of contiguous (or nearby) sectors for writing –Write them in a single sequence of disk actions Caching for later writing is (usually) a bad idea –Application has no confidence that data is actually written before a failure –Some network disk systems provide this feature, with battery backup power for protection Log structured file system

DisksCS-4513, D-Term Disk Arm Scheduling A lot of material in textbooks on this subject. See –Silbershatz, §12.4 –Tanenbaum, Modern Operating Systems, §5.4.3 Goal –Minimize seek time by minimizing seek distance

DisksCS-4513, D-Term However … In real systems, average disk queue length is often 1-2 requests All strategies are approximately equal! If your system typically has queues more than two entries, something is seriously wrong! Disk arm scheduling used only in a few very specialized situations Multi-media; some transaction-based systems

DisksCS-4513, D-Term Return to File Systems