For a 100-cylinder disk, compute the total number of head movements for the request queue provided below, using FCFS scheduling and a 100-cylinder disk (0-99). It is expected that the read write head is present at cylinder number 50 at the start of the program. Request queue for disk

For a 100-cylinder disk, compute the total number of head movements for the request queue provided below, using FCFS scheduling and a 100-cylinder disk (0-99). It is expected that the read write head is present at cylinder number 50 at the start of the program. Request queue for disk

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: Consider an ordered disk queue with requests involving tracks 97,145,22,14,124,65 and 67. if the…

A: Answer the above question are as follow

Q: Find out the average waiting time, average response time and average turnaround time of the…

A: A)

Q: This is the specification of the Toshiba MK5059GSXP internal hard drive: Calculate the…

Q: Select the correct answer: The illustration with a request queue (0-199), by using the SCAN…

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

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: Find out the total Head Movement of the Disk Head for the following request queue: 98, 183, 37, 122,…

Q: The disk has 200 tracks numbered from 0-199. The head pointer is currently positioned at 112 moving…

A: Here in this question we have given some disk request and we have asked to find total head movement…

Q: Example-8.4 Consider a UNIX filesystem with the following components: Disk blocks are 096 bytes.…

A: Solution : As the details given, here are the answer.

Q: Consider a single-platter disk with the following parameters: rotation speed:7200 rpm; number of…

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: Consider a single-platter disk with the following parameters: rotation speed: 7200 rpm; number of…

A: Given Data: Rotation Speed = 7200 rpm No. of tracks on one side of platter = 30000 No. of sectors…

Q: A file system with 300GB uses a file descriptor with 8 direct block address. 1 indirect block…

A: INTRODUCTION: In the index node of the Unix file system: Direct block pointer = 8 Single indirect…

Q: Barrier synchronization is used to synchronize two or more processes so that all processes must…

A: In software, a semaphore is defined as a data structure that is useful for solving a variety of…

Q: A CPU with interrupt-driven I/O is busy servicing a disk request. While the CPU is midway through…

A: Interrupts: These are considered as signals that some external devices (mainly I/O devices) transfer…

Q: A file system with 300 GByte disk uses a file descriptor with 8 direct block addresses, I indirect…

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

A: ANSWER:-

Q: c) Suppose a disk has 300 cylinders, numbered from 0 to 299. The drive is currently serving an I/O…

A: (i) SSTF Total head movements- 10+24+10+75+10+18+3+18=168

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: Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record…

A: a)Record Length R= (30+9+9+40+10+8+1+4+4)+1=116 b) Blocking factor bfr = floor (B/R) =…

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: head is at cylinder 130. The request queue is given as follows: 150, 40, 350, 100, 280 For each of…

A: Here in this question we have given a disk with 400 cylinder and we have also given some request to…

Q: A process references five pages, A, B, C, D, and E, in the following order: A; B; C; D; A; B; E;…

A: FIFO stands for "First- In, First-Out". It is a method used for cost flow assumption purposes in the…

Q: To access data in a hard disk, it requires the time to move the head to A. TASK: the desired track…

A: Data :- 5400 RPM 3 ms avg. Seek time 100 MB/ s transfer rate = 100000 kb/s 0.2 ms controller…

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: Algorithm: We will stores the indexes of the tracks that have been requested in ascending order and…

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: C-LOOK is an enhanced version of both SCAN as well as LOOK disk scheduling algorithms. In this…

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: A disk has a capacity of two tera-byte size. Say the file system uses a multi-level inode structure…

A: Introduction Given, A disk of size 2 TB , multilevel inode structure. Disk block size is 512 B .…

Q: Consider a disk with block size B = 512 bytes. A block pointer is P = 6 bytes long, and a record…

A: According to the Bartleby guideline we are suppose to answer only first 3 sub part of the question…

Q: Suppose that a disk drive has 300 cylinders, numbered 0 to 299, the outermost cylinder is number 0.…

A: Algorithm: We will stores the indexes of the tracks that have been requested in ascending order and…

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: te a program that will simulate the FCFS, and LOOK. Assume that: а. The disk's outer track is the 0…

A: *FCFS Scheduling Algorithm* class GFG { static int size = 8; static void FCFS(int arr[], int head) {…

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

A: Shortest Seek Time First : In this disk scheduling algorithm, it starts from the head position to…

Q: Suppose that we have a magnetic disk with the following structure: Each sector is fixed at 512…

A: a) Number of sectors in one cluster = 4 Size of each sector = 512 Bytes Size of each cluster =…

Q: Consider the following problem: You are given a tower of n disks and three pegs. Disks are initially…

A: Tower of Hanoi is a mathematical puzzle where we have three sticks and n disks. The purpose of the…

Q: Assume that you have a program that has a part at the beginning that is sequential in nature (for…

A: Answer:-

Q: Hi, please solve it correctly ,else i will downvote Consider the following disk request sequence…

A: Solution :- Given, Total number of tracks = 100 but it should be 200 because request sequence is…

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: Let us assume a disk with rotational speed of 15,000 rpm, 512 bytes per sector, 400 sectors per…

A: a) Answer : T = transfer time = b/rN Where b = number of bytes to transfer r = rotation speed and N…

Q: We are given a 750 GB disk which has a data transfer rate of 40 Mbps (40 * 10^6 bps) and has 12000…

A: Introduction :Given , Disk space = 750 GBData Transfer Rate = 40 Mbps Rotational Speed : 12000 RPM…

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: Assume that you have a program that has a part at the beginning that is sequential in nature (for…

A: Answer:-

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: (a) Suppose a disk drive has 3,000 cylinders, numbered 0 to 2,999. The drive is currently serving a…

Q: It is given that on a system, on average, an instruction executes in 1 nano second. Suppose that it…

A: Introduction :Given A system , on average, an instruction executes in 1 nano second.page fault…

Question

Request queue for disk cylinders has the following numbers: 75, 25, 30, 68, 40, 89, 10.

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 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
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.
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
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
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
In a main memory-disk virtual storage system, the page size is 1KByte and the OPTIMAL algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
In a main memory-disk virtual storage system, the page size is 1KByte and the FIFO algorithm is used for page replacements. A given program has been allocated three page frames in the main memory and it makes the following 16 memory references when it starts executing (the addresses are given in decimal):500, 2000, 2500, 800, 4000, 1000, 5500, 1500, 2800, 400, 5000, 700, 2100, 3500, 900, 2400 Fill in the contents of the three page frames after each memory reference in a table and calculate the hit ratio. Hint: denote by 'a' the page consisting of locations 0 through 1023 in memory. Similarly, b: 1024-2047, c: 2048-3071, d: 3072-4095, e: 4096-5119 and f: 5120-6143. Round to three decimal places.
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
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
This is the specification of the Toshiba MK5059GSXP internal hard drive: Calculate the average access time for the hard drives. Based on the specification in the Figure above, calculate the total seek time if you were to apply SSTF, SCAN, and C-SCAN algorithms on the hard disk. Assume that the read/write head is currently positioned at location 100 and is moving in the direction of increasing track number. The track requests in the disk queue are as follows: 153, 59, 65, 147, 168, 80, 89, 63 Based on your answer in (b), suggest and justify the algorithm that performs better disk scheduling in terms of: Fair service distribution ii. Disk throughput