Select the correct answer:The illustration with a request queue (0-199),by using the SCAN algorithm disk scheduling algorithm,Calculate the total head movement in cylinders for98, 153, 57, 122, 28 and the Head pointer is on 43.O a.169Ob. none of themOC. 327O d. 196O e., 251

Question about calculating head movement of cylinders Request queue(0-199) Using SCAN disk…

Select the correct answer: The illustration with a request queue (0-199), by using the SCAN algorithm disk scheduling algorithn Calculate the total head movement in cylinders for 98, 153, 57, 122, 28 and the Head pointer is on 43. Oa. 169 Ob. none of them OC. 327 O d. 196 O e., 251

Select the correct answer: The illustration with a request queue (0-199), by using the SCAN algorithm disk scheduling algorithn Calculate the total head movement in cylinders for 98, 153, 57, 122, 28 and the Head pointer is on 43. Oa. 169 Ob. none of them OC. 327 O d. 196 O e., 251

Operations Research : Applications and Algorithms

4th Edition

ISBN:9780534380588

Author:Wayne L. Winston

Publisher:Wayne L. Winston

Chapter20: Queuing Theory

Section20.10: Exponential Queues In Series And Open Queuing Networks

Problem 12P

See similar textbooks

Related questions

Q: The first-come, first-served disk scheduling algorithm moves the heads the minimum amount it can to…

A: Ans:- False

Q: Suppose a computer using direct mapped cache has 232232 words of main memory and a cache of 1024…

A: Here, I have to provide a solution to the above question.

Q: Suppose Disk drive has 300 cylinders. The current position of head is 90.The queue of pending…

A: As per QnA guidelines, only first question is answered.

Q: Consider an ordered disk requests queue with involving

A: Total distance to satisfy pending request in C-SCAN = 367

Q: Find out the total Head Movement of the Disk Head for the following request queue: 98, 183, 37, 122,…

Q: Assume the disk contains 100 cylinders (0-99), the head starts at 20, and the queue contain the…

A: The tracks needed here, For this question

Q: We assume that the contiguous allocation method is used for the file system. The block size is 512…

A: Explanation: Since the block size of 512 bytesThe number of bits to address a word/byte offset…

Q: b) Consider a disk queue with requests for I/O to blocks on cylinders 108, 193, 51, 132, 24, 134,…

Q: 11.3. Consider a disk drive with 4,000 cylinders, numbered from 0 to 3,999. The request queue has…

A: ANSWER:-

Q: Suppose a computer using fully associative cache has 2 20 words of main memory and a cache of 128…

A: Introduction: Cache memory, additionally called CPU memory, gives quicker information stockpiling…

Q: Q1) Consider a machine with a byte addressable main memory of 2 bytes and block size of 4 bytes.…

A: Solution: Q. How is a 12-bit memory address divided into tags? line number. and byte number? A.…

Q: Name four disk-arm scheduling algorithms. Outline the basic algorithm for each

A: Disk preparation: It is performed by operating systems to coordinate the arrival of I O requests…

Q: Consider a disk queue with requests for I/O to blocks on cylinders.98 183 37 122 14 124 65 67.…

A: Solution is in Step 2.

Q: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: Disk Scheduling Algorithms are used to decrease any request's total seek time and schedule I/O…

Q: Different algorithms are used for scheduling the disk head so that seek time may be reduced.…

A: note: we are not allowed to solve more than 3 subparts in one question. please post them separately.…

Q: À page fault means that we referenced a page A Outside the memory boundaries B With an incorrect I/O…

A: A page fault means that we referenced a page-

Q: 5) A hard disk (with sectors numbered 0 - 255) currently has its head positioned at sector 73. We…

A: Given that, The number of sectors are 256 from 0 to 255. Initial head position= 73 Queue of disk…

Q: Draw a line between a cache that is fully associative and one that is directly mapped out.

A: In a complete associative cache mapping, each block of main memory may be stored anywhere in the…

Q: Suppose a computer using direct-mapped cache has 232 bytes of byte-addressable main memory and a…

A: A cache is an equipment or programming segment that stores information so future solicitations for…

Q: Modiflow y the beprogram given to include response time program; FCFS CPU SCHEDULING ALGORITHM…

A: Program #include<stdio.h>#include<conio.h>#define max(a,b) ((a) > (b) ? (a) : (b))int…

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: The answer is given in the below step

Q: Known disk queue as follows: 10, 45, 37, 56, 60, 25, 78, 48, 88, 70, 5, 20,30,17,31 with initial…

Q: Different algorithms are used for scheduling the disk head so that seek time may be reduced.…

A: CPU Scheduling is a cycle of figuring out which cycle will possess CPU for execution while another…

Q: QUESTION 13 The first-fit algorithm assumes that the Memory Manager keeps only one list containing…

A: Answer Option B ==> False

Q: 5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

Q: mgsters hold the most active pagr entres and able take I80 s, what must the hit ratio be t ive ry If…

A: The hit ratio to be achieve an effective access time of 125ns is

Q: 4 2 012 0 4 1 2 6 7 3 5 Determine the four pages that are resident in main memory after each page…

A: Number of frames in main memory = 4K / 1K = 4 We will first understand FIFO. Initially, all the…

Q: Write a program on C++ to implement the three disk-arm scheduling algorithms (FCFS,SST, SCAN). Write…

A: As per guidelines I can answer only one. I hope you will understand. Thank You. But there is just…

Q: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: Given: Assume the head of a moving-head disc contains 200 tracks numbered 0 to 199, and it is now…

Q: b) Consider a disk queue with requests for IO to blocks on cylinders 108, 193, 51, 132, 24, 134, 75,…

A: A) First Come - First Serve(FCFS) All income results are placed at the end of the queue. Whatever…

Q: Suppose a computer using set associative cache has 216 words of main memory and a cache of 128…

A: Given: uppose a computer using set associative cache has 216 words of main memory and a cache of…

Q: Consider the following disk request sequence for a disk with 100 tracks 54, 25, 76, 85, 10, 50, 77,…

A: Here in this question we have given some disk request .head position is also given .which is 30…

Q: Think about the distinction that exists between a cache that is completely associative and one that…

A: The above question is solved in step 2 :-

Q: #include #include main() { int bt[20], wt[20], tat[20], i, n; float wtavg, tatavg; clrscr();…

A: for (i = 1; i < n; i++){ wt[i] = wt[i - 1] + bt[i - 1]; tat[i] = tat[i - 1] + bt[i];…

Q: Calculate the number of disk tracks traversed using the SSTF algorithms for the series of disk track…

A: Given: Calculate the number of disk tracks traversed using the SSTF algorithms for the series of…

Q: True or false: Temporal locality is the tendency for a program to access a memory address shortly…

A: Temporal Locality for program

Q: Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10.…

A: Introduction:Given, request for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92 and…

Q: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: C-SCAN is a varient of scan designed to provide a more uniform wait time.

Q: 8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is…

A: Solution:- Above all question can be solved as:-

Q: Calculate the number of disk tracks traversed using the FCFS algorithms for the series of disk track…

A: Given: Calculate the number of disk tracks traversed using the FCFS algorithms for the series of…

Q: Calculate the number of disk tracks traversed using the FCFS, SSTF, SCAN, and LOOK algorithms for…

A: Performance: The speed of the CPU is a key factor that often decides the performance of the system.…

Q: Suppose a computer using direct mapped cache has 2^20 bytes of byte-addressable main memory and a…

A: How many blocks of main memory are there? => Block size 16 bytes = 2⁴ bytes…

Q: Suppose a computer using fully associative cache has 220220 words of main memory and a cache of 128…

A: solution:

Q: The read-read contention problem can not be resolved by inserting wait cycles Why? State two ways to…

Q: 8. Consider one disk with 400 cylinders, numbered 0 to 399. Assume the current position of head is…

Q: Find the total head movements for a request queue given below, using FCFS scheduling for a disk of…

A: The given I/O blocks for FCFS Scheduling 75, 25, 30, 68, 40, 89, 10 where head is initially at…

Q: The EDF scheduler uses ________ to order requests according to their deadlines. a. stack b. disks c.…

A: Given that 43. The EDF scheduler uses ________ to order requests according to their deadlines.…

Q: Write the binary translation of the logical address 0001010010111010 to physical address, under the…

Question

Select the correct answer:
The illustration with a request queue (0-199),
by using the SCAN algorithm disk scheduling algorithm,
Calculate the total head movement in cylinders for
98, 153, 57, 122, 28 and the Head pointer is on 43.
O a.
169
Ob. none of them
OC. 327
O d. 196
O e., 251

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step by step

Solved in 2 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

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.

Similar questions

Find out the total Head Movement of the Disk Head for the following request queue: 98, 183, 37, 122, 14, 124, 65, 67 Using the algorithms: a) FCFS b) SSTF c) SCAN d) C-SCAN e) C-LOOK The question did not state any initial head cylinder number.
Find the total head movements for a request queue given below, using FCFS scheduling for a disk of 100 cylinders (0-99). It is assumed that read write head is initially present at cylinder number 50. Request queue for disk cylinders: 75, 25, 30, 68, 40, 89, 10
Calculate the number of disk tracks traversed using the FCFS algorithms for the series of disk track service requests given as 54,36,21,74,46,35,26,67. At the time the first request arrives in the disk request queue, the read/write head is at track 50, moving toward the outer (lower-numbered)tracks. Draw the graph of the movement. Assume that the disk has 100 tracks from 0 to 99.
Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms? a.FCFS Scheduling b.SCAN Scheduling c.SSTF Scheduling
Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 99 and has just finished a request at track 125. The queue of outstanding requests in FIFO order is: 5, 95, 75, 100,30 and 155. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms? FCFS Scheduling SCAN Scheduling SSTF Scheduling
Consider a disk queue with requests for I/O to blocks on Cylinders: 98 183 37 122 14 124 65 67 Consider SSTF (shortest seek time first) scheduling, the total number of head movements is, if the disk is initially 53. Select one: a.245 b.240 c.236 d.224
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 order, is:2,069 1,2122,2962,8005441,6183561,5234,9653681a. FCFSb. SSTFc. SCANd. LOOKe. C-SCANf. C-LOOK
Disk requests are received by a disk drive for cylinders 13 , 6 , 1 , 29 , 28 , 8 in that order and the head pointer starts at 9 . A seek takes 5 ms per cylinder moved. How much seek time is needed to serve these requests by using the First Come First Served (FCFS) disk scheduling algorithm? a. 315 b. 305 c. 325 d. 320 e. 310
Suppose Disk drive has 300 cylinders. The current position of head is 90.The queue of pending request is 36,79,15,120,199,270,89,170Calculate head movement for the following algorithms. i) FCFS ii) SSTF
Name four disk-arm scheduling algorithms. Outline the basic algorithm foreach
Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the read write head is initially at track 53, what is the total distance that the disk are moves to satisfy all the pending request for C-SCAN?
Suppose the head of a moving head disk with 200 tracks numbered 0-199 is currently servinga request at track 143. It has just finished a request at track 125. If the queue of requests iskept in the FIFO order,86,147,85,177,94,150,102,175,130What is the total head movement to satisfy these requests for the following disk schedulingalgorithms? First Come First Served Shortest Seek Time First SCAN