Chapter 9: Peripheral Devices: Magnetic Disks

Similar documents
Part IV I/O System. Chapter 12: Mass Storage Structure

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

Chapter 6 External Memory

Part IV I/O System Chapter 1 2: 12: Mass S torage Storage Structur Structur Fall 2010

I/O CANNOT BE IGNORED

Magnetic Disk. Optical. Magnetic Tape. RAID Removable. CD-ROM CD-Recordable (CD-R) CD-R/W DVD

Mass-Storage Structure

I/O CANNOT BE IGNORED

William Stallings Computer Organization and Architecture 8 th Edition. Chapter 6 External Memory

Semiconductor Memory Types Microprocessor Design & Organisation HCA2102

Chapter 11. I/O Management and Disk Scheduling

William Stallings Computer Organization and Architecture 6 th Edition. Chapter 6 External Memory

Computer Organization and Technology External Memory

Chapter 6 - External Memory

Appendix D: Storage Systems

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

Chapter 9: Peripheral Devices. By: Derek Hildreth Chad Davis

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

CSE 120. Operating Systems. March 27, 2014 Lecture 17. Mass Storage. Instructor: Neil Rhodes. Wednesday, March 26, 14

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

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

RAID. Redundant Array of Inexpensive Disks. Industry tends to use Independent Disks

Computer System Architecture

Storage System COSC UCB

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

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

Semiconductor Memory Types. Computer & Microprocessor Architecture HCA103. Memory Cell Operation. Semiconductor Memory.

Database Systems II. Secondary Storage

EXTERNAL MEMORY (Part 1)

COT 4600 Operating Systems Fall 2009

Chapter 13: Mass-Storage Systems. Disk Scheduling. Disk Scheduling (Cont.) Disk Structure FCFS. Moving-Head Disk Mechanism

Chapter 13: Mass-Storage Systems. Disk Structure

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

Operating Systems 2010/2011

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

V. Mass Storage Systems

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

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

COMP283-Lecture 3 Applied Database Management

External Memory. Types of External Memory. Magnetic Disk. Optical. Magnetic Tape. RAID Removable. CD-ROM CD-Recordable (CD-R) CD-R/W DVD

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

Storage. CS 3410 Computer System Organization & Programming

External Memory. Computer Architecture. Magnetic Disk. Outline. Data Organization and Formatting. Write and Read Mechanisms

Physical Storage Media

Chapter 6. Storage and Other I/O Topics

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

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

Database Management Systems, 2nd edition, Raghu Ramakrishnan, Johannes Gehrke, McGraw-Hill

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

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

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

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Database Management Systems need to:

Lecture 25: Interconnection Networks, Disks. Topics: flow control, router microarchitecture, RAID

Address Accessible Memories. A.R. Hurson Department of Computer Science Missouri University of Science & Technology

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

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes?

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

Storing and Retrieving Data. Storing Data: Disks and Files. Solution 1: Techniques for making disks faster. Disks. Why Not Store Everything in Tapes?

Definition of RAID Levels

CMSC 424 Database design Lecture 12 Storage. Mihai Pop

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

CSE 380 Computer Operating Systems

Principles of Data Management. Lecture #2 (Storing Data: Disks and Files)

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

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

Chapter 10: Mass-Storage Systems

Module 13: Secondary-Storage Structure

Database Systems. November 2, 2011 Lecture #7. topobo (mit)

Chapter 14: Mass-Storage Systems. Disk Structure

CS3600 SYSTEMS AND NETWORKS

Data Storage and Query Answering. Data Storage and Disk Structure (2)

Homework, etc. Computer Science Foundations

Ch 11: Storage and File Structure

Storing Data: Disks and Files. Storing and Retrieving Data. Why Not Store Everything in Main Memory? Chapter 7

RAID (Redundant Array of Inexpensive Disks)

I/O Hardwares. Some typical device, network, and data base rates

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

Chapter-6. SUBJECT:- Operating System TOPICS:- I/O Management. Created by : - Sanjay Patel

External Memory. Patrick Happ Raul Queiroz Feitosa. Parts of these slides are from the support material provided by W. Stallings

Chapter 13 Disk Storage, Basic File Structures, and Hashing.

I/O Management and Disk Scheduling. Chapter 11

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

Storing Data: Disks and Files

Disk Scheduling. Based on the slides supporting the text

Chapter 1 Disk Storage, Basic File Structures, and Hashing.

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

BBM371- Data Management. Lecture 2: Storage Devices

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

Disk Scheduling. Chapter 14 Based on the slides supporting the text and B.Ramamurthy s slides from Spring 2001

Mass-Storage. ICS332 - Fall 2017 Operating Systems. Henri Casanova

Lecture 21: Reliable, High Performance Storage. CSC 469H1F Fall 2006 Angela Demke Brown

Chapter 6 Storage and Other I/O Topics

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

Lecture 29. Friday, March 23 CS 470 Operating Systems - Lecture 29 1

Chapter 11. I/O Management and Disk Scheduling

Distributed Video Systems Chapter 5 Issues in Video Storage and Retrieval Part 2 - Disk Array and RAID

UNIT 2 Data Center Environment

CSCI-GA Operating Systems. I/O : Disk Scheduling and RAID. Hubertus Franke

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

Storage Systems. Storage Systems

Transcription:

Chapter 9: Peripheral Devices: Magnetic Disks Basic Disk Operation Performance Parameters and History of Improvement Example disks RAID (Redundant Arrays of Inexpensive Disks) Improving Reliability Improving Performance

Magnetic Disk Drives High density and non-volatile Densities similar to semiconductor RAM on an inexpensive medium No power required to retain stored information Motion of medium supplies power for sensing More random access than tape: direct access Different platters selected electronically Track on platter selected by head movement Cyclic sequential access to data on a track Structured address of data on disk Drive: Platter: Track (cylinder): Sector: Byte

Multi-Platter Hard Disk Drive

Multiple Platters

Simplified View of Disk Track and Sector Organization An integral number of sectors are recorded around a track A sector is the unit of data transfer to or from the disk

Simplified View of Individual Bits Encoded on a Disk Track Inside tracks are shorter & thus have higher densities or fewer words All sectors contain the same number of bytes Inner portions of a platter may have fewer sectors per track; multiple zone recording. Small areas of the disk are magnetized in different directions Change in magnetization direction is what is detected on read

Disk Layout Methods Diagram Stallings Computer Organization & Architecture Same number of bits in each zone, but more zones as you go to outer cylinders.

Typical Hard Disk Sector Organization Serial bit stream has header, data, & error code Header synchronizes sector read and records sector address Data length is usually power of 2 bytes Error detection/correction code needed at end

Winchester Disk Format: Seagate ST506 Stallings Computer Organization & Architecture

Disk Formatting Disks are pre-formatted with track and sector address written in headers Disk surface defects may cause some sectors to be marked unusable for the software

Static Disk Characteristics Areal density of bits on surface density = 1/(bit spacing track spacing) Maximum density: density on innermost track Unformatted capacity: includes header and error control bits Formatted capacity: capacity = bytes sector sectors tracks track surface # of surfaces

Dynamic Disk Characteristics Seek time: time to move heads to cylinder Track-to-track access: time to adjacent track Rotational latency: time for correct sector to come under read/write head Average access time = seek time + rotational latency Burst rate (maximum transfer bandwidth) burst rate = revs sec sectors rev bytes sector

RAID Redundant Array of Inexpensive/Independent Disks Reliability and Redundancy for Improved Performance Raid LEVEL 0: Speed improvement only, NO reliability improvement Data is "striped" across several disks so they can be accessed in parallel independent of each other. Strips may be physical blocks, sectors, or other units. If there is a reasonable probability that multiple disk requests target different disks, they can be accessed in parallel (i.e., overlap seek and rotational delay) thus lowering average access time. Very good when accessing sequential/contiguous data.

Data Mapping For RAID 0 Stallings Comp Sys Design Computer & Arch 2nd Ed Organization & Architecture

RAID - 1 RAID Level 1: "Mirroring," writing the exact same data to two different disk drives. Reliability: If one drive fails, the other can be used. Performance: Can seek on both drives at the same time, accept the data from the first one to obtain the data and abort the other request. Negatives: Must write data to two disks, slowest one can determine performance. Costly; need twice as many disks for the same amount of data.

RAID 0, 1, 2 Stallings Comp Sys Design Computer & Arch 2nd Organization Ed & Architecture

RAID 2 RAID 2 & 3 General: All disks in the array are used for every I/O request. Disks are synchronized so each disk head is over the same disk position at every point in time. RAID Level 2: Data is striped at the bit or word level across several disks. Reliability: Additional ECC (Error Correcting Codes) bits to recover data if one drive fails (e.g., Hamming SECDEC) are calculated. The ECC bits are placed on additional drives. The number is proportional to the log of the number of data disks. Performance: Data bandwidth improves and correponds to the number of data disks.

RAID - 3 RAID Level 3: Striped as in level 2 at the byte level. Reliability: A simple parity bit is computed for each bit position. A single disk (improvement over RAID-2) holds the parity bits in the calculated position. If a parity error is detected: The disk holding the error can be replaced & data rewritten. The error can be corrected on the fly by performing the proper calculation. Performance: Overall bandwidth is increased through parallel access of block of data.

RAID: 4 RAID Level 4: Similar to level 3- Reliability: Blocks are used instead of bytes, Data blocks are written/read asynchronously/independently of one another. Blocks are related to each other in that they all contribute to a parity calculation where the parity bits are placed on ECC disk drive in the corresponding block position. Performance: For reading, this is fast due to parallel access to blocks. For writing, more involved parity computation must be performed since block accesses are independent (e.g., the controller that generates the parity bits must read other blocks to generate the parity). Often used in transaction-based systems, such as in airline reservation systems.

RAID 3 & 4 Stallings Computer Organization & Architecture

RAID Level 5: Similar to level 4, Reliability: RAID: 5 & 6 (Difference from 4) Both data & ECC bits are both striped across 3 or more drives. Round Robin distribution of ECC bits often used. One extra disk is needed (N+1). Performance: Improved performance over RAID 3 in that the potential bottleneck at getting at the ECC disk is eliminated. RAID Level 6: Similar to level 5, Reliability: (Difference from 5) Extra correction bits, two different parity schemes, are present to permit recovery from multiple errors. Two extra disks are needed (N+2). Can regenerate data even if two separate disks fail very high availability Performance: Lower performance on writing since two separate parity blocks must be computed and placed on separate disks.

RAID 5 & 6 Stallings Computer Organization & Architecture