5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3, 39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF C. SCAN d. LOOK

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3, 39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also calculate the total seek time needed to serve these requests, for each of the following disk-scheduling algorithms? Explain with the help of a diagram in each case. [2X4] a. FCFS b. SSTF C. SCAN d. LOOK

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Q: The equivalent resistance Reg of four resistors R₁, R2, R3 and R4 connected in series is given as…

A: Code: ch=input('Enter the type of connection(1 for series and 2 for parallel): ');if(ch==1 || ch==2)…

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

A: Solution: The queue of pending requests, in FIFO order, is: 2,069 1,212 2,296 2,800 544 1,618 356…

Q: code

A: Given:- An assembly code is given in above question Need to run the given code and mention the…

Q: Suppose you are asked to design a rotating disk where the number of bits per track is constant. You…

A: Consider the information given:

Q: Consider a program that performs the following steps repeatedly: Use the CPU for 4 milliseconds. By…

A: The program in question uses CPU, disk, and network resources to iteratively go through a series of…

Q: A disk drive has 24 cylinders (0-23). Initially, the head points to cylinder 8 (moving towards cy…

A: Here in this question we have given 24 disk cylinder.currently head pointer is at 8.we have to…

Q: operations in a deadlock w

A: Deadlock is a situation that can occur in computer systems when two or more processes are unable to…

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

A: Given data in the question: Rotation speed = 7200 rpm the number of tracks on the one side of the…

Q: Let T (n) be the number of moves in our solution to the n-disc. •move the top n −1 discs from the…

A: This is how you use an intermediate peg to move n discs from the source peg to the destination turn…

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.…

Concept explainers

Hash Table

A hash table also called a hash map, is a data structure that maps key-value pairs. The hash table can be used in complex systems to provide fast access and compact storage. A hash table is a structure that stores data in an abstract data type kind of associative array. It keeps data in an array format, with a distinct index value for every data value. If the index of the required data is known, then the data can be accessed very easily.

Question

100%

5. Suppose that a disk drive has 40 cylinders, numbered 0 to 40. The drive is currently serving a request
at cylinder 20 (the previous request served was at cylinder 19) when the last of these requests is made
with none of these requests yet served. The queue of pending requests, in FIFO order, is 5, 25, 18, 3,
39, 8, and 35. A seek takes 5ms per cylinder movement. Starting from the current head position, what
is the total distance (in cylinders) that the disk arm moves to satisfy all the pending request and also
calculate the total seek time needed to
these requests, for each of the following disk-sc
ling
algorithms? Explain with the help of a diagram in each case. [2X4]
a. FCFS
b. SSTF
c. SCAN
d. LOOK

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

Step 2

Step 3

Step 4

Trending now

This is a popular solution!

Step by step

Solved in 4 steps with 3 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

In the desert there is a jail. After rebellion the single guard has been immobilized. He watched helplessly how prisoners left one by one with different speed in different directions. Later he free himself and took a motobike with extra seat. Now he can follow footprints and pick up one prisoner at a time and bring them back to jail. Each prisoner moves with constant individual speed v_i and left the jail at time t_i. In which order the guard should bring the prisoners back in order to minimize the time?
Calculate the number of disk tracks traversed using the SSTF 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.
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 we have four machines that are using the Berkeley algorithm for clock synchronization. The time daemon is running on machine MO. The other machines are named M1, M2, and M3. The time readings on the four machines are as follows wenty-four hour clocks are usedt. MO 09:10 M1: 08:30 M2 10:10 M3: 07:14 In the third step of the algorithm, what are the values that the time daemon sends to each machine? Assume that the time values are expressed in minutes. Below, these values are presented in a vector value sent to MO, value sent to MI, value sent to M2. value sent to M3I none of these O84, 44, 96, 321 O(24, 16, -84, 92) O192. 84, 16. -24 O-32, 76, 40
Devise an efficient divide-and-conquer algorithm for the Towers of Hanoi problem when the disks are colored alternately red and blue, and we add the extra rule that no disk may be placed on any other disk of the same color.
Consider a disk subjected to I/O requests arriving (following Poisson distribution) at an average rate of requests/second. Assume that on average, there were 5 requests waiting for service in the queue and that each request waits in the queue for about 10 milliseconds, on average. What is the effective arrival rate for this disk?