Scribd
Upload
143 views1 page

This Study Resource Was: Exercises

The document describes two exercises involving disk scheduling algorithms. The first asks to calculate the total disk arm traversal distance for various scheduling algorithms given a starting position and queue of requests. The second asks to calculate the total head movement and seek time for different scheduling algorithms given a starting position and new request queue, assuming a track movement rate of 6.

Uploaded by

ىوسوكي صانتوس
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
143 views1 page

This Study Resource Was: Exercises

The document describes two exercises involving disk scheduling algorithms. The first asks to calculate the total disk arm traversal distance for various scheduling algorithms given a starting position and queue of requests. The second asks to calculate the total head movement and seek time for different scheduling algorithms given a starting position and new request queue, assuming a track movement rate of 6.

Uploaded by

ىوسوكي صانتوس
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ORTIZ, JAYRA GAILE H.

BSCS 2-3

Exercises
1. Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The driver is currently serving a
request at cylinder 160 and has previously serviced cylinder 80. The queue of pending requests is as
follows:

94 1455 915 1787 955 1505 1030 1753 1905

Starting from the current head position, what is the total distance traversed by the disk arm in satisfying
all the requests using the ff. disk scheduling algorithm: FCFS, SSTF, SCAN,C-SCAN, LOOK and C-LOOK.

Ans:

143-86 + 1470-86 + 1470-913 + 1774-913 +1774-948+1509-948+1509-1022+1750-1022+1750-

m
130 =7081

er as
co
Currently at 160

eH w
FCFS = (160-94 + 1455-94 + 1455-915 + 1787-915 + 1787-955 + 1505-955 + 1505-1030 + 1753-1030 +

o.
1753-1905 = 5,267
rs e
ou urc
160 94 915 955 1030 1455 1505 1753 1787 1905
SSTF = (160-94) + (915-94) + (955-915) + (1030-955) + (1455-1030) + (1505-1455) + (1753-1787) + (1905-
o

1787) =
aC s

2. The head of moving disk, with 200 tracks numbers 0 to 199, is currently serving a request at track 133
vi y re

and had just finished a request at track 123. If the rate of movement from one track to another track is 6.
What is the total head movement and seek time of each scheduling algorithm?

The disk requests are as follows: 90 160 97 190 98 153 110 180 140
ed d
ar stu
is
Th
sh

This study source was downloaded by 100000761444072 from CourseHero.com on 10-22-2021 07:26:03 GMT -05:00

https://www.coursehero.com/file/89560243/Ortiz-Exercise-4docx/
Powered by TCPDF (www.tcpdf.org)

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy