1 Hard Drive Storage. 2 Introduction zThis sections discusses: yHow a hard drive works yHow to estimate storage size yHow to estimate time.

Slides:



Advertisements
Similar presentations
Lecture Objectives: 1)Define the terms track, sector, and seek as pertaining to a nonvolatile storage medium. 2)Calculate the average rotational for a.
Advertisements

Secondary Storage Devices: Magnetic Disks
Peripheral Storage Devices
Databasteknik Databaser och bioinformatik Data structures and Indexing (II) Fang Wei-Kleiner.
Section 6.2. Record data by magnetizing the binary code on the surface of a disk. Data area is reusable Allows for both sequential and direct access file.
Hard Drives Storing Information 1 Byte at a Time.
Describing Storage Devices Store data when computer is off Two processes –Writing data –Reading data Storage terms –Media is the material storing data.
Problems in IO & File System CS 1550 Recitation November 4 th /6 th, 2002 The questions in this slide are from Andrew S. Tanenbaum's textbook page 375,
Storage. The Memory Hierarchy fastest, but small under a microsecond, random access, perhaps 2Gb Typically magnetic disks, magneto­ optical (erasable),
CS4432: Database Systems II Data Storage - Lecture 2 (Sections 13.1 – 13.3) Elke A. Rundensteiner.
Advance Database System
IELM 230: File Storage and Indexes Agenda: - Physical storage of data in Relational DB’s - Indexes and other means to speed Data access - Defining indexes.
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.
CS4432: Database Systems II Lecture 2 Timothy Sutherland.
Hard Disks and I/O Polytechnic University CS /25/03.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
DISK STORAGE INDEX STRUCTURES FOR FILES Lecture 12.
Operating Systems COMP 4850/CISG 5550 Disks, Part II Dr. James Money.
1 Introduction to Computers Day 4. 2 Storage device A functional unit into which data can be –placed –retained(stored) –retrieved(accessed)
Computer SCIENCE Data Representation and Machine Concepts Section 1.3
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
Hard Drive / Hard Disk Functions of hard disk
Computer System Basics 2 Hard Drive Storage & File Partitions Computer Forensics BACS 371.
CS4432: Database Systems II Data Storage (Better Block Organization) 1.
Hard Drives “ Hard disks store digital information in a relatively permanent form.” --howstuffworks.com.
Hard Drives Non-Volatile Storage. Hard Drives Hard Drives (HD) The primary storage device in a computer system.
Copyright © 2006 by The McGraw-Hill Companies, Inc. All rights reserved. McGraw-Hill Technology Education Copyright © 2006 by The McGraw-Hill Companies,
CS 346 – Chapter 10 Mass storage –Advantages? –Disk features –Disk scheduling –Disk formatting –Managing swap space –RAID.
Physical Storage and File Organization COMSATS INSTITUTE OF INFORMATION TECHNOLOGY, VEHARI.
1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk 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.
ICS 321 Fall 2011 Overview of Storage & Indexing (i) Asst. Prof. Lipyeow Lim Information & Computer Science Department University of Hawaii at Manoa 11/9/20111Lipyeow.
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.
Describing Storage Devices  Storage terms  Media is the material storing data  Storage devices manage the media  Magnetic devices use a magnet  Optical.
Chapter 8 External Storage. Primary vs. Secondary Storage Primary storage: Main memory (RAM) Secondary Storage: Peripheral devices  Disk drives  Tape.
Storing Data Dina Said 1 1.
Database Systems Disk Management Concepts. WHY DO DISKS NEED MANAGING? logical information  physical representation bigger databases, larger records,
20 October 2015Birkbeck College, U. London1 Introduction to Computer Systems Lecturer: Steve Maybank Department of Computer Science and Information Systems.
Disks and Disk Scheduling Steve Muckle Monday, March 31st Spring 2003.
Disk Basics CS Introduction to Operating Systems.
Lecture 5: 9/10/2002CS149D Fall CS149D Elements of Computer Science Ayman Abdel-Hamid Department of Computer Science Old Dominion University Lecture.
Section 13.2 – Secondary storage management (Former Student’s Note)
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Disk storage systems Question#1 (True/False) A track is divided into multiple units called sectors.
Disk Average Seek Time. Multi-platter Disk platter Disk read/write arm read/write head.
Section 13.2 – Secondary storage management. Index 13.2 Disks Mechanics of Disks The Disk Controller Disk Access Characteristics.
Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Programmer’s View of Files Logical view of files: –An a array of bytes. –A file pointer marks the current position. Three fundamental operations: –Read.
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.
1 Lecture 16: Data Storage Wednesday, November 6, 2006.
Lecture 3 Secondary Storage and System Software I
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.
File organization Secondary Storage Devices Lec#7 Presenter: Dr Emad Nabil.
Storing Data Dina Said.
Section 13.2 – Secondary storage management (Former Student’s Note)
McGraw-Hill Technology Education
Computer Science 210 Computer Organization
Backing Store.
Hard Drives.
Introduction to Computing
Disks and Files DBMS stores information on (“hard”) disks.
Persistence: hard disk drive
Parameters of Disks The most important disk parameter is the time required to locate an arbitrary disk block, given its block address, and then to transfer.
Lesson 9 Types of Storage Devices.
Disks and Disk Scheduling
CSE451 File System Introduction and Disk Drivers Autumn 2002
Chapter 11: Mass-Storage Systems
Presentation transcript:

1 Hard Drive Storage

2 Introduction zThis sections discusses: yHow a hard drive works yHow to estimate storage size yHow to estimate time

3 Hard Drive Parts zHard drives have circular platters on which data may be read or written. zThere may be more than one such platter per drive. zThe platters are further divided into tracks. zTracks are divided into sectors. zSimilarly positioned tracks on different platters are grouped into cylinders.

4 Hard Drive Picture zAll Pictures taken from

5 Side Picture zThis picture shows the read/write heads clearly.

6 Sectors and Tracks zThe yellow is a track zThe blue is a sector

7 Estimating Storage Size zThere are usually 512 bytes/sector. zYou need to find the number of sectors per track and the number of cylinders per drive. zThe number of tracks per cylinder is the same as the number of read/write heads. zTime for an example:

8 Storage Size Example zMy old drive has 2484 cylinders, 16 read/write heads, and 63 sectors. zTrack capacity = 63 x 512 = 32,256 bytes/track. zCylinder Capacity = 16 x 32,256 = 516,096 bytes/cylinder zDrive Capacity = 2484 x 516, 096 = x 10 9 bytes/drive zThis is 1,222.6 MB

9 Space Allocation zSpace on a disk drive is usually not allocated one sector at a time, but rather many sectors are allocated when a request is made. zThis set of sectors is called a block, an allocation unit, a cluster, etc.

10 Space Estimate for a File zSuppose I have a file of fix-length records. How much disk space will it occupy? zI need to know: yThe block size yThe record size yThe number of records

11 File Space Calculation zI need to calculate yThe blocking factor, bf, is the number of records per block. yThe total number of blocks, b. yIf desired, the number of tracks and/or cylinders may be calculated as well. zLet’s try one…

12 File Space example zSuppose I have a file that has 500,000 records, each of which is 250 bytes long. zSuppose a block is one sector. zMy blocking factor is FLOOR(512/250) = 2 yNote this is unspanned record format. zThe number of blocks is CEIL(500,000/2) = 250,000 blocks/file.

13 File Space Example II zUsing the previous drive capacity numbers z#Tracks = CEIL(250,000/63) = 3969 z#Cylinders =3969/16 =

14 Time Calculation zThe next question is how much time does it take to retrieve a file? zThere are four different times that may be associated with a file retrieval: ySpin-up time is the time it takes for the drive to spin up to its rated rotational speed. (Does not usually apply to hard drives) ySeek time is the time it takes to move the read/write heads to the correct cylinder yRotational delay is the time it takes to rotate the platter over the appropriate sector yTransfer time is the rate at which data can be transferred.

15 Time Discussion zSpin-up plus seek time plus rotational delay is Latency Time. yDisk manufacturers use this term to mean rotational delay only. zThe spin-up time and seek time must be known. zThe rotational delay and the transfer time may be inferred from the rotational speed of the disk and the number of bytes per track. yIn other words, a disk that rotates at 10,000 rpm and has 32,000 bytes per cylinder can transfer 320,000,000 bytes per minute.

16 More Discussion zThis assumes the heads do not have to move to do this transfer. zIf the heads need to move to retrieve a sector, rotational delay and seek time must be added in for each such move. zThis is why fragmentation slows down disk access.

17 Time Calculation Example zSuppose I have my previous GB hard drive. zSuppose further it rotates at 10,000 rpm, has an average seek time of 10 milliseconds. We will ignore spin-up time. z10,000 rpm = rps = 6msec/rotation. yThis means one rotation takes 6 milliseconds. yThe average rotational delay is 3msec. z166.7 rps x 32,256 bytes/track =5.37MB/sec yThis is the transfer rate

18 Time Calculation Example II zOur previous file had the following: y#Blocks = 250,000 y#Tracks = 3969 y#Cylinders = z 6msec/track x 3969 tracks =23,814 msec yOr 23.8 seconds zAdd in the seek time for each cylinder: y2049 x 10msec=20,490msec=20seconds zTotal time is about 43 seconds. Plus 3 milliseconds rotational delay.

19 Time Calculation III zWhat if the file is badly formatted and each block requires a seek? yEach read requires 6/63 = 0.1 msec yEach read requires a seek of 10 msec yEach needs 3 msec rotational delay yEach read: total 13.1 msec yThere are 250,000 sectors to be read x3,275,000 msec total = 3275 sec = 54.6 minutes

20 The End Slide zText here