Hi, please solve it correctly ,else i will downvote Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in right direction. Find the number of head movements in cylinders using FCFS scheduling. Subject code - rcs509

Hi, please solve it correctly ,else i will downvote Consider the following disk request sequence for a disk with 100 tracks. 98, 183, 37, 122, 14, 124, 65, 67 Head pointer starting at 53 (current position of R/W heads) and moving in right direction. Find the number of head movements in cylinders using FCFS scheduling. Subject code - rcs509

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

Similar questions

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
c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O request at cylinder 111 and the disk head was previously serving a request at cylinder 99, and there is a queue of disk access requests for cylinders as below: 181, 199, 150, 160, 85, 178, 109, 75 Starting from the current head position, calculate the total head movements using the following disk scheduling algorithms.(i) SSTF scheduling (ii) SCAN scheduling
I will upvote . Consider a disk pack with 32 surfaces, 64 tracks and 512 sectors per pack. 256 bytes of data are stored in a bit serial manner in a sector. The number of bits required to specify a particular sector in the disk is
Hi, please solve it correctly ,else i will downvote Disk requests come in to the driver for cylinders 8, 24, 20, 5, 41, 8 in that order. A seek takes 6ms per cylinder. Calculate the total seek time for the above sequence of requests using FCFS, SSTF and SCAN disk scheduling policy (the disk arm is initially at cylinder 20). Subject code - rcs509
A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, I indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system will be ?
Consider a disk with tracks numbered from 0 to 255. The disk arm is moving towards highnumbered tracks and it takes 1ms to travel from one track to the next adjacent one. While retrieving data from Track 52, the following list of requests has arrived: 185, 17, 124, 83, 40, 29, 76, 112 Identify the disk scheduling algorithms based on the following descriptions: Selects the disk I/O request that requires the least amount of travel from the current position of the disc arm, regardless of direction. The disc arm moves back and forth over the disk, satisfying requests in its path. Based on your answer in (a), perform disk scheduling analysis using these TWO (2) disks scheduling algorithms. Compute the average seek time for both algorithms. Based on your answer in (b), which algorithm performs better disk scheduling? Justify your answer.
Suppose a disk has N cylinders, numbered from 0 to P. At some time, the disk arm is at cylinder X, and there is a queue of disk access requests for cylinders R1, R2, R3, R4. Explain which Disk scheduling algorithm should be the best to be used between the following a) FIFO b) CSCAN c) SSTF d) FSCAN e) CLOOK N: B • • Choose any acceptable numeric numbers for N, P, X, R1, R2, R3 and R4 • • Plagiarism Will be penalized heavily
Suppose that we have a magnetic disk with the following structure: Each sector is fixed at 512 bytes, and each cluster consists of 4 sectors. Given that a file has reserved 2 clusters with a slack space of 1024 bytes . a- How many sectors will the file will require? b- What will be the physical size of the file? c- What will be the logical size of the file?
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
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
1) Given an O/S with soft timers using a single clock, consider a situation where the event list looks like this: Current time = 4105; Next Signal = 6; Clk Header → 6 → 1 → 3 → 12 → 5 a. What will current time be when the “12” signal is dispatched = b. At time 4113 a new signal arrives to be scheduled for 4125, fill in the following to reflect this signal being added at that time: Current time = ; Next Signal = ; Clk Header → 2) Given a disk with 100 tracks, Consider the following disk request sequence (track numbers): 45, 20, 90, 10, 50, 60, 80, 25, 70. The initial position of the R/W head is on track 50. Determine the distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used and the Elevator algorithm (note -the Elevator algorithm will move towards 100 when it starts execution). Which algorithm will move the fewest tracks , SSTF or Elevator: , and by how many fewer tracks: tracks less than the other algorithm.
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