Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 100 .The queue of outstanding requests in FIFO order is: 23, 89, 132, 42 and 187. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms?

Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a request at track 100 .The queue of outstanding requests in FIFO order is: 23, 89, 132, 42 and 187. What is the total number of head movements (in cylinders) for the following disk-scheduling algorithms?

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 10P

See similar textbooks

Related questions

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 that a disk drive has 200 cylinders, numbered 0 to 199. The drive is currently servicing…

A: Given that, The total number of cylinders= 200 numbered from 1 to 199 Current service request at…

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: 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: Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a…

A: Operating systems use a disk scheduling algorithm to schedule I/O requests that arrive at the disk.…

Q: Suppose that you have a UNIX file system where the disk block size is 4096 bytes. Disk addresses and…

Q: A UNIX file system (with indexed allocation, inodes with 12 direct, 1 single-indirect, 1…

A: A UNIX file system with indexed allocation, inodes with 12 direct, 1 single-indirect, 1…

Q: Consider a disk drive with 2,000 cylinders, numbered from 0 to 1,999. The request queue has the…

A: A scheduling algorithm is the algorithm which tells us how much CPU time we can allocate the…

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: Consider a UNIX-like file system implemented with i-nodes that resides on a disk of size 512GB. Each…

A: Introduction :Given ,A UNIX like file system,disk size = 512 GB .Number of blocks = 15 Block size =…

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: ppose that a disk drive has 5,000 cylinders, numbered 0 to 4999. The drive is currently serving a…

A: I have solved all the 4 parts and have provided step wise solution for it. In the end we will…

Q: In our discussion of the SSTF disk scheduling algorithm, we stated that the problem of starvation…

A: The Shortest Seek Time First (SSTF) is a disk-scheduling algorithm that operates with the concept of…

Q: Consider a RAID-5 system. Suppose a SQL query reads and updates just one tuple (and, by design, that…

A: RAID 5 is a redundant array of independent disks configuration that uses disk striping with parity.

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: Explain and contrast among the different schemes for organizing a file system: - contiguous…

A: Contiguous Allocation: Contiguous memory allocation is a memory allocation method that allocates a…

Q: d minimu

A: It is given that the file system uses contiguous allocation and the disk consists of 100 data…

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 6,000 cylinders, numbered 0 to 5999. The drive is currently serving a…

A: Here, we have to calculate the sequence of the position of the head and calculation steps using two…

Q: For a 100-cylinder disk, compute the total number of head movements for the request queue provided…

A: In FCFS, the request which arrives first will we served first.

Q: Suppose that a disk drive has 5,000 cylinders, numbered 0 to 4,999. The drive currently serving a…

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

Q: Suppose that we have an ordered file with r = 30000 records stored on a disk with block size B =…

A: The Answer is in given below step

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: For Heap File with a page directory, assume that a page can contain up to 100 directory entries and…

A: Given Statement: In this question firstly we will find out what is already given in our question.…

Q: A disk drive has 1000 cylinders, numbered 0-999. The driver is currently serving a request at…

A: 1 FCFS is First Come First Serve 2 SSTF is Shortest Remaining Time First 3 SCAN in this, Head goes…

Q: Consider a file system that uses indexed file allocation. Disk block size is 1K-byte, and a file…

A: Given that, Disk block size= 1K byte= 1024 bytes File pointer size= 8 bytes Number of direct…

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

A: Starting from head position the total distance that the disk arm moves to satisfy all the pending…

Q: A processor sends 40 disks I/Os per second, these requests are exponent-distributed, and the average…

A: The Answer is

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

Q: Consider a file system that uses indexed allocation with a maximum of one index node per file.…

A: Solution:: The first thing you need to decide/figure out is the size of an index (2 bytes or 4…

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

A: EXPLANATION: C-SCAN: C-SCAN moves the head from one end to the other, serving all demands.…

Q: Stored on a disk. Suppose that we have an ordered file of 30,000 reconds with block size. 1024…

A: Here we have to find the average number of blocks to search for a record with and without index. It…

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: 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: 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: Consider a disk drive that cab complete an average request in 10ms. The time to complete a request…

A: Given: Service time (S)=10 ms=0.01 s Number of request per sec (λ)=117000/(30*60)=65

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

A: Minimise the overhead by picking closest to current head position.

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

A: 1. FCFS (First Come First Served)

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: Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving a…

A: The answer given as below:

Q: Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3,…

A: Answer to the above question is in step2.

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

A: Starting from head position the total distance that the disk arm moves to satisfy all the pending…

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…

Q: Suppose that the head of a disk drive is currently at track 9, that the disk has 32 tracks per…

A: head of the drive is at track 9

Concept explainers

Fundamentals of memory

A collection of connected storage devices form the memory unit. It is a space to store data and instructions required for processing. Information is stored in a memory unit in the form of bits. There are two types of memory namely:

Question

Suppose the head of a moving-head disk with 200 tracks numbered 0 to 199 is currently serving
a request at track 100 .The queue of outstanding requests in FIFO order is: 23, 89, 132, 42 and 187.
What is the total number of head movements (in cylinders) for the following disk-scheduling
algorithms?

Expert Solution

This question has been solved!

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

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Trending now

This is a popular solution!

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

Implement a C program to sort a set of 4-byte float point values in ascending order using radixsort. The values are saved in a file. After sorting, the original file should still save the sorted values. Your program must access the file using memory mapping.
Student information is being held in a data area, where each student record has the following format: The first nine bytes are the student number, held in ASCII The next byte is the course mark The next word is the section identifierThere are well over three hundred such student records that have been loaded sequentially into memory starting at address $10000. The last record loaded is a dummy record with a section identifier of $FFFF, to show the end of the records.Write an assembler subroutine GetMax that will scan the entire list and find the highest mark. If there is a tie, the first student in the list with the highest mark should be found. The subroutine should return the starting address of this record in address register a3.
We can generalize two-pass multiway merge-sort to use more than two passes. On the first pass, we divide the file into as many groups as we can merge in one pass. Then, recursively sort each group, using as many passes as necessary, and finally merge the sorted groups.A file of 1000 blocks is to be externally sorted, using 40 main-memory buffers. How many passes are needed? How many runs remain at the last pass? Find the correct number in the list below. a) The number of passes required is 2.b) The number of passes required is 3.c) The number of runs at the last pass is 10.d) The number of passes required is 1.
RCS adopts a reverse delta approach for storing multiple versions of a file. For example, assume a file has three revisions, 1.1, 1.2, and 1.3, RCS stores the file as of version 1.3, then, the differences between 1.2 and 1.3, and the differences between 1.1 and 1.2. When a new version is created, say 1.4, the difference between 1.3 and 1.4 is computed and stored, and the 1.3 version is deleted and replaced by 1.4. Explain why RCS does not simply store the initial version (in this case 1.1) and the differences between each successive version.
A ring buffer, or circular queue, is a FIFO data structure of a fixed size N. It is useful for transferring data between asynchronous processes or for storing log files. When the buffer is empty, the consumer waits until data is deposited; when the buffer is full, the producer waits to deposit data. Develop an API for a RingBuffer and an implementation that uses an array representation (with circular wrap-around)
Write a C program mexp that multiplies a square matrix by itself a specified number of times. mexp takes a single argument, which is the path to a file containing a square (k × k) matrix M and a non-negative exponent n. It computes Mn and prints the result. Note that the size of the matrix is not known statically. You must use malloc to allocate space for the matrix once you obtain its size from the input file.To compute Mn , it is sufficient to multiply M by itself n −1 times. That is, M3 = M ×M ×M . Naturally, a different strategy is needed for M0 .Input format The first line of the input file contains an integer k. This indicates the size of the matrix M , which has k rows and k columns.The next k lines in the input file contain k integers. These indicate the content of M. Each line corresponds to a row, beginning with the first (top) row.The final line contains an integer n. This indicates the number of times M will be multiplied by itself. n is guaranteed to be non-negative, but…
Write a C program that scans all directories in a UNIX file system and finds and locates all i-nodes with a hard link count of two or more. For each such file, it lists together all file names that point to a file. Explain the key steps in your code and suggest one alternative approach.
In the context of the same file management system, it is planned to offer a sorted view of files by name. For that purpose, there is a need for a compare function that takes two strings (file names) and returns: 0: if both files are the same -1: if the first string comes alphabetically before the second string 1: if the first string comes alphabetically after the second string Examples: compare (abc, abc) → 0 compare (abc, de) →-1 compare (xyz, abcde) → 1 i. Design the compare algorithm as described above. Use pseudocode to describe your algorithm.
Q2: Besides the while-loop in Q1, I want to implement a 2nd while-loop running in parallel with the first while: while(1) { wt(1); XX); } However, on an MCU there is no parallelism. (For ex., on Arduino I can define only one loop() function.) Write a single while that does the job of both whiles. (a) Write it in a procedural style. (b) Write it the super-loop style (state-machine with fixed heartbeat).
Write a program on C++ to implement the three disk-arm scheduling algorithms (FCFS,SST, SCAN). Write a driver program that generates a sequence of cylinder numbers (0–999) at random, runs the three algorithms for this sequence and prints out the total distance (number of cylin-ders) the arm needs to traverse in the three algorithms.
Consider the adjacency matrix below. Upload a plcture (it can be hand drawn) of the adjacency list of the graph. Note: File size must not exceed 1 MB. * A C. 1 1 C 1 1 1 1. 1, 1. 1. 1. A, D.
please make this on access step by step