Paper by: Chris Ruemmler and John Wikes Presentation by: Timothy Goldberg, Daniel Sink, Erin Collins, and Tony Luaders.

Slides:



Advertisements
Similar presentations
Chapter 6 I/O Systems.
Advertisements

Computer-System Structures Er.Harsimran Singh
IT253: Computer Organization
System Integration and Performance
Disk Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
An Introduction to Disk Drive Modeling Chris Ruemmler & John Wilkes Hewlett-Packard Laboratories Presented by Hang Zhao.
Overview of Mass Storage Structure
Faculty of Information Technology Department of Computer Science Computer Organization Chapter 7 External Memory Mohammad Sharaf.
- Dr. Kalpakis CMSC Dr. Kalpakis 1 Outline In implementing DBMS we need to answer How should the system store and manage very large amounts of data?
Device Management Ankur Saggar Nitin Golait Jason Foos Adam Estabrook.
Storing Data: Disks and Files: Chapter 9
Operating Systems ECE344 Ashvin Goel ECE University of Toronto Disks and RAID.
CSE506: Operating Systems Disk Scheduling. CSE506: Operating Systems Key to Disk Performance Don’t access the disk – Whenever possible Cache contents.
04/18/2007CSCI 315 Operating Systems Design1 Mass Storage Structure Notice: The slides for this lecture have been largely based on those accompanying the.
OS2-1 Chapter 2 Computer System Structures. OS2-2 Outlines Computer System Operation I/O Structure Storage Structure Storage Hierarchy Hardware Protection.
Disk Drivers May 10, 2000 Instructor: Gary Kimura.
1 Storage Hierarchy Cache Main Memory Virtual Memory File System Tertiary Storage Programs DBMS Capacity & Cost Secondary Storage.
SECTIONS 13.1 – 13.3 Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin SECONDARY STORAGE MANAGEMENT.
Disks.
04/21/2004CSCI 315 Operating Systems Design1 Disk Scheduling.
1 CS222: Principles of Database Management Fall 2010 Professor Chen Li Department of Computer Science University of California, Irvine Notes 01.
1 Today I/O Systems Storage. 2 I/O Devices Many different kinds of I/O devices Software that controls them: device drivers.
04/19/2004CSCI 315 Operating Systems Design1 Mass Storage Structure Notice: The slides for this lecture have been largely based on those accompanying the.
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.
Disk and I/O Management
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.”
1 Secondary Storage Management Submitted by: Sathya Anandan(ID:123)
Database Management Systems,Shri Prasad Sawant. 1 Storing Data: Disks and Files Unit 1 Mr.Prasad Sawant.
External Storage Primary Storage : Main Memory (RAM). Secondary Storage: Peripheral Devices –Disk Drives –Tape Drives Secondary storage is CHEAP. Secondary.
2.1 Operating System Concepts Chapter 2: Computer-System Structures Computer System Operation Storage Structure Storage Hierarchy Hardware Protection General.
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 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.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Auxiliary Memory Magnetic Disk:
Disk Basics CS Introduction to Operating Systems.
GYTE - Bilgisayar Mühendisliği Bölümü Bilgisayar Mühendisliği Bölümü GYTE - Bilgisayar Mühendisliği Bölümü An introduction to disk drive modeling BIL 601.
DMBS Internals I February 24 th, What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Device Management Mark Stanovich Operating Systems COP 4610.
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.
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.
Paper by: Chris Ruemmler and John Wikes Presentation by: Timothy Goldberg, Daniel Sink, Erin Collins, and Tony Luaders.
1 Lecture 16: Data Storage Wednesday, November 6, 2006.
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.
Data Storage and Querying in Various Storage Devices.
Chapter 10: Mass-Storage Systems
Chapter 2: Computer-System Structures
Lecture 16: Data Storage Wednesday, November 6, 2006.
Database Management Systems (CS 564)
Mass-Storage Structure
Disks and Files DBMS stores information on (“hard”) disks.
Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin
Module 2: Computer-System Structures
CSE 451: Operating Systems Autumn 2003 Lecture 12 Secondary Storage
CSE 451: Operating Systems Winter 2007 Module 13 Secondary Storage
Disks and scheduling algorithms
Secondary Storage Management Brian Bershad
Persistence: hard disk drive
CSE 451: Operating Systems Secondary Storage
Persistence: I/O devices
CSE 451: Operating Systems Winter 2003 Lecture 12 Secondary Storage
Module 2: Computer-System Structures
Secondary Storage Management Hank Levy
CSE451 File System Introduction and Disk Drivers Autumn 2002
Chapter 11: Mass-Storage Systems
Module 2: Computer-System Structures
Module 2: Computer-System Structures
Presentation transcript:

Paper by: Chris Ruemmler and John Wikes Presentation by: Timothy Goldberg, Daniel Sink, Erin Collins, and Tony Luaders

Introduction Disk Drive performance improvements at 7-10% Compared to microprocessors at 40-60% or disk storage capacities at 60-80% (annually) Simulation models to compare alternative approaches High quality disk drive model Error factor 14 times smaller

Outline Introduction Characteristics of Modern Disk Drives Recording Components Positioning Components Disk Controller Modeling Disk Drives

Characteristics of Modern Disk Non-removable magnetic disk drives Contain a mechanism and controller Recording Components: rotation disks and heads Positioning Components: moves heads into correct position with track-following system Emphasis on features that could be important when creating a disk drive model

Recording Components Smaller disks: Less surface area for data Less power consumption Can spin faster Smaller seek distances Increased storage density: Better linear recording density, maximum rate of flux changes Packing separate tracks of data more closely together May contain from 1 to 12 platters Stack rotates in lockstep

Recording Components Spindle rotation speed: Higher spin speed increases transfer rates, shortens rotation latencies Higher power consumption, requires better bearings Each platter surface has a disk head Responsible for recording (writing) And sensing (reading) magnetic flux variation Single Read-Write data channel Can be switched between the heads Responsible for encoding and decoding data stream into or from a series of magnetic phase changes stored on the disk

Disk Drive

Positioning Components Data surfaces are set up to store data in tracks Modern disks have about 2,000 cylinders and are 3.5 inches. Cylinder is a single stack of tracks at a common distance from the spindle To access the data stored on a track, the disk arms must rotate all the disks to get the desired track to the disk head. This system ensures that the track is reached even with interruptions External vibrations, shocks, and disk flaws (non circular tracks)

Seeking The speed of head movement Faster seeking requires more power Half the seek time requires 4x power Seek is composed of: Speedup (arm moves until at half seek distance) Coast (for long seeks, max velocity) Slowdown (rest close to desired track) Settle (puts disk head on desired location)

Track Following Fine-tuning the head position at the end of the seek and keeping the head on the desired track Determines if head is correctly aligned by using positioning information on the disk at manufacturing time Performs head switches When the controller switches its data channel from one surface to the next in the same cylinder

Data layout A disk appears to its client computer as a linear vector of addressable blocks which are mapped to physical sectors on the disk. Using this method, the disk can hide bad sectors and do low-level performance optimizations. Zoning: tracks are longer at the outside of a platter than at the inside. Maximize storage capacity Track skewing: faster sequential access across track boundaries Allows data to be read or written at nearly full media speed Sparing: stores a list of flaws in the desk surface to be skipped

The Disk Controller Mediates access to the mechanism Runs the track-following system Transfers data between the disk drive and the client Manages an embedded cache

caching of requests Speed-matching buffer can be extended to include some form of caching for both reads and writes. Caches in disk drives are relatively small because of space limitations. Read-ahead: faster than seeking if the cache gets a hit Write caching: saves cache information Cache is volatile, losing its contents if power to the drive is lost Command queuing: allows for multiple outstanding requests at the same time Disk controller determines the best execution order, subject to additional host constraints.

Modeling Disk Drives

The Simulator Based in C++ using a version of the AT&T tasking library The Basic ideas are readily applicable to other simulation environments The disk drive is modeled as two tasks and some additional control structures Task one models the mechanism, including the head and platter (rotation) positions. Task two, the direct memory access engine (DMA), models the SCSI bus interface and its transfer engine.

The Simulator The cache object buffers requests between two tasks and is used to manage the asynchronous interactions between the bus interface and the disk mechanism tasks. The simulator can process about 2,000 I/Os per second on an HP9000 Series 800 Model H50 system This allows 1 million requests to be serviced in approximately 10 minutes

Evaluation Took week long samples from a longer trace series of HP-UX (Unix) computer systems. A metric to evaluate the models used a time distribution curve for the real drive and the model output and use the root mean square of the horizontal distance between these two curves.

No modeling Uses a constant fixed time for each I/O A demerit factor that is 35% of the average I/O time This model is not good

A simple model A better model requires: A seek time linear with the distance No head-settle effects or head-switching costs A rotational delay A fixed controller overhead A transfer time linear with the length of request demerit of 15% of a mean I/O time

Modeling head-positioning effects Determined which track and cylinder the request started on and where it ended Added a fix cost of 2.5 ms for each head and track switch Demerit of 6.2% of a mean I/O time

Modeling rotation position Calculate rotational latency by keeping track of rotational position of the disk Account for spare sectors A demerit of 2.6% of mean I/O time

Modeling data caching Uses both read-ahead and immediate reporting Large disparity due to caching 50% of request are completed in 3ms or less Demerit of 112% is not acceptable!

Modeling data caching Added aggressive read- ahead and immediate reporting to the model Demerit is now only 5.7% of the mean I/O time

Model summary Careful modeling is neither too difficult nor too costly A good model needs careful calibration and tuning These features and others may become particularly important when a workload has large data transfers