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.

Slides:



Advertisements
Similar presentations
Secondary Storage Devices: Magnetic Disks
Advertisements

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,
Data Storage John Ortiz. Lecture 17Data Storage2 Overview  Database stores data on secondary storage  Disk has distinct storage and access characteristics.
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
04/18/2007CSCI 315 Operating Systems Design1 Mass Storage Structure Notice: The slides for this lecture have been largely based on those accompanying the.
13.2 Disks Mechanics of Disks Presented by Chao-Hsin Shih Feb 21, 2011.
1 Storing Data: Disks and Files Yanlei Diao UMass Amherst Feb 15, 2007 Slides Courtesy of R. Ramakrishnan and J. Gehrke.
METU Department of Computer Eng Ceng 302 Introduction to DBMS Disk Storage, Basic File Structures, and Hashing by Pinar Senkul resources: mostly froom.
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.
CS4432: Database Systems II Lecture 2 Timothy Sutherland.
CPSC-608 Database Systems Fall 2009 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #5.
Disk Storage, Basic File Structures, and Hashing
CS 728 Advanced Database Systems Chapter 16
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Chapter 13 Disk Storage, Basic File Structures, and Hashing.
CPSC-608 Database Systems Fall 2010 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #5.
04/21/2004CSCI 315 Operating Systems Design1 Disk Scheduling.
1 Disk Storage, Basic File Structures, and Hashing.
SECTIONS 13.1 – 13.3 Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin SECONDARY STORAGE MANAGEMENT.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
04/19/2004CSCI 315 Operating Systems Design1 Mass Storage Structure Notice: The slides for this lecture have been largely based on those accompanying the.
DISK STORAGE INDEX STRUCTURES FOR FILES Lecture 12.
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.
Mass Storage System EMELIZA R. YABUT MSIT. Overview of Mass Storage Structure Traditional magnetic disks structure ◦Platter- composed of one or more.
CS4432: Database Systems II Data Storage (Better Block Organization) 1.
L/O/G/O External Memory Chapter 3 (C) CS.216 Computer Architecture and Organization.
1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk Storage.
Disk Storage Copyright © 2004 Pearson Education, Inc.
Copyright © 2011 Pearson Education, Inc. Publishing as Pearson Addison-Wesley Chapter 17 Disk Storage, Basic File Structures, and Hashing.
1 Secondary Storage Management Submitted by: Sathya Anandan(ID:123)
Storage and Indexes Introduction to Databases Computer Science 557 Instructor: Joe Bockhorst University of Wisconsin - Milwaukee.
Chapter 13 Disk Storage, Basic File Structures, and Hashing. Copyright © 2004 Pearson Education, Inc.
CS4432: Database Systems II Data Storage 1. Storage in DBMSs DBMSs manage large amounts of data How does a DBMS store and manage large amounts of data?
Storing Data Dina Said 1 1.
Database Systems Disk Management Concepts. WHY DO DISKS NEED MANAGING? logical information  physical representation bigger databases, larger records,
CPSC-608 Database Systems Fall 2015 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #5.
Disk Basics CS Introduction to Operating Systems.
Section 13.2 – Secondary storage management (Former Student’s Note)
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.
CPSC 231 Secondary storage (D.H.)1 Learning Objectives Understanding disk organization. Sectors, clusters and extents. Fragmentation. Disk access time.
Chapter 5 Record Storage and Primary File Organizations
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.
CPS216: Advanced Database Systems Notes 03: Data Access from Disks Shivnath Babu.
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.
File organization Secondary Storage Devices Lec#7 Presenter: Dr Emad Nabil.
Copyright © 2007 Ramez Elmasri and Shamkant B. Navathe Lec 5 part1 Disk Storage, Basic File Structures, and Hashing.
Database Management Systems 3ed, R. Ramakrishnan and J. Gehrke1 Disks and Files.
Storing Data Dina Said.
File Organization Record Storage and Primary File Organization
Section 13.2 – Secondary storage management (Former Student’s Note)
CSIS-110 Introduction to Computer Science
Database Management Systems (CS 564)
Computer Science 210 Computer Organization
Hard Drives.
CPSC-608 Database Systems
9/12/2018.
Disks and Files DBMS stores information on (“hard”) disks.
Sanuja Dabade & Eilbroun Benjamin CS 257 – Dr. TY Lin
Chapters 17 & 18 6e, 13 & 14 5e: Design/Storage/Index
Disk Storage, Basic File Structures, and Hashing
Disk Storage, Basic File Structures, and Buffer Management
Disk storage Index structures for files
Persistence: hard disk drive
CPS216: Advanced Database Systems Notes 04: Data Access from Disks
Andy Wang Operating Systems COP 4610 / CGS 5765
Presentation transcript:

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 the block between the disk and a main memory buffer. This is the random access time for accessing a disk block. There are three time components to consider: Seek time, Rotational delay, and Block transfer time

Seek time (s): This is the time needed to mechanically position the read/write head on the correct track for movable-head disks. For fixed-head disks, it is the time needed to electronically switch to the appropriate read/write head. For movable head disks this time varies, depending on the distance between the current track under the read/write head and the track specified in the block address. Usually, the disk manufacturer provides an average seek time in milliseconds. The typical range of average seek time is 10 to 60 msec. This is the main "culprit" for the delay involved in transferring blocks between disk and memory.

Rotational delay (rd): Once the read/write head is at the correct track, the user must wait for the beginning of the required block to rotate into position under the read/write head. On the average, this takes about the time for half a revolution of the disk, but it actually ranges from immediate access (if the start of the required block is in position under the read/write head right after the seek) to a full disk revolution (if the start of the required block just passed the read/write head after the seek). If the speed of disk rotation is p revolutions per minute (rpm), then the average rotational delay rd is given by rd = (1/2)*(1/p) min = (60*1000)/(2*p) msec A typical value for p is 10,000 rpm, which gives a rotational delay of rd = 3 msec.

Block transfer time (btt): Once the read/write head is at the beginning of the required block, some time is needed to transfer the data in the block. This block transfer time depends on the block size, the track size, and the rotational speed. If the transfer rate for the disk is tr bytes/msec and the block size is B bytes, then btt = B/tr msec

Example If we have a track size of 50 Kbytes and p is 3600 rpm, the transfer rate in bytes/ msec is tr = (50*1000)/(60*1000/3600) = 3000 bytes/msec In this case, btt = B/3000 msec, where B is the block size in bytes.

The average time needed to find and transfer a block, given its block address, is estimated by (s + rd + btt) msec   This holds for either reading or writing a block. The principal method of reducing this time is to transfer several blocks that are stored on one or more tracks of the same cylinder; then the seek time is required only for the first block. To transfer consecutively k noncontiguous blocks that are on the same cylinder, we need approximately s + (k * (rd + btt)) msec In this case, we need two or more buffers in main storage, because we are continuously reading or writing the k blocks. The transfer time per block is reduced even further when consecutive blocks on the same track or cylinder are transferred. This eliminates the rotational delay for all but the first block, so the estimate for transferring k consecutive blocks is s + rd + (k * btt) msec

A more accurate estimate for transferring consecutive blocks takes into account the interblock gap. the interblock gap includes the information that enables the read/ write head to determine which block is about to read. Usually, the disk manufacturer provides a bulk transfer rate (btr) that takes the gap size into account when reading consecutively stored blocks. If the gap size is G bytes, then btr = (B/(B + G)) * tr bytes/msec

Summary seek time: s msec rotational delay: rd msec block transfer time: btt msec transfer rate: tr bytes/msec block size: B bytes interblock gap size: G bytes