Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged disk-scheduling
1
votes
1
answer
31
Andrew S. Tanenbaum (OS) Edition 4 Exercise 5 Question 31 (Page No. 432)
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,$ and $38,$ in that order. A seek takes $6\: msec$ per cylinder. How much seek time is needed for First-come, first served. Closest cylinder next. Elevator algorithm (initially moving upward). In all cases, the arm is initially at cylinder 20.
Disk requests come in to the disk driver for cylinders $10, 22, 20, 2, 40, 6,$ and $38,$ in that order. A seek takes $6\: msec$ per cylinder. How much seek time is needed...
admin
2.0k
views
admin
asked
Oct 28, 2019
Operating System
tanenbaum
operating-system
input-output
disk
disk-scheduling
descriptive
+
–
2
votes
5
answers
32
UGC NET CSE | June 2019 | Part 2 | Question: 41
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in the following sequences: $4, 34, 10, 7, 19, 73, 2, 15, 6, 20$ Assuming that the head is currently at cylinder $50$, what is the time taken to ... the cylinder to adjacent one and the shortest seek time first policy is used? $357$ ms $238$ ms $276$ ms $119$ ms
Consider a disk system with $100$ cylinders. The requests to access the cylinders occur in the following sequences:$$4, 34, 10, 7, 19, 73, 2, 15, 6, 20$$Assuming that the...
Arjun
2.2k
views
Arjun
asked
Jul 2, 2019
Operating System
ugcnetcse-june2019-paper2
disk-scheduling
sstf
+
–
0
votes
0
answers
33
Galvin Edition 9 Exercise 10 Question 15 (Page No. 499-500)
Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of that request's ... and the effective bandwidth. How does performance depend on the relative sizes of seek time and rotational latency ?
Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival o...
akash.dinkar12
479
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
34
Galvin Edition 9 Exercise 10 Question 11 (Page No. 498-499)
Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cylinder $1,805$. The queue of pending requests, in $FIFO$ ... disk-scheduling algorithms ? $a. FCFS$ $b. SSTF$ $c. SCAN$ $d. LOOK$ $e. C-SCAN$ $f. C-LOOK$
Suppose that a disk drive has $5,000$ cylinders, numbered $0$ to $4,999$. The drive is currently serving a request at cylinder $2,150$, and the previous request was at cy...
akash.dinkar12
664
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
0
answers
35
Galvin Edition 9 Exercise 10 Question 10 (Page No. 498)
Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.
Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.
akash.dinkar12
365
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
36
Galvin Edition 9 Exercise 10 Question 9 (Page No. 498)
None of the disk-scheduling disciplines, except $FCFS$, is truly fair (starvation may occur). a. Explain why this assertion is true. b. Describe a way to modify algorithms such as $SCAN$ to ensure fairness. c. Explain why ... more examples of circumstances in which it is important that the operating system be unfair in serving $I/O$ requests.
None of the disk-scheduling disciplines, except $FCFS$, is truly fair (starvation may occur).a. Explain why this assertion is true.b. Describe a way to modify algorithms ...
akash.dinkar12
5.5k
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
37
Galvin Edition 9 Exercise 10 Question 3 (Page No. 497)
Why is rotational latency usually not considered in disk scheduling ? How would you modify $SSTF$, $SCAN$, and $C-SCAN$ to include latency optimization ?
Why is rotational latency usually not considered in disk scheduling ? How would you modify $SSTF$, $SCAN$, and $C-SCAN$ to include latency optimization ?
akash.dinkar12
1.5k
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
0
answers
38
Galvin Edition 9 Exercise 10 Question 2 (Page No. 497)
Explain why $SSTF$ scheduling tends to favor middle cylinders over the innermost and outermost cylinders.
Explain why $SSTF$ scheduling tends to favor middle cylinders over the innermost and outermost cylinders.
akash.dinkar12
316
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
39
Galvin Edition 9 Exercise 10 Question 1 (Page No. 497)
Is disk scheduling, other than $FCFS$ scheduling, useful in a single-user environment ? Explain your answer.
Is disk scheduling, other than $FCFS$ scheduling, useful in a single-user environment ? Explain your answer.
akash.dinkar12
1.9k
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
1
answer
40
How to do this question.
Disk request come into disk driver for cylinders 5, 17, 60, 125, 28, 170, 8, 32. Total moves using SCAN algorithm when disk head is currently positioned at 35 and moving toward higher cylinder number________.(Disk system has 200 cylinders (0 - 199)
Disk request come into disk driver for cylinders 5, 17, 60, 125, 28, 170, 8, 32. Total moves using SCAN algorithm when disk head is currently positioned at 35 and moving ...
`JEET
1.1k
views
`JEET
asked
Jan 21, 2019
Operating System
operating-system
disk-scheduling
+
–
1
votes
4
answers
41
MadeEasy Test Series: Operating System - Disk Scheduling
Rahul_Rathod_
694
views
Rahul_Rathod_
asked
Dec 21, 2018
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
1
votes
2
answers
42
MadeEasy Subject Test 2019: Operating System - Disk Scheduling
I got LOOK ==> 260 CSCAN ==> 383
I got LOOK == 260CSCAN == 383
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Dec 13, 2018
Operating System
made-easy-test-series
operating-system
disk-scheduling
+
–
1
votes
0
answers
43
Self Doubt Disk Scheduling
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6, 38, 2, 40, 20. No of seeks in FCFS SSTF
Suppose a disk has 100 cylinders, numbered from 0 to 99. At some time the disk arm is at cylinder 20, and there is a queue of disk access requests for cylinders 10, 22, 6...
jatin khachane 1
1.2k
views
jatin khachane 1
asked
Dec 11, 2018
Operating System
disk-scheduling
operating-system
+
–
0
votes
0
answers
44
Disk Scheduling
How does LOOK algorithm decides that this is the last request? What technique is used to determine that after this request, instead of going to the end of disk, the direction should be changed?
How does LOOK algorithm decides that this is the last request? What technique is used to determine that after this request, instead of going to the end of disk, the direc...
Astitva Srivastava
822
views
Astitva Srivastava
asked
Dec 3, 2018
Operating System
disk-scheduling
operating-system
+
–
0
votes
4
answers
45
Self Doubt regarding C-SCAN
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk access requests for cylinders 30, 85, 110, 100, 105, 126, 135, 55 and ... the R/W head when the LOOK algorithm is used compared to the CSCAN algorithm is ________. Please also mention the method of C-SCAN.
Consider a disk has 200 cylinders, numbered from 0 to 199. At some time the disk arm is at cylinder 100, and moving towards right direction. There is a queue of disk acce...
Warrior
4.2k
views
Warrior
asked
Nov 4, 2018
Operating System
operating-system
disk-scheduling
+
–
0
votes
1
answer
46
made esay test disk scheduling
amit166
410
views
amit166
asked
Oct 12, 2018
Operating System
disk-scheduling
+
–
0
votes
1
answer
47
Disk Scheduling
Suppose that the head of a moving head disk with 192 tracks(0-191), is currently serving a request at track 80 and has just finished at track 62. The queue of the request is kept in FIFO order: 119, 58, 114, 28, 111, 55, 103, 30, 75. What ... of tracks traversed by head movements needed to satisfy these request for the Elevator disk-scheduling algorithm? a. 143 b. 130 c. 177 d. 547
Suppose that the head of a moving head disk with 192 tracks(0-191), is currently serving a request at track 80 and has just finished at track 62. The queue of the request...
garvit_vijai
3.6k
views
garvit_vijai
asked
Oct 4, 2018
Operating System
disk-scheduling
operating-system
+
–
1
votes
2
answers
48
os syllabus doubt
which topic should i need to learn under file system and disk scheduling for gate??
which topic should i need to learn under file system and disk scheduling for gate??
gatecrack
758
views
gatecrack
asked
Sep 9, 2018
Operating System
syllabus
operating-system
disk-scheduling
+
–
0
votes
0
answers
49
Self doubt
Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 60, 50,10,50,80,25,70. Assume that the initial position of the R/W head is on track 50. 1) If SSTF is used : As current R/W head is at 50 and ... have shortest seek as Head is already at 50 so both 50 request will be served before moving head somewhere else. AM right ? if not please explain
Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given:60, 50,10,50,80,25,70.Assume that the initial position of the R/W head is ...
jatin khachane 1
1.0k
views
jatin khachane 1
asked
Sep 1, 2018
Operating System
operating-system
disk-scheduling
+
–
0
votes
2
answers
50
MadeEasy Test Series: Operating System - Disk Scheduling
Suppose a disk has 200 cylinders numbered from 0 to 199. At some time, disk arm is at cylinder 76 and there is a queue of disk access requests for cylinders: 54, 32, 108, 22, 67, 77, 87, 87, 42, 82 The ... R/W head when the SCAN (elevator) algorithm used is ________tracks. Assume that SCAN algorithm moves towards 199 when it starts execution.
Suppose a disk has 200 cylinders numbered from 0 to 199. At some time, disk arm is at cylinder 76 and there is a queue of disk access requests for cylinders:54, 32, 108, ...
Na462
6.7k
views
Na462
asked
Jul 18, 2018
Operating System
disk-scheduling
operating-system
disk
made-easy-test-series
+
–
0
votes
0
answers
51
Disk Accessing
I solved this question correctly. I have a slight doubt though if say in question it says that Disk address is of K bits then what it represents 2^k Sectors or 2^k blocks ???
I solved this question correctly. I have a slight doubt though if say in question it says that Disk address is of K bits then what it represents 2^k Sectors or 2^k blocks...
Na462
458
views
Na462
asked
Jul 12, 2018
Operating System
operating-system
disk-scheduling
disk
+
–
0
votes
2
answers
52
C-Scan Algorithm
Consider the following track requests in the disk queue: 95, 180, 34, 119, 11, 123, 62, 64 The C-scan scheduling algorithm is used and the read/write head is positioned at location 50. If tracks are numbered from 0 to 199 and head moving ... from one track to another while servicing these requests is ________ msec. [Assume moving from one end to another end will take 10 msec]
Consider the following track requests in the disk queue:95, 180, 34, 119, 11, 123, 62, 64The C-scan scheduling algorithm is used and the read/write head is positioned at ...
Na462
5.0k
views
Na462
asked
Jul 9, 2018
Operating System
disk-scheduling
operating-system
+
–
0
votes
1
answer
53
Ace Test Series: Operating System - Disk Scheduling
Na462
417
views
Na462
asked
Jul 3, 2018
Operating System
operating-system
disk-scheduling
ace-test-series
+
–
0
votes
1
answer
54
FCFS Disk Scheduling
Queue 98, 183, 37, 122, 14, 124, 65, 67 head starts at 53 Find total head movements
Queue 98, 183, 37, 122, 14, 124, 65, 67head starts at 53Find total head movements
ejaz
2.4k
views
ejaz
asked
Jun 10, 2018
Operating System
disk-scheduling
+
–
0
votes
1
answer
55
operating system disk scheduling
any shortcut method for this??
any shortcut method for this??
air1ankit
647
views
air1ankit
asked
Dec 9, 2017
Operating System
operating-system
disk-scheduling
disk
+
–
3
votes
1
answer
56
C-SCAN and C-LOOk
No. of seek distances with C-SCAN and C-LOOK?
No. of seek distances with C-SCAN and C-LOOK?
Ashwani Kumar 2
3.8k
views
Ashwani Kumar 2
asked
Nov 16, 2017
Operating System
operating-system
file-system
disk-scheduling
+
–
0
votes
0
answers
57
OS-(How to approach?)
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB. If the disk has 20 sectors per track and is currently at the end of the 5th sector ... of 6000 rpm, how much time will it take to read 1 MB contiguous data starting from the sector 4 of the outer most track?
A disk has 8 equidistant tracks. The diameters of the innermost and outermost tracks are 1 cm and 8 cm respectively. The innermost track has a storage capacity of 10 MB.I...
vijay_jr
401
views
vijay_jr
asked
Nov 16, 2017
Operating System
operating-system
disk-scheduling
+
–
1
votes
2
answers
58
UGC NET CSE | November 2017 | Part 2 | Question: 37
In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without serving any requests on the return trip. LOOK SCAN C-LOOK C-SCAN
In ________ disk scheduling algorithm, the disk head moves from one end to other end of the disk, serving the requests along the way. When the head reaches the other end,...
Arjun
1.7k
views
Arjun
asked
Nov 5, 2017
Unknown Category
ugcnetcse-nov2017-paper2
operating-system
disk-scheduling
+
–
0
votes
1
answer
59
Doubt in OS: Disk scheduling
In SCAN disk scheduling algorithm, we know that SCAN chooses the request that requires shortest seek distance in a preferred direction. What direction SCAN chooses at the first place before servicing any request? Does it take any random direction or chooses in SSTF manner in the first place? How do SCAN & C-SCAN suffer from indefinite postponement?
In SCAN disk scheduling algorithm, we know that SCAN chooses the request that requires shortest seek distance in a preferred direction.What direction SCAN chooses at the ...
Tuhin Dutta
647
views
Tuhin Dutta
asked
Oct 4, 2017
Operating System
operating-system
disk-scheduling
+
–
3
votes
1
answer
60
disk scheduling
In disk scheduling if header movement direction is not given then which way to move? Please provide any link or source in support of your answer. Thanks
In disk scheduling if header movement direction is not given then which way to move? Please provide any link or source in support of your answer. Thanks
kamakshi
2.6k
views
kamakshi
asked
Oct 3, 2017
Operating System
disk-scheduling
+
–
Page:
« prev
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register