Chapter 12 – Mass Storage Structures (Pgs 505-545 )

Slides:



Advertisements
Similar presentations
Mass Storage Systems. Readings r Chapter , 12.7.
Advertisements

CS 6560: Operating Systems Design
Disk Scheduling Based on the slides supporting the text 1.
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Mass-Storage Systems Revised Tao Yang.
1 Storage (cont’d) Disk scheduling Reducing seek time (cont’d) Reducing rotational latency RAIDs.
Other Disk Details. 2 Disk Formatting After manufacturing disk has no information –Is stack of platters coated with magnetizable metal oxide Before use,
Chapter 12: Mass-Storage Structures
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Lecture 17 I/O Optimization. Disk Organization Tracks: concentric rings around disk surface Sectors: arc of track, minimum unit of transfer Cylinder:
1 Lecture 26: Storage Systems Topics: Storage Systems (Chapter 6), other innovations Final exam stats:  Highest: 95  Mean: 70, Median: 73  Toughest.
Based on the slides supporting the text
Chapter 12 – Disk Performance Optimization Outline 12.1 Introduction 12.2Evolution of Secondary Storage 12.3Characteristics of Moving-Head Disk Storage.
Device Management.
1 Disk Scheduling Chapter 14 Based on the slides supporting the text.
Disks CS 416: Operating Systems Design, Spring 2001 Department of Computer Science Rutgers University
Secondary Storage CSCI 444/544 Operating Systems Fall 2008.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition Mass-Storage Systems Revised Tao Yang.
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.
Moving-head Disk Mechanism Rotation Speeds: 60 to 200 rotations per second Head Crash: read-write head makes contact with the surface.
12.1 Silberschatz, Galvin and Gagne ©2009 Operating System Concepts with Java – 8 th Edition Chapter 12: Mass-Storage Systems.
Secondary Storage Unit 013: Systems Architecture Workbook: Secondary Storage 1G.
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.
1 Recitation 8 Disk & File System. 2 Disk Scheduling Disks are at least four orders of magnitude slower than main memory –The performance of disk I/O.
CSE 321b Computer Organization (2) تنظيم الحاسب (2) 3 rd year, Computer Engineering Winter 2015 Lecture #4 Dr. Hazem Ibrahim Shehata Dept. of Computer.
Mass storage Structure Unit 5 (Chapter 14). Disk Structures Magnetic disks are faster than tapes. Disk drives are addressed as large one- dimensional.
Silberschatz, Galvin and Gagne ©2013 Operating System Concepts – 9 th Edition Chapter 10: Mass-Storage Systems.
CS307 Operating Systems Mass-Storage Systems Fan Wu Department of Computer Science and Engineering Shanghai Jiao Tong University Fall 2011.
1 Operating Systems Part VI: Mass- Storage Structure.
RAID COP 5611 Advanced Operating Systems Adapted from Andy Wang’s slides at FSU.
Lecture 9 of Advanced Databases Storage and File Structure (Part II) Instructor: Mr.Ahmed Al Astal.
Mass-Storage Systems. Objectives  physical structure of secondary and tertiary storage devices  performance characteristics of mass-storage devices.
Silberschatz, Galvin and Gagne ©2009 Operating System Concepts – 8 th Edition, Chapter 12: Mass-Storage Systems.
Disk Structure Disk drives are addressed as large one- dimensional arrays of logical blocks, where the logical block is the smallest unit of transfer.
Chapter 12: Mass-Storage Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts Chapter 12: Mass-Storage Systems Overview of Mass.
1 I/O Management and Disk Scheduling Chapter Categories of I/O Devices Human readable Used to communicate with the user Printers Video display terminals.
Page 110/12/2015 CSE 30341: Operating Systems Principles Network-Attached Storage  Network-attached storage (NAS) is storage made available over a network.
CS307 Operating Systems Mass-Storage Systems Fan Wu Department of Computer Science and Engineering Shanghai Jiao Tong University Spring 2012.
Chapter 12: Mass-Storage Systems Silberschatz, Galvin and Gagne ©2005 Operating System Concepts – 7 th Edition, Jan 1, 2005 Chapter 12: Mass-Storage.
CE Operating Systems Lecture 20 Disk I/O. Overview of lecture In this lecture we will look at: Disk Structure Disk Scheduling Disk Management Swap-Space.
I/O Management and Disk Structure Introduction to Operating Systems: Module 14.
Disks Chapter 5 Thursday, April 5, Today’s Schedule Input/Output – Disks (Chapter 5.4)  Magnetic vs. Optical Disks  RAID levels and functions.
Silberschatz, Galvin and Gagne  Operating System Concepts Chapter 14: Mass-Storage Systems Disk Structure Disk Scheduling Disk Management Swap-Space.
Lecture 3 Page 1 CS 111 Online Disk Drives An especially important and complex form of I/O device Still the primary method of providing stable storage.
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
Chapter 14: Mass-Storage Systems Disk Structure. Disk Scheduling. RAID.
Disk Scheduling The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk.
Part IV I/O System Chapter 12: Mass Storage Structure.
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.
Magnetic Disks Have cylinders, sectors platters, tracks, heads virtual and real disk blocks (x cylinders, y heads, z sectors per track) Relatively slow,
1 Chapter 11 I/O Management and Disk Scheduling Patricia Roy Manatee Community College, Venice, FL ©2008, Prentice Hall Operating Systems: Internals and.
Chapter 10: Mass-Storage Systems
Operating System (013022) Dr. H. Iwidat
Multiple Platters.
Disks and RAID.
I/O System Chapter 5 Designed by .VAS.
Chapter 12: Mass-Storage Structure
Operating System I/O System Monday, August 11, 2008.
DISK SCHEDULING FCFS SSTF SCAN/ELEVATOR C-SCAN C-LOOK.
Chapter 14 Based on the slides supporting the text
RAID RAID Mukesh N Tekwani
Chapter 12: Mass-Storage Systems
Overview Continuation from Monday (File system implementation)
Mass-Storage Systems.
RAID RAID Mukesh N Tekwani April 23, 2019
Disk Scheduling The operating system is responsible for using hardware efficiently — for the disk drives, this means having a fast access time and disk.
Improving performance
Presentation transcript:

Chapter 12 – Mass Storage Structures (Pgs )

Magnetic Disk Terminology  Transfer Rate: Rate at which data flows from the drive to main memory Positioning Time (time before IO can occur) = Seek Time (time to move the head) + Rotational Latency (time for correct sector to come under head)

Disk Construction Block: 512 Bytes (typical)

Disk Bus Formats  Always changing and improving  SCSI: Small computer systems interface  ATA: Advance technology attachment  SATA: Serial ATA  EIDE: Enhanced integrated drive electronics  USB: Universal serial bus  FC: Fibre channel

The Future of Disks  Surviving for the near future  Slower than persistent RAM  Cheaper than persistent RAM  Older technology tends to remain available if it fulfills a role  e.g., magnetic tapes for second-level backups of financial data (still in use on mainframe systems – cost per bit very low compared to disks)

Head Scheduling Concerns Synchronicity: Must requests be processed in order? Average Wait Time: How long is a process typically blocked? Maximum Wait Time: How long could a process be blocked (Important in RTOS) Priority: Is all IO equally important? ** Almost identical to process scheduling **

Scheduling Algorithms  First Come, First Served (FCFS)  Fair but not most efficient  Shortest seek time first (SSTF)  Better, but far from optimal  SCAN (Elevator)  Moves back and forth, servicing requests in cylinder order  C-SCAN (Circular)  Same as SCAN but don't service on return trip  LOOK (and also C-LOOK)  Same as SCAN but only go/return as far as needed

Choosing One  Often don't have to now  being built into the disk controller  SSTF or LOOK are most common  Simple, decent performance  Sophisticated systems change algorithm based on data properties (like sorting functions in libraries)

Disk Management  Much of the low-level management (blocks, ECC, bad-sector replacement) is done by the disk controller  Blocks typically 512K, but 256 and 1024 are sometimes possible  OS uses "Clusters" which are larger than blocks and which function as virtual blocks  Increases efficiency, better supports large files, reduces overhead, maps to page size

Bad Blocks  Cheap disks don't do much  Newer/High-end disks handle it via disk controller  Spare sectors exist  Can cause problems with head scheduling  Controllers try to generate replacements on the same cylinder for this reason  Small errors often repairable using ECC

RAID  Redundant Array of Independent Disks  Improved reliability  Higher data transfer rate  Less storage (due to redundancy) than if used separately  Often provided as a "unit" with its own independent controller

Mirroring  Simplest form of redundancy  Both disks have to fail to lose data  About the most effective method for providing redundancy  Highly expensive with respect to resources  "Independent Failure" is not fully realistic  Bad batches, aging, fire/flood, etc.  NOTHING prevents some data loss due to power-failure

Striping  Various Levels  Block-level (most common)  Byte-level  Bit-level

RAID Levels 0: Block-striping, no redundancy 1: Complete mirroring 2: Byte-striping, parity disks, ECC for single bit errors 3: Bit-interleaved parity (uses sector parity checks to reduce overhead of RAID 2) 4: Block-interleaved parity (RAID 0 with parity blocks) 5: Distributed block-interleaved parity: Same as 4 but with parity and data intermixed 6: P+Q Scheme: Same as 5, but with improved ECC such as Reed-Solomon coding (tolerates dual disk failures)

RAID  RAID 0: Striping, improves performance  RAID 1: Mirroring, improves reliability  Put together they are highly effective  Only half the storage capacity is available due to mirroring  Simple to implement and maintain

Selecting a RAID Level  Rebuild Time: How long does it take to react to a failure?  Need for reliability?  Cost effectiveness (mirroring costs more per bit)?  Performance concerns  Type of protection – RAID protects against hardware failures, not against software failures  Properties of file systems – stability, volumes, sizes

Other Storage  NVRAM – As a solid state disk or as a write- back cache  Optical Disks (CD/DVD) – Various technologies for CD-ROM, CD-R ("WORM"), CD-RW  Magnetic Tapes: Cartridges (kind of like VHS), slow but very economical

Storage Performance Issues  Speed -- Bandwidth & Latency  Effective Bandwidth: Overall transfer rate (including latency)  Sustained Bandwidth: Rate of flow  Average Latency: Time from request until transfer begins  Reliability (Redundancy) – number and kind of failures from which recovery can occur  Cost – price per bit  Lifespan – Will data be required in 20 years?  Access Frequency – How often will data be accessed?

To Do:  Work on Assignment 2 (Due next week)  Complete Lab 7 (optional lab)  Read Chapter 12 (pgs ; this lecture)