Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.

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

IT253: Computer Organization
Disk Storage SystemsCSCE430/830 Disk Storage Systems CSCE430/830 Computer Architecture Lecturer: Prof. Hong Jiang Courtesy of Yifeng Zhu (U. Maine) Fall,
CS 277 – Spring 2002Notes 21 CS 277: Database System Implementation Notes 02: Hardware Arthur Keller.
CS 430 – Computer Architecture Disks
The Memory Hierarchy fastest, perhaps 1Mb
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.
13.2 Disks Mechanics of Disks Presented by Chao-Hsin Shih Feb 21, 2011.
1 Lecture 26: Storage Systems Topics: Storage Systems (Chapter 6), other innovations Final exam stats:  Highest: 95  Mean: 70, Median: 73  Toughest.
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.
CPSC-608 Database Systems Fall 2009 Instructor: Jianer Chen Office: HRBB 309B Phone: Notes #5.
CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Input/Output – 5 Disks CS 342 – Operating Systems Ibrahim Korpeoglu Bilkent.
Hard Disks and I/O Polytechnic University CS /25/03.
CPSC-608 Database Systems Fall 2010 Instructor: Jianer Chen Office: HRBB 315C Phone: Notes #5.
12/3/2004EE 42 fall 2004 lecture 391 Lecture #39: Magnetic memory storage Last lecture: –Dynamic Ram –E 2 memory This lecture: –Future memory technologies.
1 CS222: Principles of Database Management Fall 2010 Professor Chen Li Department of Computer Science University of California, Irvine Notes 01.
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.
1 Introduction to Computers Day 4. 2 Storage device A functional unit into which data can be –placed –retained(stored) –retrieved(accessed)
Introduction to Database Systems 1 The Storage Hierarchy and Magnetic Disks Storage Technology: Topic 1.
CS4432: Database Systems II Data Storage (Better Block Organization) 1.
Storage & Peripherals Disks, Networks, and Other Devices.
Lecture 11: DMBS Internals
Physical Storage and File Organization COMSATS INSTITUTE OF INFORMATION TECHNOLOGY, VEHARI.
1 6 Further System Fundamentals (HL) 6.2 Magnetic Disk Storage.
CS 111 – Aug – 1.3 –Information arranged in memory –Types of memory –Disk properties Commitment for next day: –Read pp , In other.
1 Chapter 17 Disk Storage, Basic File Structures, and Hashing Chapter 18 Index Structures for Files.
External Storage Primary Storage : Main Memory (RAM). Secondary Storage: Peripheral Devices –Disk Drives –Tape Drives Secondary storage is CHEAP. Secondary.
File Processing : Storage Media 2015, Spring Pusan National University Ki-Joune Li.
CS /02 Semester II Help Session I/O Colin Tan, S ,
Chapter 8 External Storage. Primary vs. Secondary Storage Primary storage: Main memory (RAM) Secondary Storage: Peripheral devices  Disk drives  Tape.
DMBS Internals I. What Should a DBMS Do? Store large amounts of data Process queries efficiently Allow multiple users to access the database concurrently.
Lecture 40: Review Session #2 Reminders –Final exam, Thursday 3:10pm Sloan 150 –Course evaluation (Blue Course Evaluation) Access through.
Memory and Storage. Computer Memory Processor registers – Temporary storage locations within the CPU – Examples Instruction register – holds the instruction.
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.
CS 101 – Sept. 28 Main vs. secondary memory Examples of secondary storage –Disk (direct access) Various types Disk geometry –Flash memory (random access)
Section 13.2 – Secondary storage management (Former Student’s Note)
1 Lecture 27: Disks Today’s topics:  Disk basics  RAID  Research topics.
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.
Disk Average Seek Time. Multi-platter Disk platter Disk read/write arm read/write head.
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.
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.
CS422 Principles of Database Systems Disk Access Chengyu Sun California State University, Los Angeles.
Storing Data Dina Said.
Chapter 10: Mass-Storage Systems
Computer Science 210 Computer Organization
Backing Store.
Hard Drives.
Oracle SQL*Loader
Disks and Files DBMS stores information on (“hard”) disks.
Lecture 11: DMBS Internals
Lecture 21: Storage Systems
Secondary Storage Devices
CS 140 Lecture Notes: Technology and Operating Systems
CS 140 Lecture Notes: Technology and Operating Systems
Persistence: hard disk drive
Chapter 11: Mass-Storage Systems
CPS216: Advanced Database Systems Notes 04: Data Access from Disks
Introduction to Operating Systems
Presentation transcript:

Magnetic Disk Rotational latency Example Find the average rotational latency if the disk rotates at 20,000 rpm.

Peripheral Devices

Hard Disk

Static Properties

Dynamic Properties

CS501 Advanced Computer Architecture Lecture 32 Dr.Noor Muhammad Sheikh

Magnetic Disk Average latency Example A magnetic disk has an average seek time of 5 ms. The transfer rate is 50 MB/sec. The disk rotates at 10,000 rpm and the controller overhead is 0.2 msec. Find the average time to read or write 1024 bytes.

Magnetic Disk Solution: Average T seek =5ms Average T rot =0.5*60/10,000=3 ms T transfer =1KB/50MB=0.02ms T controller =0.2ms The total time taken= T seek +T rot + T tsfr +T ctr = =8.22 ms

Magnetic Disk: Capacity Example A hard disk with 5 platters has 1024 tracks per platter,512 sectors per track and 512 byte/sectors. What is the total capacity of the disk?

Magnetic Disk: Capacity Solution 512 bytes x 512 sectors=0.2MB/track 0.2MB x 1024 tracks=0.2GB/platter Therefore the hard disk has the total capacity of 5 x 0.2=1GB

Magnetic Disk: Capacity Example How many platters are required for a 40GB disk if there are 1024 bytes/sectors, 2048 sectors per track and 4096 tracks per platter

Magnetic Disk: Capacity Solution The capacity of one platter = 1024 x 2048 x 4096 = 8GB For a 40GB hard disk, we need 40/8 = 5 such platters.

Magnetic Disk transfer time Example Consider a hard disk that rotates every 20 msec. The seek time to move the head between two adjacent tracks is 1 ms. There are 64 sectors per track stored in linear order.

Assume that the read/write head is initially at the start of sector 1 on track 12. a.How long will it take to transfer sector 1 on track 12 to sector 1 on track 13? b.How long will it take to transfer all the sectors on track 12 to corresponding sectors on track 13? Magnetic Disk transfer time

Solution a.Total transfer time=sector read time+head movement time+rotational delay+sector write time Time to read or write on sector=20/64=0.31ms/sector Head movement time=1ms After reading sector 1 on track 12, which takes 0.31 ms, an additional 19.7 ms of rotational delay is needed for the head to line up with sector 1 again. The head movement time of 2 ms gets included in the19.7 ms. Total transfer time=0.31ms+19.7ms+0.31ms=20.3ms Magnetic Disk transfer time

b.The time to transfer all the sectors of track 12 to track 13 can be computed in the similar way. Assume that the memory buffer can hold an entire track. So the time to read or write an entire track is simply the rotational delay for a track, which is 20 ms. The head movement time is 1ms, which is also the time for 1/0.3=3.3  4 sectors to pass under the head. Thus after reading a track and repositioning the head, it is now on track 13, at four sectors past the initial sector that was read on track 12. (Assuming track 13 is written starting at sector 5) therefore total transfer time= =41ms. Magnetic Disk transfer time

Calculate time to read 64 KB (128 sectors) for the following disk parameters. –181.6 GB, 3.5 inch disk –12 platters, 24 surfaces –24,247 cylinders –7,200 RPM; (4.2 ms avg. latency) –7.4/8.2 ms avg. seek (r/w) –65 MB/s (internal) –0.1 ms controller time

Solution Disk latency = average seek time + average rotational delay + transfer time + controller overhead = 7.4 ms x 1/(7200 RPM) /(60000ms/M)) + 64 KB / (65 MB/s) ms = 12.7 ms

Calculate the time to read 64 KB for the previous disk, this time using 1/3 of quoted seek time, 3/4 of internal outer track bandwidth Solution: Disk latency = average seek time + average rotational delay + transfer time + controller overhead = (0.33* 7.4 ms) * 1/(7200 RPM) + 64 KB / (0.75* 64 MB/s) ms = 2.44 ms /(7200 RPM/(60000ms/M)) + 64 KB / (48 KB/ms) ms = ms = 8 ms

Magnetic Disk Example 3: Compare the time taken by a flash memory and a magnetic disk to read or write a 64 KB block. Assume the Flash takes 60 ns to read and 0.001ms to write one byte. 6 ms are required to erase 4 KB. The specifications of magnetic disk are the same as in previous example

Magnetic Disk Solution: The average time to read or write 64KB on a magnetic disk = T seek +T rot + T tsfr +T ctr = =9.48ms Flash read time=64KB/(1B/60ns) =3.83ms Flash write time =64KB/(4KB/6ms)+64KB/(1B/0.001ms) =96 ms +64ms = 160 ms Conclusion: Flash memory is about 2.5 times faster than disk for reading. But it is much slower than disk for writing the same amount of data.