Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served

Database System Concepts
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
See similar textbooks
icon
Related questions
Question
Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served
Transcribed Image Text:Consider a 200 cylinder hard disk with one arm. Suppose the following cylinder requests arrive in order: 65, 124, 67, 122, 14, 98, 37, 183. For each of the disk head scheduling algorithms, list the order in which requests are serviced (earliest is leftmost) and calculate the total distance of the head movement. Assume the arm is over cylinder 53 at the start of servicing. For SCAN, C-SCAN, and LOOK, assume that the head initially moves toward higher numbered cylinders. For C-SCAN, ignore the leap distance in the calculation. (1) First Come First Served
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Knowledge Booster
Fundamentals of Memory
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
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)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education
SEE MORE TEXTBOOKS