head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of the disk-scheduling algorithms given below, show (by plotting in the graphs below) the current position of head based on the disk arm movement to satisfy the above requests, and count the total distance (in cylinders) of the disk arm movement. First Come First Served (FCFS) 0 40 100 130 150 Total distance (disk arm movement) = Shortest Seek Time First (SSTF) 0 40 100 130 150 Total distance (disk arm movement) = LOOK - in the direction of increasing track number 40 100 130 150 280 280 280 350 350 350 399 399 399

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question
8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of
head is at cylinder 130. The request queue is given as follows:
150, 40, 350, 100, 280
For each of the disk-scheduling algorithms given below, show (by plotting in the graphs
below) the current position of head based on the disk arm movement to satisfy the above
requests, and count the total distance (in cylinders) of the disk arm movement.
a. First Come First Served (FCFS)
0 40
100 130 150
Total distance (disk arm movement) =.
b. Shortest Seek Time First (SSTF)
0
40
100 130 150
Total distance (disk arm movement) =
c. LOOK - in the direction of increasing track number
0
40
100 130 150
Total distance (disk arm movement) =
280
280
280
350
350
350
399
399
399
d. Based on questions ac, specify the best algorithm for the given case above. Also explain
TWO (2) reasons why the disk scheduling algorithm important in disk management.
Transcribed Image Text:8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of the disk-scheduling algorithms given below, show (by plotting in the graphs below) the current position of head based on the disk arm movement to satisfy the above requests, and count the total distance (in cylinders) of the disk arm movement. a. First Come First Served (FCFS) 0 40 100 130 150 Total distance (disk arm movement) =. b. Shortest Seek Time First (SSTF) 0 40 100 130 150 Total distance (disk arm movement) = c. LOOK - in the direction of increasing track number 0 40 100 130 150 Total distance (disk arm movement) = 280 280 280 350 350 350 399 399 399 d. Based on questions ac, specify the best algorithm for the given case above. Also explain TWO (2) reasons why the disk scheduling algorithm important in disk management.
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY