Assume the following specification for a hard disk drive Rotation Speed: 7,200 rev/min Arm movement Time: 0.5 msec fixed startup + 0.05 msec for each track crossed. (Startup is constant no matter how far the arm moves.) Surfaces: 2 (The disk has two sides and a single arm holds both of the read/write heads) Average Moves: On average the read/write head moves only 30 tracks Tracks per Surface: 500 Sectors per Track: 20 Characters per Sector: 1024 a) How many characters can be stored on this disk? b) Create a best-case, worst-case, average-case access time table that shows each of seek, latency, transfer and average access times.
Assume the following specification for a hard disk drive Rotation Speed: 7,200 rev/min Arm movement Time: 0.5 msec fixed startup + 0.05 msec for each track crossed. (Startup is constant no matter how far the arm moves.) Surfaces: 2 (The disk has two sides and a single arm holds both of the read/write heads) Average Moves: On average the read/write head moves only 30 tracks Tracks per Surface: 500 Sectors per Track: 20 Characters per Sector: 1024 a) How many characters can be stored on this disk? b) Create a best-case, worst-case, average-case access time table that shows each of seek, latency, transfer and average access times.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
- Assume the following specification for a hard disk drive
Rotation Speed: 7,200 rev/min
Arm movement Time: 0.5 msec fixed startup + 0.05 msec for each track crossed. (Startup is constant no matter how far the arm moves.)
Surfaces: 2 (The disk has two sides and a single arm holds both of the read/write heads)
Average Moves: On average the read/write head moves only 30 tracks
Tracks per Surface: 500
Sectors per Track: 20
Characters per Sector: 1024
- a) How many characters can be stored on this disk?
- b) Create a best-case, worst-case, average-case access time table that shows each of seek, latency, transfer and average access times.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education